When using a graphical solution to a linear programming problem, the optimal solution will lie in an area commonly known as the:
A) region of maximization.
B) feasible region.
C) objective region.
D) constraint region.
E) curvilinear region.

Question

Quizplus · Accepted Answer

The optimal solution to a linear programming problem, when using a graphical solution method, will always lie within the feasible region. This region is defined by the set of all possible points that satisfy all the constraints of the problem, including both the inequality constraints and the non-negativity constraints.

When Using a Graphical Solution to a Linear Programming Problem