CUET Mathematics 2025 26 May Shift 2 PYQs

The maximum value of a LPP $z = 3x + 4y$ subject to the constraints: $x + y \leq 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 for a linear programming problem (LPP) is $Z = 4x + 5y$ and the corner points of the bounded feasible region are (0, 0), (4, 3), (2, 5), and (0,8), then the minimum value of Z is: