Answer: infinitely many optimal solutions.
- A a unique solution
- B no solution
- C infinitely many optimal solutions
- D an unbounded solution
Correct answer: C. infinitely many optimal solutions
Explanation: The entire edge joining those corners is optimal, giving infinitely many solutions.
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.