The point at which the maximum value of $Z = 3x + 2y$ subject to the constraints $x + 2y \leq 2$,$x \geq 0$,$y \geq 0$ occurs is $.....$

Corner points of the feasible region determined by the system of linear constraints are $(0,3)$,$(1,1)$ and $(3,0)$. Let $Z = px + qy$,where $p, q > 0$. The condition on $p$ and $q$ so that the minimum value of $Z$ occurs at $(3,0)$ and $(1,1)$ is . . . . . . .

The corner points of the feasible region determined by the system of linear constraints are $(0,0), (0,40), (20,40), (60,20), (60,0)$. The objective function is $z=4x+3y$. Compare the quantity in Column $A$ and Column $B$.

Column	Value
$A$. Maximum of $z$	$300$
$B$. Constant value	$325$

Solve the Linear Programming Problem graphically:
Maximise $Z = 5x + 3y$
subject to the constraints:
$3x + 5y \leq 15$
$5x + 2y \leq 10$
$x \geq 0, y \geq 0$

The feasible solution for a $LPP$ is shown in the figure. Let $z=3x-4y$ be the objective function. The minimum value of $z$ occurs at:

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