Algebra > Linear Programming
Medium
core
Consider a L.P.P, Maximize $Z = 3x + 5y$ subject to constraints $2x + 6y ≤ 6$, $x - y ≥ 0$, $x ≥ 0$, $y ≥ 0$. Then which of the following are true? (A) The feasible region of L.P.P is bounded region (B) The corner points of the feasible region are (0, 0), (2, 2), (0, 1) (C) Maximum value of Z is 9 (D) Point (1, 3) lies in the feasible region Choose the correct answer from the options given below:
✅ Correct Option: 1
Related questions:
2025: 13 May Shift 2
2025: 26 May Shift 2
2025: 2 June Shift 1
2025: 19 May Shift 1