CUET Mathematics - The optimal solution of the Linear Programming problem Maximize Z = 3x_1 + 5x_2, s.t. 3x_1 + 2x_2 ≤ 18 x_1 ≤ 4 x_2 ≤ 6 x_1 ≥ 0, x_2 ≥ 0 is | PYQs + Solutions

CUET Mathematics 2022 6 Aug Shift 2

Algebra

Medium

$(4, 5)$

$(2, 6)$

$(4, 3)$

$(3, 6)$

✅ Correct Option: 2

Related questions:

14 May Shift 2

The minimum value of the objective function $z = x + 2y$ of an L.P.P. subject to constraints $2x + y \geq 3, \frac {x} {2} + 2y \geq 6, x \geq 0, y \geq 0$ is:

16 May Shift 1

The corner points of the bounded feasible region determined by a set of constraints (linear inequalities) are A(0, 5), B(3, 5), C(5, 0) and D(4, 1) and the objective function is z = $px$ + 2 $qy$ where p,q > 0. The condition on $p$ and $q$ such that the maximum z occurs at B and D, is:

3 June Shift 2

The region represented by the system of inequalities $x, y \geq 0, y \leq 6, x + y \leq 3$

CUET Mathematics 2022 6 Aug Shift 2 PYQs

Keyboard Shortcuts