An introduction to Transportation problem has been discussed in the previous article, in this article, finding the initial basic feasible solution using the NorthWest Corner Cell Method will be discussed.

**Explanation:** Given three sources **O1**, **O2** and **O3** and four destinations **D1**, **D2**, **D3** and **D4**. For the sources **O1**, **O2** and **O3**, the supply is **300**, **400** and **500** respectively. The destinations **D1**, **D2**, **D3** and **D4** have demands **250**, **350**, **400** and **200** respectively.

**Solution:** According to North West Corner method, **(O1, D1)** has to be the starting point i.e. the north-west corner of the table. Each and every value in the cell is considered as the cost per transportation. Compare the demand for column **D1** and supply from the source **O1** and allocate the minimum of two to the cell **(O1, D1)** as shown in the figure.

The demand for Column **D1** is completed so the entire column **D1** will be canceled. The supply from the source **O1** remains **300 – 250 = 50**.

Now from the remaining table i.e. excluding column **D1**, check the north-west corner i.e. **(O1, D2)** and allocate the minimum among the supply for the respective column and the rows. The supply from **O1** is **50** which is less than the demand for **D2** (i.e. 350), so allocate **50** to the cell **(O1, D2)**. Since the supply from row **O1** is completed cancel the row **O1**. The demand for column **D2** remain **350 – 50 = 50**.

From the remaining table the north-west corner cell is **(O2, D2)**. The minimum among the supply from source **O2** (i.e 400) and demand for column **D2** (i.e 300) is **300**, so allocate **300** to the cell **(O2, D2)**. The demand for the column **D2** is completed so cancel the column and the remaining supply from source **O2** is **400 – 300 = 100**.

Now from remainig table find the north-west corner i.e. **(O2, D3)** and compare the **O2** supply (i.e. 100) and the demand for **D2** (i.e. 400) and allocate the smaller (i.e. 100) to the cell **(O2, D2)**. The supply from **O2** is completed so cancel the row **O2**. The remaining demand for column **D3** remains **400 – 100 = 300**.

Proceeding in the same way, the final values of the cells will be:

**Note:** In the last remaining cell the demand for the respective columns and rows are equal which was cell **(O3, D4)**. In this case, the supply from **O3** and the demand for **D4** was **200** which was allocated to this cell. At last, nothing remained for any row or column.

Now just multiply the allocated value with the respective cell value (i.e. the cost) and add all of them to get the basic solution i.e. **(250 * 3) + (50 * 1) + (300 * 6) + (100 * 5) + (300 * 3) + (200 * 2) = 4400**

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.

## Recommended Posts:

- Transportation Problem | Set 7 ( Degeneracy in Transportation Problem )
- Transportation Problem | Set 6 (MODI Method - UV Method)
- Transportation Problem | Set 3 (Least Cost Cell Method)
- Transportation Problem | Set 4 (Vogel's Approximation Method)
- Transportation Problem | Set 1 (Introduction)
- Transportation Problem | Set 5 ( Unbalanced )
- Transportation Problem Set 8 | Transshipment Model-1
- Form a number using corner digits of powers
- Maximize sum of K elements in Array by taking only corner elements
- Check if an Array can be Sorted by picking only the corner Array elements
- Secretary Problem (A Optimal Stopping Problem)
- Josephus problem | Set 1 (A O(n) Solution)
- Hungarian Algorithm for Assignment Problem | Set 1 (Introduction)
- Hitting Set problem is NP Complete
- The Knight's tour problem | Backtracking-1
- Tiling Problem
- Frobenius coin problem
- The Lazy Caterer's Problem
- Josephus Problem Using Bit Magic
- Maths behind number of paths in matrix problem

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.