CUET Mathematics 2026 29th May Shift 1 PYQs

In linear programming, the optimal value of the objective function is attained at the points given by

The corner points of the bounded feasible region determined by the system of linear inequalities are $(0,0)$, $(4,0)$, $(2,4)$ and $(0,5)$. If maximum value of $z = ax + by$, where $a,b > 0$, occurs at both $(2,4)$ and $(4,0)$ then

While solving an LPP, the corner points of a bounded feasible region were found to be (0,0), (1, 9), (3, 7), (4, 5.5) and (10, 0). The objective function $Z = 4x + y$ will maximise at: