CUET Mathematics - A manufacturing unit makes two models, 'classic' and 'supreme' of the scooter. Each piece of the classic model requires 9 labour hours for assembling and 1 labour hour for finishing. Each piece of supreme model requires 12 labour hours for assembling and 3 labour hour for finishing. For assembling and finishing, the maximum labour hours available are 180 and 30 respectively. The company makes a profit of ₹ 10000 on each piece of the classic model and ₹ 15000 on each piece of the supreme model. Which of the following options describes the given Linear Programming Problem (LPP) to maximize the profit Z (Max Z) (where x and y are the number of pieces of the classic model and the supreme model respectively)? | PYQs + Solutions

CUET Mathematics 2025 13 May Shift 2

Algebra

Medium

applied

Max $Z = 10x + 15y$ subject to following constraints $3x + 4y \leq 180, x + 3y \leq 30, x \geq 0, y \geq 0$ .

Max $Z = 10000x + 15000y$ subject to following constraints $9x + y \leq 180, 12x + 3y \leq 30, x \geq 0, y \geq 0$ .

Max $Z = 10000x + 15000y$ subject to following constraints $3x + 4y \geq 180, 12x + 3y \geq 30, x \geq 0, y \geq 0$ .

Max $Z = 10000x + 15000y$ subject to following constraints $3x + 4y \leq 60, x + 3y \leq 30, x \geq 0, y \geq 0$ .

✅ Correct Option: 4

CUET Mathematics 2025 13 May Shift 2 PYQs