CUET Mathematics - Consider the following L.P.P. Minimize z = 400x + 300y subject to 100x + 200y ≥ 12000, 300x + 400y ≥ 20000, 200x + 100y ≥ 15000 and x, y ≥ 0. Then | PYQs + Solutions

CUET Mathematics 2025 16 May Shift 1

Algebra

Medium

common

Its feasible region is bounded and optimal point is (60, 30)

Its feasible region is unbounded and optimal point is (60, 30)

Its feasible region is bounded and optimal point is (0, 110)

Its feasible region is unbounded and optimal point is (30, 70)

✅ Correct Option: 2

Related questions:

13 May Shift 2

If the corner points of the bounded feasible region of an LPP with objective function Maximize $z = 2x + 3y$ are (0,0), (1,2) and (1,1), then its optimal value is

27 May Shift 1

For the LPP: minimize $z = 6x + 3y$ subject to the constraints

$4x + y \geq 80$

$x + 5y \geq 115$

$3x + 2y \leq 150$

$x \geq 0, y \geq 0$ then the minimum value of z is

19 May Shift 1

A furniture trader deals in only two items - chairs and tables. He has Rs. 50,000 to invest and a space to store almost 35 items. A chair costs him Rs. 1000 and a table costs him Rs. 2000. The trader earns a profit of Rs. 150 and Rs. 250 on a chair and a table, respectively. Choose the correct option among following that describes the given linear programming problem (LPP) to maximize the profit ( where x and y are the number of chairs and tables that trader buys and sells)?

CUET Mathematics 2025 16 May Shift 1 PYQs

Keyboard Shortcuts