CUET Mathematics 2025 3 June Shift 2 PYQs

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

The corner points of a bounded feasible region determined by the following system of linear inequalities

$x + 3y \leq 60, x + y \geq 10$, $x \leq y$, $x \geq 0$, $y \geq 0$ are (0,10), (5,5), (15, 15) and (0, 20). Let $z = 2px + qy$, $p, q > 0$. If maximum of z occurs at both (15, 15) and (0, 20), then the relation between p and q is

If the objective function $Z = px + qy, p > 0, q > 0$ of a linear programming problem attains its optimal value at the points (4, 7) and (5, 5) and $pq = 50$ then