The optimal solution of the $L$.$P$.$P$. Maximize $Z = 8x + 3y$ subject to the constraints $x + y \leq 3, 4x + y \leq 6, x \geq 0, y \geq 0$ is

$A$ production unit makes a special type of metal chip by combining copper and brass. The standard weight of the chip must be at least $5 \text{ gms}$. The basic ingredients,i.e.,copper and brass,cost $₹8$ and $₹5$ per $\text{gm}$ respectively. Durability considerations dictate that the metal chip must not contain more than $4 \text{ gms}$ of brass and should contain a minimum of $2 \text{ gms}$ of copper. Then,the minimum cost of the metal chip satisfying the above conditions is:

Solve the following linear programming problem graphically:
Maximise $Z = 4x + y$......$(1)$
subject to the constraints:
${x + y \leqslant 50}$.......$(2)$
${3x + y \leqslant 90}$......$(3)$
${x \geqslant 0, y \geqslant 0}$......$(4)$

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 maximum value of $Z = 10x + 25y$ subject to $0 \leq x \leq 3$,$0 \leq y \leq 3$,and $x + y \leq 5$ occurs at the point:

The difference between the maximum value and minimum value of the objective function $z = 3x + 5y$ subject to the constraints $x + 3y \leqslant 60$,$x + y \geqslant 10$,$x - y = 0$,and $x, y \geqslant 0$ is: