The shaded area in the figure below is the solution set for a certain linear programming problem. The linear constraints are given by:

$A$ company manufactures two types of novelty souvenirs made of plywood. Souvenirs of type $A$ require $5 \text{ minutes}$ each for cutting and $10 \text{ minutes}$ each for assembling. Souvenirs of type $B$ require $8 \text{ minutes}$ each for cutting and $8 \text{ minutes}$ each for assembling. There are $3 \text{ hours } 20 \text{ minutes}$ available for cutting and $4 \text{ hours}$ for assembling. The profit is $Rs. 5$ each for type $A$ and $Rs. 6$ each for type $B$ souvenirs. How many souvenirs of each type should the company manufacture in order to maximise the profit?

For the following shaded area,the linear constraints except $x, y \geq 0$ are

$A$ firm has to transport $1200$ packages using large vans which can carry $200$ packages each and small vans which can take $80$ packages each. The cost for engaging each large van is $Rs. 400$ and each small van is $Rs. 200$. Not more than $Rs. 3000$ is to be spent on the job and the number of large vans cannot exceed the number of small vans. Formulate this problem as an $LPP$ given that the objective is to minimize cost.

The objective function $z = 4x + 5y$ subject to the constraints $2x + y \geq 7$,$2x + 3y \leq 15$,$y \leq 3$,$x \geq 0$,and $y \geq 0$ has a minimum value at which point?

The optimal solution of the $L$.$P$.$P$. Maximize $Z = 8x + 3y$ subject to the constraints $x + y \leq 3, 4x + y \leq 6, x \geq 0, y \geq 0$ is