Answer: convex set.
- A convex set
- B concave set
- C empty set
- D single point
Correct answer: A. convex set
Explanation: It is the intersection of half-planes, which is always convex.
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.