Click here to know about Methods to solve Transportation Model Problem provided below here in notes ↓
Transportation Model is a special case of LPP(Linear Programming Problem) in which the main objective is to transport a product from various sources to various destinations at total minimum cost.
In Transportation Models, the sources and destinations are known, the supply and demand at each source and destinations are also known.
It is designed to find the best arrangement for transportation such that the transportation cost is minimum.
Consider three companies (Company1, Company2 and Company3) which produce mobile phones and are located in different regions.
Similarly, consider three cities (namely CityA, CityB & CityC) where the mobile phones are transported.
The companies where mobile phones are available are known as sources and the cities where mobile phones are transported are called destinations.
Let,
Company1 produces a_{1} units,
Company2 produces a_{2} units,
Company3 produces a_{3} units.
Let,
demand in CityA is b_{1} units,
demand in CityB is b_{2} units,
demand in CityC is b_{3} units.
The cost of transportation from each source to destination is given in table
i) Balanced transportation problem: The sum of supply and sum of demand are same.
$\Sigma \text { Supply} = \Sigma \text { Demand}$ii) Unbalanced transportation problem: The sum of supply and sum of demand are different.
$\Sigma \text { Supply} \ne \Sigma \text { Demand}$