CUET Mathematics - The corner points of the bounded feasible region determined by the system of linear constraints are (15,0), (40,0), (4,18) and (6, 12). If objective function is Z = 30x + z0y, then the sum of the maximum and the minimum values of Z is | PYQs + Solutions

CUET Mathematics 2025 27 May Shift 1

Algebra

Medium

common

900

1650

1620

1680

✅ Correct Option: 3

Related questions:

21 May Shift 1

The corner points of the bounded feasible region determined by the system of linear constraints are $(0, 0), (5, 0), (6, 5), (6, 8), (4, 10), (0,8)$ . Let $z = 3x - 4y$ be the objective function. Then the minimum value of the objective function z occurs at

29 May Shift 2

The feasible region of a linear programming problem is bounded. The corresponding objective function is Z= 3x-4y. The objective function attains

14 May Shift 2

The region represented by the constraints $x \geq 0, y \geq 0$ of an LPP is

CUET Mathematics 2025 27 May Shift 1 PYQs

Keyboard Shortcuts