The corner points of the feasible region determined by the system of linear constraints are $(0,10), (10,15), (15,25), (0,30)$. Let $z = px + qy$,where $p, q > 0$. The condition on $p$ and $q$ so that the maximum of $z$ occurs at both the points $(15,25)$ and $(0,30)$ is . . . . . . .

Corner points of the bounded feasible region for an $LP$ problem are $(0,4), (6,0), (12,0), (12,16)$ and $(0,10)$. Let $z = 8x + 12y$ be the objective function. Match the following:
$(i)$ Minimum value of $z$ occurs at $\ldots$
$(ii)$ Maximum value of $z$ occurs at $\ldots$
$(iii)$ Maximum of $z$ is $\ldots$
$(iv)$ Minimum of $z$ is $\ldots$

The maximum value of $Z = 3x + 4y$ subject to the constraints $x + y \leq 4, x \geq 0, y \geq 0$ is . . . . . . .

The corner points of the feasible region determined by the system of linear constraints are $(2, 72)$,$(15, 20)$,and $(40, 15)$. Let $Z = 6x + 3y$ be the objective function. The minimum value of $Z$ occurs at:

The feasible region for an $LPP$ is shown in the figure. Let $z=3x-4y$ be the objective function. The maximum value of $z$ is $....$

The corner points of the feasible region determined by the system of linear inequalities are $(0,3), (1,1)$ and $(3,0)$. Let $Z = px + qy$ where $p, q > 0$. Find the condition on $p$ and $q$ such that the minimum of $Z$ occurs at both $(3,0)$ and $(1,1)$.