CUET Mathematics 2026 21st May Shift 1 PYQs

The maximum value of $z$ for the linear programing problem maximize $z = x + y$ subject to the constraints $x + 4y \leq 8, 2x + 3y \leq 12, 3x + y \leq 9, x \geq 0, y \geq 0$ is:

An objective function $z = ax + by$ is maximum at points (15,15) and (0, 20). If $a, b \geq 0$ and $ab = 27$, then the maximum value of the objective function is

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: