CUET Mathematics - For the linear programing problem, Minimize(Z) = 60x + 30y subject to: 2x - y ≥ -5; 3x + y ≥ 3; 2x - 3y ≤ 12; x, y ≥ 0 the optimal value of z is | PYQs + Solutions

CUET Mathematics 2025 2 June Shift 1

Algebra

Medium

applied

360

150

No Minimum value of Z

✅ Correct Option: 3

Related questions:

26 May Shift 2

If the corner points of bounded feasible region for an LPP are (0,2) (3,0) (6,0) (6,8) and (0, 5) then the minimum value of the objective function f=-4x+6y occur at

30 May Shift 2

The corner points of the bounded feasible region for an LPP are (0,4), (4,4), (6,6), (0,12). If the objective function is $Z = px + qy, p > 0, q > 0$ , then the condition on p and q so that maximum of Z occurs at (6,6) and (0,12) is

13 May Shift 1

If a person rides his motorbike $x$ km at 30 km per hour, he has to spend ₹ 3 per kilometer on petrol. If he rides $y$ km at a faster speed of 40 km per hour, the petrol cost increases to ₹ 4 per kilometer. If he has ₹ 100 to spend on petrol and wishes to find the maximum distance he can travel within one hour, then linear programming problem (LPP) formulation is:

CUET Mathematics 2025 2 June Shift 1 PYQs

Keyboard Shortcuts