The corner points of the feasible region are $A(3,3), B(20,3), C(20,10), D(18,12)$ and $E(12, 12)$. The maximum value of $Z=2x+3y$ is $.......$

In the following figure,the feasible region (shaded) for a $LPP$ is shown. Determine the maximum and minimum value of $Z=x+2y$.

For a linear programming problem,the objective function is $Z = 3x + 2y$. If the corner points of the bounded feasible region are $(12, 0)$,$(4, 2)$,$(1, 5)$,and $(1, 10)$,then the maximum value of $Z$ is . . . . . . .

For the $LP$ problem,minimize $z = 2x + 3y$,the coordinates of the corner points of the bounded feasible region are $A(3, 3), B(20, 3), C(20, 10), D(18, 12),$ and $E(12, 12)$. The minimum value of $z$ is:

The corner points of the bounded feasible region are $(60,0), (120,0), (60,40), (40,20)$ and $(20,30)$. For the objective function $z=5x+10y$:
$(i)$ Maximum value of $z$.
$(ii)$ Minimum value of $z$.
$(iii)$ Maximum value of $z$ occurs at.
$(iv)$ Minimum value of $z$ occurs at.

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