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

The maximum value of the objective function $z=4x+6y$ subject to the constraints $3x+2y \leq 12$,$x+y \geq 4$,$x, y \geq 0$ is

Two godowns $A$ and $B$ have grain capacity of $100$ quintals and $50$ quintals respectively. They supply to $3$ ration shops,$D$,$E$ and $F$ whose requirements are $60, 50$ and $40$ quintals respectively. The cost of transportation per quintal from the godowns to the shops are given in the following table:

Transportation cost per quintal (in $Rs$)
From/To $A$ $B$
$D$ $6$ $4$
$E$ $3$ $2$
$F$ $2.50$ $3$

How should the supplies be transported in order that the transportation cost is minimum? What is the minimum cost?

The feasible region of the $L$.$P$.$P$. (Linear Programming Problem) to maximize $z = 70x + 50y$ subject to the constraints $8x + 5y \leq 60$,$4x + 5y \leq 40$ and $x \geq 0, y \geq 0$ is:

Find the point at which the objective function $Z = x + y$ attains its maximum value subject to the constraints $x + 2y \leq 70$, $2x + y \leq 95$, $x \geq 0$, and $y \geq 0$.

The maximum value of $z=9x+11y$ subject to $3x+2y \leq 12$,$2x+3y \leq 12$,$x \geq 0$,$y \geq 0$ is . . . . . . .