The North-West Corner method has been discussed in the previous article. In this article, the Least Cost Cell method will be discussed.
Solution: According to the Least Cost Cell method, the least cost among all the cells in the table has to be found which is 1 (i.e. cell (O1, D2)).
Now check the supply from the row O1 and demand for column D2 and allocate the smaller value to the cell. The smaller value is 300 so allocate this to the cell. The supply from O1 is completed so cancel this row and the remaining demand for the column D2 is 350 – 300 = 50.
Now find the cell with the least cost among the remaining cells. There are two cells with the least cost i.e. (O2, D1) and (O3, D4) with cost 2. Lets select (O2, D1). Now find the demand and supply for the respective cell and allocate the minimum among them to the cell and cancel the row or column whose supply or demand becomes 0 after allocation.
Now the cell with the least cost is (O3, D4) with cost 2. Allocate this cell with 200 as the demand is smaller than the supply. So the column gets canceled.
There are two cells among the unallocated cells that have the least cost. Choose any at random say (O3, D2). Allocate this cell with a minimum among the supply from the respective row and the demand of the respective column. Cancel the row or column with zero value.
Now the cell with the least cost is (O3, D3). Allocate the minimum of supply and demand and cancel the row or column with zero value.
The only remaining cell is (O2, D3) with cost 5 and its supply is 150 and demand is 150 i.e. demand and supply both are equal. Allocate it to this cell.
Now just multiply the cost of the cell with their respective allocated values and add all of them to get the basic solution i.e. (300 * 1) + (25 * 2) + (150 * 5) + (50 * 3) + (250 * 3) + (200 * 2) = 2400
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.
- Transportation Problem | Set 7 ( Degeneracy in Transportation Problem )
- Transportation Problem | Set 4 (Vogel's Approximation Method)
- Transportation Problem | Set 2 (NorthWest Corner Method)
- Transportation Problem | Set 6 (MODI Method - UV Method)
- Transportation Problem | Set 1 (Introduction)
- Transportation Problem | Set 5 ( Unbalanced )
- Transportation Problem Set 8 | Transshipment Model-1
- Sum of cost of all paths to reach a given cell in a Matrix
- Minimum moves taken to move coin of each cell to any one cell of Matrix
- Secretary Problem (A Optimal Stopping Problem)
- Final cell position in the matrix
- Final direction after visiting every cell of Matrix starting from (0, 0)
- Min Cost Path | DP-6
- Cost of painting n * m grid
- Minimize the cost of buying the Objects
- Minimize the cost to split a number
- Minimum cost to merge numbers from 1 to N
- Minimum cost to partition the given binary string
- Minimize cost to convert given two integers to zero using given operations
- Minimize the cost of partitioning an array into K groups
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. 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.