For the linear programming problem, $x + 2y \leq 10$, $3x + y \leq 12$, $x, y \geq 0$, the maximum value of $z = 5x + 10y$ occurs at every point on the line segment joining the points..

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?

For the $LPP$,minimize $z = x_{1} + x_{2}$ subject to the constraints $5x_{1} + 10x_{2} \geq 0$,$x_{1} + x_{2} \leq 1$,$x_{2} \leq 4$ and $x_{1}, x_{2} \geq 0$.

The point,at which the maximum value of $10x + 6y$ subject to the constraints $x + y \leq 12$,$2x + y \leq 20$,$x \geq 0$,$y \geq 0$ occurs,is

$A$ manufacturing company makes two models $A$ and $B$ of a product. Each piece of Model $A$ requires $9$ labour hours for fabricating and $1$ labour hour for finishing. Each piece of Model $B$ requires $12$ labour hours for fabricating and $3$ labour hours for finishing. For fabricating and finishing,the maximum labour hours available are $180$ and $30$ respectively. The company makes a profit of Rs $8000$ on each piece of model $A$ and Rs $12000$ on each piece of Model $B$. How many pieces of Model $A$ and Model $B$ should be manufactured per week to realise a maximum profit? What is the maximum profit per week?

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