Answer: feasible region.
- A feasible region
- B objective function
- C corner point
- D coordinate axis
Correct answer: A. feasible region
Explanation: The feasible region is the set of all points meeting every constraint.
The feasible region (shaded) is bounded by the constraint lines; the fundamental theorem of LPP guarantees the optimal value of the objective function occurs at one of the corner points (O, A, B, C), so only these need to be checked, not the entire region.
Concept context
Optimizing a linear objective function subject to linear constraints using the graphical corner point method.