CUET Mathematics - The corner points of the bounded feasible region associated with the LPP: Maximize Z=px+qy, p,q>0 are (0, 0), (3.5, 0), (112/59, 135/59) and (0, 3). If the optimum value of Z occurs at both (112/59, 135/59) and (0, 3), then | PYQs + Solutions

CUET Mathematics 2025 30 May Shift 1

Algebra

Hard

common

$3q = 5p$

$8p = 3q$

$5p = 8q$

$3p = 5q$

✅ Correct Option: 2

Related questions:

14 May Shift 2

For an LPP: Maximize $z = 3x + 9y$ , $x \geq 0, y \geq 0$ , the feasible region OAB is shown in the figure, then the other constraints are

16 May Shift 1

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:

13 May Shift 1

Consider the LPP: Maximize $z = x + y$ subject to the constraints $x + 2y \leq 70$ , $2x + y \leq 95$ , $x,y \geq 0$ . The optimal feasible solution is

CUET Mathematics 2025 30 May Shift 1 PYQs

Keyboard Shortcuts