# Transportation Problem | Set 5 ( Unbalanced )

An introduction to the transportation problem has been discussed in this article. In this article, the method to solve the unbalanced transportation problem will be discussed.

Below transportation problem is an unbalanced transportation problem.

The problem is unbalanced because the sum of all the supplies i.e. **O1**, **O2**, **O3** and **O4** is not equal to the sum of all the demands i.e. **D1**, **D2**, **D3**, **D4** and **D5**.

**Solution:**

In this type of problem, the concept of a dummy row or a dummy column will be used. As in this case, since the supply is more than the demand so a dummy demand column will be added and a demand of (total supply – total demand) will be given to that column i.e. **117 – 95 = 22** as shown in the image below. If demand were more than the supply then a dummy supply row would have been added.

Now that the problem has been updated to a balanced transportation problem, it can be solved using any one of the following methods to solve a balanced transportation problem as discussed in the earlier posts:

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.

## Recommended Posts:

- Transportation Problem | Set 7 ( Degeneracy in Transportation Problem )
- Transportation Problem | Set 1 (Introduction)
- Transportation Problem Set 8 | Transshipment Model-1
- Transportation Problem | Set 2 (NorthWest Corner Method)
- Transportation Problem | Set 4 (Vogel's Approximation Method)
- Transportation Problem | Set 3 (Least Cost Cell Method)
- Transportation Problem | Set 6 (MODI Method - UV Method)
- Secretary Problem (A Optimal Stopping Problem)
- 21 Matchsticks Problem
- Fibonacci problem (Value of Fib(N)*Fib(N) - Fib(N-1) * Fib(N+1))
- Tiling Problem
- Perfect Sum Problem
- Cake Distribution Problem
- Josephus Problem Using Bit Magic
- Frobenius coin problem
- The Lazy Caterer's Problem
- Josephus problem | Set 1 (A O(n) Solution)
- The Knight's tour problem | Backtracking-1
- 0/1 Knapsack Problem to print all possible solutions
- Number of stopping station 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.