CUET Mathematics - For the linear programming problem: Minimize z = 2x - 5y, subject to the constraints: x + 2y ≥ 10; 3x + 4y ≤ 24; x,y ≥ 0, then optimal value of z is | PYQs + Solutions

CUET Mathematics 2026 25th May Shift 1

Algebra

Medium

core

-25

-33

-7

-30

✅ Correct Option: 4

Related questions:

12th May Shift 2

In the linear programming problem maximize $Z = 4x+3y$ subject to the constraints $x+y \ge 8$ , $3x+5y \le 15$ , $x\ge0, y\ge0$ , the feasible region has

30 May Shift 2

In an LPP, the feasible region represented by the set off constraints $2x + 3y \leq 18$ , $x + y \leq 10$ , $x \geq 0$ , $y \geq 0$ is

26 May Shift 2

With respect to the following shaded feasible region (ABCDEFA), the maximum value of the objective function z = 3x + 4y – 2 is at point(s):

CUET Mathematics 2026 25th May Shift 1 PYQs

Keyboard Shortcuts