# Transportation Problem | Set 1 (Introduction)

**Transportation problem** is a special kind of **Linear Programming Problem (LPP)** in which goods are transported from a set of sources to a set of destinations subject to the supply and demand of the sources and destination respectively such that the total cost of transportation is minimized. It is also sometimes called as Hitchcock problem.

**Types of Transportation problems:****Balanced:** When both supplies and demands are equal then the problem is said to be a balanced transportation problem.

**Unbalanced:** When the supply and demand are not equal then it is said to be an unbalanced transportation problem. In this type of problem, either a dummy row or a dummy column is added according to the requirement to make it a balanced problem. Then it can be solved similar to the balanced problem.

**Methods to Solve:**

To find the initial basic feasible solution there are three methods:

- NorthWest Corner Cell Method.
- Least Call Cell Method.
- Vogel’s Approximation Method (VAM).

**Basic structure of transportation problem:**

In the above table **D1**, **D2**, **D3** and **D4** are the destinations where the products/goods are to be delivered from different sources **S1**, **S2**, **S3** and **S4**. **S _{i}** is the supply from the source

**O**.

_{i}**d**is the demand of the destination

_{j}**D**.

_{j}**C**is the cost when the product is delivered from source

_{ij}**S**to destination

_{i}**D**.

_{j}Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the **DSA Self Paced Course** at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer **Complete Interview Preparation Course****.**

In case you wish to attend **live classes **with experts, please refer **DSA Live Classes for Working Professionals **and **Competitive Programming Live for Students**.