The $L$.$P$.$P$. to maximize $z=x+y$,subject to $x+y \leq 30, x \leq 15, y \leq 20, x+y \geq 15$,and $x, y \geq 0$ has

The shaded region in the following figure represents the solution set for a certain linear programming problem. The linear constraints for this region are given by:

The minimum value of the objective function $z = 4x + 6y$ subject to the constraints $x + 2y \geq 80$,$3x + y \geq 75$,and $x, y \geq 0$ is:

Solution of the following $LP$ problem
Minimize $z = -3x + 2y$
subject to $0 \leq x \leq 4, 1 \leq y \leq 6, x + y \leq 5$ is $.....$

$A$ wholesale merchant wants to start a cereal business with $Rs \ 24000$. Wheat costs $Rs \ 400$ per quintal and rice costs $Rs \ 600$ per quintal. He has a storage capacity of $200$ quintals of cereal. He earns a profit of $Rs \ 25$ per quintal on wheat and $Rs \ 40$ per quintal on rice. If he stores $x$ quintals of rice and $y$ quintals of wheat,then for maximum profit,the objective function is:

If the feasible region is as shown in the figure,then the related inequalities are: