A linear programming solution
A)always involves more than one constraint.
B)always involves a corner point.
C)is the one with the highest vertex coordinates.
D)is provided by the input-output coefficients.

Question

Quizplus · Accepted Answer

A linear programming problem involves finding the maximum or minimum value of a linear objective function subject to linear constraints. The feasible region, where all the constraints are satisfied, is a bounded convex set. A corner point of this set is a vertex and every optimal solution occurs at a vertex of the feasible region. Therefore, a linear programming solution always involves a corner point.

A Linear Programming Solution