Tranportation Model Vs Assignment Model

Transportation Model	Assignment Model
The transportation problem contains specific demand and supply in columns and rows.	In assignment problem the demand and supply in each column and row is one.
The cost matrix is not necessarily a square matrix.	The cost matrix is a square matrix.
We use three methods to solve transportation problem: VAM, NWCR and LCM.	We use two methods to solve assignment problem: Completer Enumeration method and Hungarian method.
The problem is unbalanced if total supply is not equal to total demand.	The problem is unbalanced if the cost matrix is not a square matrix i.e., number of rows is not equal to number of columns.
There is no restriction in the number of allocations.	Only one allocation can be made in particular row and column.