The linear constraints, for which the shaded area in the figure is the feasible region of an LPP, are : Option 1: x + y ≥ 50 2x + y ≤ 80 x, y ≥ 0 Option 2: x + y ≤ 50 2x + y ≥ 80 x, y ≥ 0 Option 3: x + y ≤ 50 2x + y ≤ 80 x, y ≥ 0 Option 4: x + y ≥ 50 2x + y ≥ 80 x, y ≥ 0

The answer is 'x + y ≤ 50 2x + y ≤ 80 x, y ≥ 0'. View full solution:

CUET Mathematics - The linear constraints, for which the shaded area in the figure is the feasible region of an LPP, are : | PYQs + Solutions

CUET Mathematics 2022 25 May Shift 1

Algebra

Medium

$x + y \geq 50$

$2x + y \leq 80$

$x, y \geq 0$

$x + y \leq 50$

$2x + y \geq 80$

$x, y \geq 0$

$x + y \leq 50$

$2x + y \leq 80$

$x, y \geq 0$

$x + y \geq 50$

$2x + y \geq 80$

$x, y \geq 0$

✅ Correct Option: 3

Related questions:

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

30 Aug Shift 1

The corner points of the feasible region for an L.P.P. are $(0, 10)$ , $(5, 5)$ , $(15, 15)$ and $(0, 20)$ . If the objective function is $z = px + qy$ ; $p, q > 0$ , then the condition on $p$ and $q$ so that the maximum of $z$ occurs at $(15, 15)$ and $(0, 20)$ is

23 May Shift 3

A manufacturing company makes two models M $_1$ and M $_2$ of a product. Each piece of M $_1$ requires 9 labour hours for fabricating and one labour hour for finishing. Each piece of M $_2$ require 12 labour hours for fabricating and 3 labour hours for finishing. For fabricating and finishing, the maximum labour hours available are 180 and 30 respectively. The company makes a profit of Rs.800 on each piece of M $_1$ and Rs.1200 on each piece of M $_2$

The above Linear Programming Problem [LPP] is given by

CUET Mathematics 2022 25 May Shift 1 PYQs

Keyboard Shortcuts