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

Determine the maximum value of $Z=11 x+7 y$ subject to the constraints:
$2 x+y \leq 6, x \leq 2, x \geq 0, y \geq 0$

Determine the maximum value of $Z=3x+4y$ if the feasible region (shaded) for a $LPP$ is shown in the adjacent figure.

The coordinates of the corner points of the bounded feasible region are $(0,10), (5,5), (15,15)$,and $(0,20)$. The maximum value of the objective function $Z = 10x + 20y$ is:

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 $.......$

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: