Answer: Feasible region.
- A Objective set
- B Feasible region
- C Corner set
- D Decision region
Correct answer: B. Feasible region
Explanation: The feasible region is the common region (intersection) of all the constraint half-planes, containing every feasible solution.
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.