CUET Mathematics - The feasible region of a linear programming problem is bounded. The corresponding objective function is Z= 3x-4y. The objective function attains | PYQs + Solutions

CUET Mathematics 2025 29 May Shift 2

Algebra

Medium

applied

Only maximum value of Z attained in the feasible region

Only minimum value of Z attained in the feasible region

both maximum and minimum value of Z attained in the feasible region

either maximum or minimum of Z attained in the feasible region but not both

✅ Correct Option: 3

Related questions:

CUET Mathematics 2024 Slot 1

Which one of the following represents the correct feasible region determined by the following constraints of an LPP?

$x+y \geq 10,2 x+2 y \leq 25, x \geq 0, y \geq 0$

19 May Shift 1

Which one of the following inequalities is redundant for the shaded feasible region (ABCDA) shown below?

14 May Shift 2

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

CUET Mathematics 2025 29 May Shift 2 PYQs

Keyboard Shortcuts