The number of feasible solutions of the linear programming problem as
Maximum subject to the constraints
is
The number of feasible solutions of the linear programming problem as
Maximum subject to the constraints
is
Solution
✅ Correct Option: 4
The constraints define a bounded polygonal region in the first quadrant with non-empty interior. Every point of that region satisfies all constraints, so there are infinitely many feasible solutions; only the corner points are candidates for the optimum.
Related questions:
2026: 29 May Shift 2
2025: 30 May Shift 1
2025: 13 May Shift 2
2024: 16 May Shift 1
2025: 13 May Shift 2