The region that satisfies all of the constraints in a graphical linear programming problem is called the
A) region of optimality.
B) feasible solution space.
C) region of non-negativity.
D) optimal solution space.

Question

Quizplus · Accepted Answer

The feasible solution space is the region on the graph where all of the constraints are satisfied. This is the region where a valid solution exists, and any point outside of this region is not feasible. The other answer options are not accurate descriptions of this region.

The Region That Satisfies All of the Constraints in a Graphical