Determine the optimal transportation plan from the following table giving the plant to market shipping costs, and quantities required at each market and available at each plant: | | W1 | W2 | W3 | W4 | Availability | |---|---|---|---|---|---| | F1 | 11 | 20 | 7 | 8 | 50 | | F2 | 21 | 16 | 10 | 12 | 40 | | F3 | 8 | 12 | 18 | 9 | 70 | | Requirement | 30 | 25 | 35 | 40 | |
Akshit Bhardwaj, AIR 12, 2025
Total availability = 160
Total Requirement = 130
Thus problem is unbalanced, so we add another market $W_5$ with Requirement 30 & zero transport costs
| | W1 | W2 | W3 | W4 | W5 | | |---|---|---|---|---|---|---| | F1 | 11 | 20 | 7 | 8 | 0 | | | F2 | 21 | 16 | 10 | 12 | 0 | | | F3 | 8 | 12 | 18 | 9 | 0 | | | | 30 | 25 | 35 | 40 | 30 | |
Now, finding initial basic feasible solution using Vogel's method
| | W1 | W2 | W3 | W4 | W5 | Supply (penalty) | |---|---|---|---|---|---|---| | F1 | 11 X | 20 | 7 | 8 | 0 X | 50 (1) | | F2 | 21 X | 16 | 10 | 12 | 0 [30] | 40 (2) | | F3 | 3 [30] | 12 | 18 | 9 | 0 X | 70 (3) | | Demand (penalty) | 30 (8) | 25 (4) | 35 (3) | 40 (1) | 30 | |
$\Rightarrow$
| | W2 | W3 | W4 | Supply (penalty) | |---|---|---|---|---| | F1 | 20 X | 7 | 8 | 50 (1) | | F2 | 16 X | 10 | 12 | 10 (2) | | F3 | 12 [25] | 18 X | 9 [15] | 40 (9) | | Demand (penalty) | 25 (4) | 35 (3) | 40 (1) | |
$\Rightarrow$
| | W3 | W4 | Supply (penalty) | |---|---|---|---| | F1 | 7 [25] | 8 [25] | 50 (1) | | F2 | 10 [10] | 12 X | 10 (2) | | Demand (penalty) | 35 (3) | 25 (4) | |
Thus initial solution is
| | W1 | W2 | W3 | W4 | W5 | | |---|---|---|---|---|---|---| | F1 | 11 (-9) | 20 (-9) | 7 [25] (0) | 8 [25] (0) | 0 (-3) | 50, $V_1 = -1$ | | F2 | 21 (-16) | 16 (-2) | 10 [10] (0) | 12 (-1) | 0 [30] | 40, $V_2 = 2$ | | F3 | 3 [30] | 12 [25] | 18 (-10) | 9 [15] | 0 (-2) | 70, $V_3 = 0$ | | | 30, $U_1 = 3$ | 25, $U_2 = 12$ | 35, $U_3 = 8$ | 40, $U_4 = 9$ | 30, $U_5 = -2$ | |
Now computing $\Delta_{ij} = U_i + V_j - C_{ij}$
& solving $\Delta_{ij} = 0$ for [?] initial squares
Then
$U_3 + V_1 = 7$ $\Rightarrow$ $V_1 = -1$, $V_2 = 2$, $V_3 = 0$
$U_4 + V_1 = 8$
$U_3 + V_2 = 10$, $U_5 + V_2 = 0$, $U_1 = 3$, $U_2 = 12$
$U_4 + V_3 = 9$, $U_3 = 8$, $U_4 = 9$
$U_1 + V_3 = 3$
$U_2 + V_3 = 12$
Now calculating $\Delta_{ij}$ ( in Brackets ( ) in table above )
Since all $\Delta_{ij} \le 0$, this solution is optimal
Optimal cost = $7 \times 25 + 8 \times 25 + 100 + 0 + 90 + 12 \times 25 + 9 \times 15$
$= 15 \times 25 + 100 + 90 + 300 + 9 \times 15 = 1000$