The maximum value of $z = 9x + 13y$ subject to the constraints $2x + 3y \leq 18$,$2x + y \leq 10$,$x \geq 0$,$y \geq 0$ is:

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.

The shaded region in the following figure is the solution set of the inequations:

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?

Find the maximum value of $z = 2x + 6y$ subject to the constraints $-x + y \leq 1$,$2x + y \leq 2$,$x \geq 0$,and $y \geq 0$.

The Linear Programming Problem ($L$.$P$.$P$.) to minimize $z = 30x + 20y$ subject to the constraints $x + y \leqslant 8$,$x + 2y \geqslant 4$,$6x + 4y \geqslant 12$,$x \geqslant 0$,and $y \geqslant 0$ has: