CUET Mathematics - For a linear programming problem, the feasible region is shown in the figure by shaded portion, then linear constraints are | PYQs + Solutions

CUET Mathematics 2025 30 May Shift 2

Algebra

Medium

common

3x + 4y ≤ 24, x + 2y ≥ 10, x ≤ 0, y ≤ 0

3x + 4y ≥ 24, x + 2y ≥ 10, x ≥ 0, y ≥ 0

3x + 4y ≥ 24, x + 2y ≤ 10, x ≥ 0, y ≥ 0

3x + 4y ≤ 24, x + 2y ≥ 10, x ≥ 0, y ≥ 0

✅ Correct Option: 4

Related questions:

13 May Shift 2

If the corner points of the bounded feasible region of an LPP with objective function Maximize $z = 2x + 3y$ are (0,0), (1,2) and (1,1), then its optimal value is

2 June Shift 1

The corner points of the bounded feasible region for an LP are: (5, 5), (15, 15), (0, 20) and (0, 10). Let $z = 3x + 9y$ be the objective function. Then the value of $maximum(z) - minimum(z)$ 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 30 May Shift 2 PYQs

Keyboard Shortcuts