The production of item $A$ is $x$ and the production of item $B$ is $y$. If the corner points of the bounded feasible region are $(1,0), (2,0), (0,2)$ and $(0,1)$,then the maximum profit $z = 2000x + 5000y$ is $\ldots \ldots$

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:

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

The maximum value of $z=7x+8y$ subject to the constraints $x+y \leq 20, y \geq 5, x \leq 10, x \geq 0, y \geq 0$ is

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

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