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:

The minimum value of $t = 7x + 3y$ subject to constraints $x + y < 5$,$x + y < 10$,$x > 0$,$y > 0$ is . . . . . .

If $Z = 7x + y$ subject to $5x + y \geq 5$,$x + y \geq 3$,$x \geq 0$,$y \geq 0$,then the minimum value of $Z$ is

There are two factories located at place $P$ and place $Q$. From these locations,a certain commodity is to be delivered to each of the three depots situated at $A, B$ and $C$. The weekly requirements of the depots are $5, 5$ and $4$ units respectively,while the production capacities of the factories at $P$ and $Q$ are $8$ and $6$ units respectively. The cost of transportation per unit is given below:

From/To	$A$	$B$	$C$
$P$	$160$	$100$	$150$
$Q$	$100$	$120$	$100$

How many units should be transported from each factory to each depot in order that the transportation cost is minimum? What will be the minimum transportation cost?

$A$ manufacturer produces two models of bikes: Model $X$ and Model $Y$. Model $X$ takes $6$ man-hours to make per unit,while Model $Y$ takes $10$ man-hours per unit. There is a total of $450$ man-hours available per week. Handling and marketing costs are $Rs. 2000$ and $Rs. 1000$ per unit for Models $X$ and $Y$ respectively. The total funds available for these purposes are $Rs. 80,000$ per week. Profits per unit for Models $X$ and $Y$ are $Rs. 1000$ and $Rs. 500$ respectively. How many bikes of each model should the manufacturer produce so as to yield a maximum profit? Find the maximum profit.

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