For the feasible region $OCDBO$ shown in the figure,the maximum value of the objective function $z = 3x + 4y$ is:

The maximum value of $z=x+y$,subjected to $x+y \leq 10, 5x+3y \geq 15, x \leq 6, x, y \geq 0$,

The shaded region in the following figure is the solution set of the inequations:

For the Linear Programming Problem ($L$.$P$.$P$.),maximize $z = 4x_1 + 2x_2$ subject to the constraints $3x_1 + 2x_2 \geq 9$,$x_1 - x_2 \leq 3$,$x_1 \geq 0$,$x_2 \geq 0$,the problem has:

For the linear programming problem, $x + 2y \leq 10$, $3x + y \leq 12$, $x, y \geq 0$, the maximum value of $z = 5x + 10y$ occurs at every point on the line segment joining the points..

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