The graphical solution set for the system of inequations $x-2y \leq 2$,$5x+2y \geq 10$,$4x+5y \leq 20$,$x \geq 0$,$y \geq 0$ is given by

Corner points of the feasible region for an $\operatorname{LPP}$ are $(0,2), (3,0), (6,0), (6,8)$ and $(0,5)$. Let $F = 4x + 6y$ be the objective function. The minimum value of $F$ occurs at $....$

The point at which the maximum value of $Z = x + y$ subject to the constraints $x + 2y \leq 70$, $2x + y \leq 95$, $x \geq 0$, $y \geq 0$ occurs is:

The graph with the correct feasible region of the $L.P.P.$ for the constraints $2x + y \leqslant 10$,$y \leqslant x$,$y \leqslant 2$,$x, y \geqslant 0$ is $\ldots$

$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.

For the $LPP$,maximize $z=x+4y$ subject to the constraints $x+2y \leq 2$,$x+2y \geq 8$,$x, y \geq 0$.