In the linear programming problem maximize subject to the constraints , , , the feasible region has
In the linear programming problem maximize subject to the constraints , , , the feasible region has
Solution
✅ Correct Option: 4
From with we get and , so can never exceed 5. This contradicts , so no point satisfies all constraints and the feasible region is empty.
Related questions:
2025: 21 May Shift 2
2025: 27 May Shift 1
2026: 29 May Shift 1