CUET Mathematics 2025 3 June Shift 1 PYQs

The corner points of the feasible region determined by a system of linear constraints are $(0, 0)$, $(0, 40)$, $(20, 40)$, $(60, 20)$, $(60, 0)$. If the objective function is $z = 4x + 3y$, then which one of the following is true?

Consider the Linear Programming Problem

Maximize $z = x + y$

Subject to the constraints $x - y \leq -1$, $x \geq y$, $x \geq 0, y \geq 0$

Then which one of the following is TRUE?

If the feasible region of an LPP is bounded and the corresponding objective function is $z = 5x - 9y$, then the objective function attains:

1. only maximum value in the feasible region
2. only minimum value in the feasible region
3. both maximum and minimum values in the feasible region
4. neither maximum nor minimum value in the feasible region