CUET Mathematics 2025 22 May Shift 1 PYQs

The objective function of an LPP is $z = ax + py, (a, p > 0)$ in that has to be maximized/minimized subject to constraints

$x + y \leq 3$, $x \geq 0$, $y \geq 0$. Then max (z) = min (z) is equal to

For the L.P.P. Maximize z = 10x + 6y subjected to

3x + y ≤ 12,

2x + 5y ≤ 34,

x, y ≥ 0.

Then the feasible region represented by system of inequalities 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