A linear-programming problem in which some or all of the variables x_j are constrained by upper-bound conditions of the form x_j ≤ u_j, where u_j is a given finite bound. It can be solved by a special adaptation of the simplex method in which the upper-bounded constraints are considered implicitly. Simplex method.