CUET Mathematics - If the objective function for a linear programming problem (LPP) is Z = 4x + 5y and the corner points of the bounded feasible region are (0, 0), (4, 3), (2, 5), and (0,8), then the minimum value of Z is: | PYQs + Solutions

CUET Mathematics 2025 15 May Shift 2

Algebra

Easy

applied

✅ Correct Option: 2

Related questions:

22 May Shift 1

The minimum value of $z = 3x + 2y$ subjected to the constraints $2x + y \geq 7, x + 2y \geq 8, x, y \geq 0$ is

22 May Shift 1

Consider the LPP: Max $Z = 5x + 3y$ subject to $3x + 5y \leq 15, 5x + 2y \leq 10, x \geq 0, y \geq 0$

Match List-I with List-II

List-I	List-II
(A) Objective function	(I) $3x + 5y \geq 15$
(B) One constraint	(II) $x, y \geq 0$
(C) Non-negative restrictions	(III) $Z = 5x + 3y$
(D) Point $(1, 2)$ does not lie in the region	(IV) $3x + 5y \leq 15$

Choose the correct answer from the options given below:

30 May Shift 2

For the L.P.P. Maximize z = 10x + 6y subjected to

3x + y ≤ 12,

2x + 5y ≤ 34,

x, y ≥ 0.

Then the feasible region represented by system of inequalities is

CUET Mathematics 2025 15 May Shift 2 PYQs