CUET Mathematics - The corner points of the bounded feasible region for an L.P.P are (0, 10), (5, 5), (15,15), and (0, 20). If the objective function is Z=px+qy, p,q>0, then the condition on p and q so that the maximum of Z occurs at (15, 15) and (0, 20) is | PYQs + Solutions

CUET Mathematics 2026 18th May Shift 1

Algebra

Easy

applied

$3q=p$

$3p=q$

$p=2q$

$q=2p$

✅ Correct Option: 2

Related questions:

30 May Shift 3

In a Linear Programming problem, the objective function is always :

30 May Shift 1

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)$ , $\left(\frac{112}{59}, \frac{135}{59}\right)$ and $(0, 3)$ . If the optimum value of Z occurs at both $\left(\frac{112}{59}, \frac{135}{59}\right)$ and $(0, 3)$ , then

14th May Shift 2

The feasible region for a linear programming problem is shown in the figure.

Let $Z = 3x - 4y$ be the objective function, then minimum of Z occurs at the point

CUET Mathematics 2026 18th May Shift 1 PYQs

Keyboard Shortcuts