CUET Mathematics - The feasible region of a LPP is bounded. The corresponding objective function is Z= 6x - 7y. Then objective function attains: | PYQs + Solutions

CUET Mathematics 2025 29 May Shift 2

Algebra

Medium

core

Only maximum in the feasible region

Only minimum in the feasible region

both maximum and minimum in the feasible region

either maximum or minimum but not both in the feasible region.

✅ Correct Option: 3

Related questions:

14 May Shift 2

The maximum value of the objective function $Z = 8x + 2y$ of an LPP subject to constraints $2x + y \leq 4, 2x + 3y \leq 6, x \geq 0, y \geq 0$ is:

14 May Shift 1

Which of the following is NOT a basic requirement of the linear programming problem (LPP)?

19 May Shift 1

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

CUET Mathematics 2025 29 May Shift 2 PYQs

Keyboard Shortcuts