| Cost(in ₹) | |||
| TO/From | A | B | C |
| P | 160 | 100 | 150 |
| Q | 100 | 120 | 100 |
(i) Formulate the objective function and the constraints of the above Linear programming problem.
(ii) How many units should be transported from each factory to each depot in order that the transportation cost is minimum?
so that it supplies 8−x−y units to depot C. Obviously $0 \leq x \leq 5,0 \leq y \leq 5,0 \leq 8-x-y \leq 4$.The given data can be represented diagrammatically as:

Thus, total transportation cost (in ₹)
$=160 x+100 y+150(8-x-y)+100(5-x)+120(5-y)+100(x+y-4)=10(x-7 y+190)$.
Hence the given problem can be formulated as an L.P.P as:
Minimize $Z=10(x-7 y+190)$
subject to the constraints
$\begin{array}{l}x+y \geq 4, \\ x+y \leq 8, \\ x \leq 5 \\ y \leq 5 \\ x \geq 0, y \geq 0\end{array}$
(ii) The feasible region corresponding to these in equations is shown shaded in the figure given below.

| Corner Points | Value of $Z=10(x-7 y+190)$ |
| A (4,0) | 1940 |
| B (5,0) | 1950 |
| C (5,3) | 1740 |
| D (3,5) | 1580 |
| E (0,5) | $1550 \rightarrow$ Minimum |
| F (0,3) | 1690 |