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: | 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 | |
Divyank Gupta, AIR 21, 2024
Since Requirement $\neq$ Availability, so adding another column to balance it
| 11 | 20 | 7 | 8 | 0 | 50 (penalty 7) | |---|---|---|---|---|---| | 21 | 16 | 10 | 12 | 0 | 40 (penalty 10) | | 8 | 12 | 18 | 9 | 0 | 70 (penalty 8) | | 30 | 25 | 35 | 40 | 30 | | | penalty 3 | penalty 4 | penalty 3 | penalty 1 | penalty 0 | |
Using Vogel Method to find the Optimal solution
Now, Highest penalty is in the 2nd Row, so making assignment there we get-
| 11 | 20 | 7 | 8 | 0 | 50 | |---|---|---|---|---|---| | 21 | 16 | 10 (10) | 12 | 0 (30) | 40 | | 8 | 12 | 18 | 9 | 0 | 70 | | 30 | 25 | 35 | 40 | 30 | |
$\Downarrow$
| 11 | 20 | 7 (25) | 8 | 50, penalty (1) | |---|---|---|---|---| | 8 | 12 | 18 | 9 | 70, penalty (1) | | 30 | 25 | 25 | 40 | | | penalty (3) | penalty (8) | penalty (11) | penalty (1) | |
| 11 | 20 | 8 | 25, penalty (3) | |---|---|---|---| | 8 | 12 (25) | 9 | 70, penalty (6) | | 30 | 25 | 40 | | | penalty (3) | penalty (8) | penalty (1) | |
| 11 | 8 (25) | 25, penalty (3) | |---|---|---| | 8 (30) | 9 (15) | 45, penalty (1) | | 30 | 40 | | | penalty (3) | penalty (1) | |
| 11 | 20 | 7 (25) | 8 (25) | 0 | |---|---|---|---|---| | 21 | 16 | 10 (10) | 12 | 0 (30) | | 8 (30) | 12 (25) | 18 | 9 (15) | 0 |
Here Assignment are 7[?] = n+m-1 i.e. 5+3-1, So non-degenerate solution
Now Calculating $|d_{ij}|$, $|d_{ij} = C_{ij} - (u_i+v_j)|$
let $u_3 = 0$, then $v_1 = 8$, $v_2 = 12$, $v_3 = 8$, $v_4 = 9$, $v_5 = -2$
and $u_1 = -1$, $u_2 = 2$
Now $d_{11} = C_{11} - (u_1+v_1) = 11 - (7) = 4$
Similarly $d_{12} = 9$, $d_{15} = 3$, $d_{21} = 11$, $d_{22} = 2$
$d_{24} = 1$, $d_{23} = 10$, $d_{35} = 2$
$|\text{All } d_{ij} > 0|$ So solution is optimal
Total Cost = $7\times25 + 8\times25 + 10\times10 + 0\times30 + 8\times30 + 12\times25 + 9\times15$
$|\text{Total cost} = 1150|$ Ans