The feasible region of the $L$.$P$.$P$. (Linear Programming Problem) to maximize $z = 70x + 50y$ subject to the constraints $8x + 5y \leq 60$,$4x + 5y \leq 40$ and $x \geq 0, y \geq 0$ is:

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

The maximum value of the objective function $z=2x+3y$ subject to the constraints $x+y \leq 5$,$2x+y \geq 4$,$x \geq 0$,and $y \geq 0$ is

$A$ manufacturer makes two types of toys $A$ and $B$. Three machines are needed for this purpose and the time (in $minutes$) required for each toy on the machines is given below:

Types of Toys	Machine-$I$	Machine-$II$	Machine-$III$
$A$	$12$	$18$	$6$
$B$	$6$	$0$	$9$

Each machine is available for a maximum of $6 \, hours$ $(360 \, minutes)$ per day. If the profit on each toy of type $A$ is $Rs. \, 7.50$ and that on each toy of type $B$ is $Rs. \, 5$,find the number of toys of each type that should be manufactured in a day to get maximum profit.

The shaded area in the given figure is a solution set for some system of inequalities. The maximum value of the function $z=4x+3y$ subject to linear constraints given by the system is

The function to be maximized is given by $Z=2x+y$. The feasible region for this function $Z$ is the shaded region shown in the figure. The maximum value of $Z$ is . . . . . . and occurs at the point . . . . . . .