CUET Mathematics - 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 | PYQs + Solutions

CUET Mathematics 2022 30 Aug Shift 1

Algebra

Medium

$p = q$

$p = 2q$

$q = 3p$

$q = 2p$

✅ Correct Option: 3

Related questions:

27 May Shift 1

The corner points of the bounded feasible region determined by a set of constraints in an LPP are P(0, 5), Q(3, 5), R(5, 0) and S(4, 1). If the objective function is $z = ax + 2ay$ , where $a, b > 0$ then the condition on $a$ and $b$ such that the maximum value of z occurs at Q and S is

15 May Shift 1

Let the corner points of the bounded feasible region of the linear programming problem (LPP) $Z = ax+by$ be: (0, 0), (2, 0), (20/19, 45/19) and (0, 3). If the optimal value of Z occurs at both points (2, 0) and (20/19, 45/19), then the relation between a and b is:

27 May Shift 1

The feasible region represented by the constraints: $x + 2y \geq 100$ , $2x - y \leq 0$ , $2x + y \leq 200$ , $x \geq 0$ , $y \geq 0$ of an LPP is:

CUET Mathematics 2022 30 Aug Shift 1 PYQs

Keyboard Shortcuts