Question

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.

Answer

This answer is hidden. It contains 25 characters.