CUET Mathematics - The corner points of the bounded feasible region for a linear programming problem (LPP) are (0, 3/2), (1, 2) and (4, 0). If the objective function is Z = ax + by, where 'a' and 'b' are positive, then the condition on 'a' and 'b' so that the maximum of Z occurs at (1, 2) and (4, 0) is: | PYQs + Solutions

CUET Mathematics 2025 16 May Shift 1

Algebra

Medium

applied

a+2b

2a=b

3a = 2b

3a = 4b

✅ Correct Option: 3

Related questions:

27 May Shift 1

Match List-I with List-II

List-I	List-II
(A) Corner point of a feasible region	(I) The line segment joining any two arbitrary points of the region always lies entirely within the region
(B) Bounded feasible region	(II) can not be enclosed within a circle
(C) Unbounded feasible region	(III) can be enclosed within a circle
(D) Convex region	(IV) Is a point of intersection of two boundary lines in the feasible region

Choose the correct answer from the options given below:

2 June Shift 1

Linear inequalities corresponding to the shaded feasible region OABCO in the given figure are

21 May Shift 1

In a linear programming problem(LPP), the maximum value of the objective function $Z = 2x + 5y$ subjected to the constraints:

$2x + 3y ≤ 6$

$2x + y ≤ 4$

$x, y ≥ 0$

CUET Mathematics 2025 16 May Shift 1 PYQs