CUET Mathematics - The corner points of the feasible region with the constraints x + y ≤ 30, x + y ≥ 15, y ≤ 20, x ≤ 15 and x, y ≥ 0 are | PYQs + Solutions

CUET Mathematics 2025 29 May Shift 2

Algebra

Medium

core

(0,0), (0, 15), (0,20), (15,0), (10, 20)

(0, 15), (20,0), (15,0), (10, 20)

(15,0), (15,15), (10, 20), (0, 20), (0,15)

(0, 0), (20,0), (0, 15), (15, 15)

✅ Correct Option: 3

Related questions:

14 May Shift 2

The maximum value of the objective function $Z = 2x + y$ of an LPP, subject to the constraints $x \leq 6, y \leq 2, x - y \leq 0$ , $x \geq 0, y \geq 0$ is

16 May Shift 1

The corner points of the bounded feasible region for a linear programming problem (LPP) are (0, 3/2), (1, 2) and (4, 0). If the objective function is Z = ax + by, where 'a' and 'b' are positive, then the condition on 'a' and 'b' so that the maximum of Z occurs at (1, 2) and (4, 0) is:

29 May Shift 2

If $z = 5x + 8y$ is the objective function of a LPP and (0, 0), (3, 1), (2, 4), (0, 3), (5, 0) are corner points of the bounded feasible region, then the maximum value of the objective function is

CUET Mathematics 2025 29 May Shift 2 PYQs

Keyboard Shortcuts