The solution of LPP max.(z) = 5x + 3y subject to 2x + y ≤ 6 x + y ≤ 4 x ≥ 0, y ≥ 0, is Option 1: x = 3, y = 3, z = 24 Option 2: x = 2, y = 2, z = 16 Option 3: x = 2, y = 2, z = 20 Option 4: x = 0, y = 4, z = 12

The answer is 'x = 2, y = 2, z = 16'. View full solution:

CUET Mathematics - The solution of LPP max.(z) = 5x + 3y subject to 2x + y ≤ 6 x + y ≤ 4 x ≥ 0, y ≥ 0, is | PYQs + Solutions

CUET Mathematics 2022 7 Aug Shift 2

Algebra

Easy

$x = 3, y = 3, z = 24$

$x = 2, y = 2, z = 16$

$x = 2, y = 2, z = 20$

$x = 0, y = 4, z = 12$

✅ Correct Option: 2

Related questions:

15 June Shift 2

Match List - I with List - II.

List - I	List - II
(A) The common region determined by all the constraints of LPP is called	(I) objective function
(B) Minimize $z = c_1x_1 + c_2x_2 + ..... + c_nx_n$ is	(II) convex set
(C) A solution that also satisfies the non-negative restrictions of a LPP is called	(III) feasible region
(D) The set of all feasible solutions of a LPP is a	(IV) feasible solution

Choose the correct answer from the options given below :

2 June Shift 1

The feasible region corresponding to the linear constraints of a Linear Programming Problem (LPP) is represented by the shaded region in the given figure. Which of the following is not a constraint to the given LPP?

15 May Shift 1

The constraints of the given shaded feasible region below of an L.P.P., for non-negative variable constraints $x$ and $y$ are

CUET Mathematics 2022 7 Aug Shift 2 PYQs

Keyboard Shortcuts