CUET Mathematics - For the linear programming problem (LPP), Maximize Z = 7x + 9y, subject to constraints, x - y ≤ -1, -x + y ≤ 0, x, y ≥ 0. Which of the following is correct? | PYQs + Solutions

CUET Mathematics 2025 15 May Shift 1

Algebra

Medium

applied

The feasible region is bounded.

The optimal value of the objective function exists at the point (1, 1).

The optimal value of the objective function is 16.

No feasible region exists.

✅ Correct Option: 4

Related questions:

13 May Shift 2

The feasible region of the linear programming problem is represented below:

The constraints of this LPP are

29 May Shift 2

The feasible region for an LPP is shown by shaded region in the figure. Then the minimum value of Z = 11x + 7y is

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 15 May Shift 1 PYQs

Keyboard Shortcuts