The assignment problem is a special case of the transportation problem. The differences are given below.
Transportation Problem |
Assignment Problem |
1. This is about reducing cost of transportation merchandise |
1. This is about assigning finite sources to finite destinations where only one destination is allotted for one source with minimum cost |
2. Number of sources and number of demand need not be equal |
2. Number of sources and the number of destinations must be equal |
3. If total demand and total supply are not equal then the problem is said to be unbalanced. |
3. If the number of rows are not equal to the number of columns then problems are unbalanced. |
4. It requires 2 stages to solve Getting initial basic feasible solution, by NWC, LCM, VAM and optimal solution by MODI method |
4. It has only one stage. Hungarian method is sufficient for obtaining an optimal solution |