The maximum value of $z=x+y$,subjected to $x+y \leq 10, 5x+3y \geq 15, x \leq 6, x, y \geq 0$,

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:

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:

$A$ cottage industry manufactures pedestal lamps and wooden shades,each requiring the use of a grinding/cutting machine and a sprayer. It takes $2 \text{ hours}$ on the grinding/cutting machine and $3 \text{ hours}$ on the sprayer to manufacture a pedestal lamp. It takes $1 \text{ hour}$ on the grinding/cutting machine and $2 \text{ hours}$ on the sprayer to manufacture a shade. On any day,the sprayer is available for at most $20 \text{ hours}$ and the grinding/cutting machine for at most $12 \text{ hours}$. The profit from the sale of a lamp is $Rs. 5$ and that from a shade is $Rs. 3$. Assuming that the manufacturer can sell all the lamps and shades that he produces,how should he schedule his daily production in order to maximise his profit?

The solution set for minimizing the function $z = x + y$ with constraints $x + y \geqslant 2$,$x + 2y \leqslant 8$,$y \leqslant 3$,$x, y \geqslant 0$ contains

$A$ manufacturer of electronic circuits has a stock of $200$ resistors,$120$ transistors and $150$ capacitors and is required to produce two types of circuits $A$ and $B$. Type $A$ requires $20$ resistors,$10$ transistors and $10$ capacitors. Type $B$ requires $10$ resistors,$20$ transistors and $30$ capacitors. If the profit on type $A$ circuit is $Rs. 50$ and that on type $B$ circuit is $Rs. 60$,formulate this problem as a $LPP$ so that the manufacturer can maximize his profit.