The production of item $A$ is $x$ and the production of item $B$ is $y$. If the corner points of the bounded feasible region are $(1,0), (2,0), (0,2)$ and $(0,1)$,then the maximum profit $z = 2000x + 5000y$ is $\ldots \ldots$

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 feasible region for the constraints $x-2 \leqslant y$,$x \geqslant y-1$,$x \geqslant 2$,$y \leqslant 4$,$x, y \geqslant 0$ is represented by:

$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 solution set of the constraints $2x + 3y \leq 6$,$x + 4y \leq 4$,$x \geq 0$,and $y \geq 0$ includes the point $\ldots$ as a corner point.

$A$ scholarship amount is given by $z = 550x + 300y$ and is to be distributed among $x$ boys and $y$ girls. From the graph given below,the maximum amount of scholarship is . . . . . . .