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 vertices of the feasible region for the constraints $x+y \leq 4$,$x \leq 2$,$y \leq 1$,$x+y \geq 1$,$x, y \geq 0$ are

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

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:

Maximum value of $Z=100 x+70 y$ subject to $2 x \geq 4, y \leq 3, x+y \leq 8, x, y \geq 0$ is