Mathematically a transportation problem is nothing but a special linear programming problem in which the objective function is to minimize the cost of transportation subjected to the demand and supply constraints.
Let there be ‘m’ sources of supply having ‘ai ‘ units of supplies respectively to be transported among ‘n’ destinations with ‘bj ‘ units of requirements respectively. Let Cij be the cost of shipping one unit of the commodity from source i to destination j for each route. Let x be the units shipped per route. Then the LPP is stated below.
