CUET Mathematics - From the below-mentioned graph of shaded feasible region of a linear programming problem (LPP) with objective function z = 1.50x + 1.00y; the maximum value of z will be: | PYQs + Solutions

CUET Mathematics 2025 22 May Shift 2

Algebra

Medium

applied

52.5

61.3

72.4

✅ Correct Option: 2

Related questions:

3 June Shift 2

The region represented by the system of inequalities $x, y \geq 0, y \leq 6, x + y \leq 3$

15 May Shift 2

Consider the following L.P.P minimize $z = x - 7y + 190$ subject to $x + y \leq 8, x + y \leq 5$ and $x, y \geq 0$ . Then which of the following is/are true?

(A) It's feasible region is unbounded

(B) It's feasible region is bounded

(D) It's feasible region has 6 corner points

Choose the correct answer from the options given below:

26 May Shift 2

If the corner points of bounded feasible region for an LPP are (0,2) (3,0) (6,0) (6,8) and (0, 5) then the minimum value of the objective function f=-4x+6y occur at

CUET Mathematics 2025 22 May Shift 2 PYQs

Keyboard Shortcuts