Find Solution using Row minima method
| D1 | D2 | D3 | D4 | Supply |
| S1 | 11 | 13 | 17 | 14 | 250 |
| S2 | 16 | 18 | 14 | 10 | 300 |
| S3 | 21 | 24 | 13 | 10 | 400 |
| Demand | 200 | 225 | 275 | 250 | |
Solution:
TOTAL number of supply constraints : 3
TOTAL number of demand constraints : 4
Problem Table is
| | `D_1` | `D_2` | `D_3` | `D_4` | | Supply |
| `S_1` | 11 | 13 | 17 | 14 | | 250 |
| `S_2` | 16 | 18 | 14 | 10 | | 300 |
| `S_3` | 21 | 24 | 13 | 10 | | 400 |
| |
| Demand | 200 | 225 | 275 | 250 | | |
In `1^(st)` row, The smallest transportation cost is 11 in cell `S_1 D_1`.
The allocation to this cell is min(250,200) = 200.
This satisfies the entire demand of `D_1` and leaves 250 - 200 = 50 units with `S_1`
Table-1
| | `D_1` | `D_2` | `D_3` | `D_4` | | Supply |
| `S_1` | 11(200) | 13 | 17 | 14 | | 50 |
| `S_2` | 16 | 18 | 14 | 10 | | 300 |
| `S_3` | 21 | 24 | 13 | 10 | | 400 |
| |
| Demand | 0 | 225 | 275 | 250 | | |
In `1^(st)` row, The smallest transportation cost is 13 in cell `S_1 D_2`.
The allocation to this cell is min(50,225) = 50.
This exhausts the capacity of `S_1` and leaves 225 - 50 = 175 units with `D_2`
Table-2
| | `D_1` | `D_2` | `D_3` | `D_4` | | Supply |
| `S_1` | 11(200) | 13(50) | 17 | 14 | | 0 |
| `S_2` | 16 | 18 | 14 | 10 | | 300 |
| `S_3` | 21 | 24 | 13 | 10 | | 400 |
| |
| Demand | 0 | 175 | 275 | 250 | | |
In `2^(nd)` row, The smallest transportation cost is 10 in cell `S_2 D_4`.
The allocation to this cell is min(300,250) = 250.
This satisfies the entire demand of `D_4` and leaves 300 - 250 = 50 units with `S_2`
Table-3
| | `D_1` | `D_2` | `D_3` | `D_4` | | Supply |
| `S_1` | 11(200) | 13(50) | 17 | 14 | | 0 |
| `S_2` | 16 | 18 | 14 | 10(250) | | 50 |
| `S_3` | 21 | 24 | 13 | 10 | | 400 |
| |
| Demand | 0 | 175 | 275 | 0 | | |
In `2^(nd)` row, The smallest transportation cost is 14 in cell `S_2 D_3`.
The allocation to this cell is min(50,275) = 50.
This exhausts the capacity of `S_2` and leaves 275 - 50 = 225 units with `D_3`
Table-4
| | `D_1` | `D_2` | `D_3` | `D_4` | | Supply |
| `S_1` | 11(200) | 13(50) | 17 | 14 | | 0 |
| `S_2` | 16 | 18 | 14(50) | 10(250) | | 0 |
| `S_3` | 21 | 24 | 13 | 10 | | 400 |
| |
| Demand | 0 | 175 | 225 | 0 | | |
In `3^(rd)` row, The smallest transportation cost is 13 in cell `S_3 D_3`.
The allocation to this cell is min(400,225) = 225.
This satisfies the entire demand of `D_3` and leaves 400 - 225 = 175 units with `S_3`
Table-5
| | `D_1` | `D_2` | `D_3` | `D_4` | | Supply |
| `S_1` | 11(200) | 13(50) | 17 | 14 | | 0 |
| `S_2` | 16 | 18 | 14(50) | 10(250) | | 0 |
| `S_3` | 21 | 24 | 13(225) | 10 | | 175 |
| |
| Demand | 0 | 175 | 0 | 0 | | |
In `3^(rd)` row, The smallest transportation cost is 24 in cell `S_3 D_2`.
The allocation to this cell is min(175,175) = 175.
Table-6
| | `D_1` | `D_2` | `D_3` | `D_4` | | Supply |
| `S_1` | 11(200) | 13(50) | 17 | 14 | | 0 |
| `S_2` | 16 | 18 | 14(50) | 10(250) | | 0 |
| `S_3` | 21 | 24(175) | 13(225) | 10 | | 0 |
| |
| Demand | 0 | 0 | 0 | 0 | | |
Initial feasible solution is
| | `D_1` | `D_2` | `D_3` | `D_4` | | Supply |
| `S_1` | 11 (200) | 13 (50) | 17 | 14 | | 250 |
| `S_2` | 16 | 18 | 14 (50) | 10 (250) | | 300 |
| `S_3` | 21 | 24 (175) | 13 (225) | 10 | | 400 |
| |
| Demand | 200 | 225 | 275 | 250 | | |
The minimum total transportation cost `= 11 xx 200 + 13 xx 50 + 14 xx 50 + 10 xx 250 + 24 xx 175 + 13 xx 225 = 13175`
Here, the number of allocated cells = 6 is equal to m + n - 1 = 3 + 4 - 1 = 6
`:.` This solution is non-degenerate
This material is intended as a summary. Use your textbook for detail explanation.
Any bug, improvement, feedback then
