The optimal solution in a linear programming problem:
A) is determined by solving all constraints as equalities.
B) always exists.
C) typically occurs in the interior of the feasible region.
D) occurs at a corner of the feasible region.
E) always involves at least one nonbinding constraint.

Question

Quizplus · Accepted Answer

The optimal solution in a linear programming problem occurs at a corner of the feasible region, where at least one binding constraint is active. This is known as the corner-point or vertex solution. It is not necessary for all constraints to be binding at the optimal solution.

The Optimal Solution in a Linear Programming Problem