CUET Mathematics 2025 13 May Shift 2 PYQs

From the below-mentioned graph of shaded feasible region of a linear programming problem (LPP) with objective function

$z = 1.50x + 1.00y$; the maximum value of $z$ will be:

As per the below-mentioned graph of shaded bounded feasible region of the LPP, the maximum value of the objective function $z = 2x + y$ 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