The maximum value of $z=9x+11y$ subject to $3x+2y \leq 12$,$2x+3y \leq 12$,$x \geq 0$,$y \geq 0$ is . . . . . . .

The maximum value of $Z = 5x + 2y$,subject to the constraints $2x - y \geq 2$,$x + 2y \leq 8$,and $x, y \geq 0$,is:

The cost function $Z$ is given by $Z = 4x + 6y$. It is to be minimized. The feasible region for this function $Z$ is the shaded region represented in the following figure. Then the minimum value of $Z$ is and occurs at the point:

The maximum value of $z=50x+15y$ subject to the constraints $x+y \leq 60$,$5x+y \leq 100$,$x \geq 0$,$y \geq 0$ is at the point:

The solution of the linear programming problem,maximize $Z = 3x_{1} + 5x_{2}$ subject to $3x_{1} + 2x_{2} \leq 18$,$x_{1} \leq 4$,$x_{2} \leq 6$,$x_{1} \geq 0$,$x_{2} \geq 0$ is:

The objective function $Z = 4 x_1 + 5 x_2$,subject to $2 x_1 + x_2 \geq 7$,$2 x_1 + 3 x_2 \leq 15$,$x_2 \leq 3$,$x_1, x_2 \geq 0$ has minimum value at the point