The feasible region for a $LPP$ is shown in the figure. Find the maximum value of $Z=11x+7y$.

The corner points of the feasible region are $(0,0), (16,0), (8,12), (0,20)$. The maximum and minimum values of $Z = 22x + 18y$ are $m$ and $n$ respectively,then $m + n = \dots$

In a Linear Programming Problem ($L$.$P$.$P$.), the corner points of the feasible region determined by the constraints $3x - y \geq 6$, $x \leq 3$, $y \leq 2$, $y \geq 0$, and $x \geq 0$ are:

The objective function of a Linear Programming Problem $(LPP)$ is

An oil company has two depots $A$ and $B$ with capacities of $7000 \, L$ and $4000 \, L$ respectively. The company is to supply oil to three petrol pumps,$D, E$ and $F$ whose requirements are $4500 \, L, 3000 \, L$ and $3500 \, L$ respectively. The distances (in $km$) between the depots and the petrol pumps are given in the following table:

From/To	$A$	$B$
$D$	$7$	$3$
$E$	$6$	$4$
$F$	$3$	$2$

Assuming that the transportation cost of $10 \, L$ of oil is $Rs. \, 1$ per $km$,how should the delivery be scheduled in order that the transportation cost is minimum? What is the minimum cost?

For a linear programming problem, the objective function is $z = px + qy$, where $p, q > 0$. If at the corner points $(0, 10)$ and $(5, 5)$ the values of $z$ are $90$ and $60$ respectively, then the relation between $p$ and $q$ is . . . . . . .