The objective function $z=x_1+x_2$,subject to $x_1+x_2 \leq 10, -2x_1+3x_2 \leq 15, x_1 \leq 6, x_1, x_2 \geq 0$,has a maximum value at:

$A$ toy company manufactures two types of dolls,$A$ and $B$. Market research and available resources have indicated that the combined production level should not exceed $1200$ dolls per week and the demand for dolls of type $B$ is at most half of that for dolls of type $A$. Further,the production level of dolls of type $A$ can exceed three times the production of dolls of type $B$ by at most $600$ units. If the company makes a profit of $Rs. 12$ and $Rs. 16$ per doll respectively on dolls $A$ and $B$,how many of each should be produced weekly in order to maximize the profit?

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

For the $LPP$,maximize $z=x+4y$ subject to the constraints $x+2y \leq 2$,$x+2y \geq 8$,$x, y \geq 0$.

The function to be maximized is given by $Z=2x+y$. The feasible region for this function $Z$ is the shaded region shown in the figure. The maximum value of $Z$ is . . . . . . and occurs at the point . . . . . . .

$A$ dietician wishes to mix two types of foods in such a way that vitamin contents of the mixture contain at least $8$ $units$ of vitamin $A$ and $10$ $units$ of vitamin $C$. Food $'I'$ contains $2$ $units/kg$ of vitamin $A$ and $1$ $unit/kg$ of vitamin $C$. Food $'II'$ contains $1$ $unit/kg$ of vitamin $A$ and $2$ $units/kg$ of vitamin $C$. It costs Rs $50$ per $kg$ to purchase Food $'I'$ and Rs $70$ per $kg$ to purchase Food $'II'$. Formulate this problem as a linear programming problem to minimise the cost of such a mixture.