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:

The function to be maximized is given by $Z=3x+2y$. The feasible region for this function is the shaded region shown in the figure. The linear constraints for this region are given by:

$A$ man rides his motorcycle at the speed of $50 \, km/h$. He has to spend $Rs. \, 2$ per $km$ on petrol. If he rides it at a faster speed of $80 \, km/h$,the petrol cost increases to $Rs. \, 3$ per $km$. He has at most $Rs. \, 120$ to spend on petrol and one hour's time. He wishes to find the maximum distance that he can travel. Express this problem as a linear programming problem.

The minimum value of $Z = 3x + y$, subject to the constraints $2x + 3y \leq 6$, $x + y \geq 1$, $x \geq 0$, $y \geq 0$ is....

$A$ farmer mixes two brands $P$ and $Q$ of cattle feed. Brand $P$,costing $Rs. 250$ per bag,contains $3$ units of nutritional element $A$,$2.5$ units of element $B$ and $2$ units of element $C$. Brand $Q$ costing $Rs. 200$ per bag contains $1.5$ units of nutritional element $A$,$11.25$ units of element $B$,and $3$ units of element $C$. The minimum requirements of nutrients $A$,$B$ and $C$ are $18$ units,$45$ units and $24$ units respectively. Determine the number of bags of each brand which should be mixed in order to produce a mixture having a minimum cost per bag? What is the minimum cost of the mixture per bag?

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: