The region which satisfies all of the constraints in graphical linear programming is called the
A)optimum solution space.
B)region of optimality.
C)lower left hand quadrant.
D)region of non-negativity.
E)feasible solution space.

Question

Quizplus · Accepted Answer

The feasible solution space in graphical linear programming refers to the area or region on the graph that satisfies all of the constraints of the problem. This is where all possible solutions that meet the given conditions are found, but it does not necessarily indicate the optimal solution.

The Region Which Satisfies All of the Constraints in Graphical