CUET Mathematics - The feasible region corresponding to the linear constraints of a Linear Programming Problem (LPP) is represented by the shaded region in the given figure. Which of the following is not a constraint to the given LPP? | PYQs + Solutions

CUET Mathematics 2025 2 June Shift 1

Algebra

Medium

core

$x + 2y \leq 10$

$x + y \geq 2$

$x - y \geq 1$

$x - y \leq 1$

✅ Correct Option: 3

Related questions:

CUET Mathematics 2024 Slot 1

The corner points of the feasible region for an L.P.P. are $(0,10),(5,5),(5,15)$ and $(0,30)$ . If the objective function is $Z=\alpha x+\beta y, \alpha, \beta>0$ , the condition on $\alpha$ and $\beta$ so that maximum of $Z$ occurs at corner points $(5,5)$ and $(0,20)$ is :

19 May Shift 1

Which one of the following inequalities is redundant for the shaded feasible region (ABCDA) shown below?

15 May Shift 2

An objective function $z = ax + by$ is maximum at points (15,15) and (0, 20). If $a, b \geq 0$ and $ab = 27$ , then the maximum value of the objective function is

CUET Mathematics 2025 2 June Shift 1 PYQs

Keyboard Shortcuts