CUET Mathematics - Consider the Linear Programming Problem Maximize z = x + y Subject to the constraints x - y ≤ -1, x ≥ y, x ≥ 0, y ≥ 0 Then which one of the following is TRUE? | PYQs + Solutions

CUET Mathematics 2025 19 May Shift 1

Algebra

Medium

common

Maximum $z = 3$ at $(1, 2)$

There is no solution

Maximum $z = 15$ at $(7, 8)$

Maximum $z = 10$ at all points on the line $x - y = -1$

✅ Correct Option: 2

Related questions:

21 May Shift 1

If the objective function $z = px + qy$ has its maximum value at the points (2, 1) and (0, 6), then the relationship between p and q is:

21 May Shift 2

Which one of the following represents the correct feasible region determined by the following constraints

$x - y \geq 5$ , $5x - 5y \geq 16$

13 May Shift 2

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)?

CUET Mathematics 2025 19 May Shift 1 PYQs

Keyboard Shortcuts