Unbalanced Transportation Problem Numerical
Watch videoComments
What is Unbalanced Transportation Problem?
A Transportation Problem where the summation of Supply is not equal to summation of Demand is called Unbalanced Transportation Problem.
Balance the following problem for BFS using Least Cost Method:
Here, BFS means Basic Feasible Solution. This is also sometimes referenced as IBFS, meaning Initial Basic Feasible Solution.
This problem can also be solved using Vogel's Approximation Method, North West Corner Method or Least Cost Method. But as mentioned in the problem statement we'll be solving it using Least Cost Method.
Solution:
Step 1: Balance the Problem
In the given problem:
The given problem is not balanced as .
To balance this, a dummy row is added with supply of 30 units in order to balance the problem.
Step 2: Select the lowest cost and allocate
In this step, we'll start by selecting the lowest cost from the entire matrix and allocate the minimum value from Supply or Demand to it.
Note: When selecting the lowest cost we should NOT consider the dummy row that we added to balance the problem.
Step 3: Remove the fulfilled row or column and prepare a new matrix
Now we shall remove the row or column for which the demand or supply has been fulfilled and prepare a new matrix.
Now prepare a new matrix:
Step 4: Repeat the procedure until all the allocations are done
- Column B fulfilled
- Remove column B
- Prepare new matrix
- Repeat allocation where Row 'R' is fulfilled
- Remove row R
- Prepare new matrix
- Repeat allocation where Column 'C' is fulfilled
- Remove column C
- Prepare new matrix
- Repeat allocation where Row 'Q' is fulfilled
- By this step, we have completed all the allocations in the matrix given in the problem statement.
Step 5: Calculate the transportation cost
Now that we have completed all the allocations as done above, we'll use all the allocations and calculate the transportation cost.
- Transportation Cost:
In the problem above we have seen that , so we added a Dummy row 'D1' to balance the problem. Likewise, if then, we should add a Dummy column and then solve the problem.
Later the problem can be solved by any of the following methods:
Suggested Notes:
Modified Distribution Method (MODI) | Transportation Problem | Transportation Model
Stepping Stone | Transportation Problem | Transportation Model
Vogel’s Approximation Method (VAM) | Method to Solve Transportation Problem | Transportation Model
Transportation Model - Introduction
North West Corner Method | Method to Solve Transportation Problem | Transportation Model
Least Cost Method | Method to Solve Transportation Problem | Transportation Model
Tie in selecting row and column (Vogel's Approximation Method - VAM) | Numerical | Solving Transportation Problem | Transportation Model
Assignment Model | Linear Programming Problem (LPP) | Introduction
![Critical Path Method [CPM] - Steps and Introduction | Network Analysis | Operation Research](https://ik.imagekit.io/educationlessons/notes/operation-research/Critical_path_method_steps_and_introduction/Critical_path_method_-_steps_and_introduction_thumb.png)
Critical Path Method [CPM] - Steps and Introduction | Network Analysis | Operation Research
Crashing Special Case - Multiple (Parallel) Critical Paths
Crashing Special Case - Indirect cost less than Crash Cost
Basics of Program Evaluation and Review Technique (PERT)
Numerical on PERT (Program Evaluation and Review Technique)
Network Analysis - Dealing with Network Construction Basics
Construct a project network with predecessor relationship | Operation Research | Numerical
Graphical Method | Methods to solve LPP | Linear Programming
Basics of Linear Programming
Linear Programming Problem (LPP) Formulation with Numericals
Suggested Notes:
Modified Distribution Method (MODI) | Transportation Problem | Transportation Model
Stepping Stone | Transportation Problem | Transportation Model
Vogel’s Approximation Method (VAM) | Method to Solve Transportation Problem | Transportation Model
Transportation Model - Introduction
North West Corner Method | Method to Solve Transportation Problem | Transportation Model
Least Cost Method | Method to Solve Transportation Problem | Transportation Model
Tie in selecting row and column (Vogel's Approximation Method - VAM) | Numerical | Solving Transportation Problem | Transportation Model
Assignment Model | Linear Programming Problem (LPP) | Introduction
Critical Path Method [CPM] - Steps and Introduction | Network Analysis | Operation Research
Crashing Special Case - Multiple (Parallel) Critical Paths
Crashing Special Case - Indirect cost less than Crash Cost
Basics of Program Evaluation and Review Technique (PERT)
Numerical on PERT (Program Evaluation and Review Technique)
Network Analysis - Dealing with Network Construction Basics
Construct a project network with predecessor relationship | Operation Research | Numerical
Graphical Method | Methods to solve LPP | Linear Programming
Basics of Linear Programming
Linear Programming Problem (LPP) Formulation with Numericals
Comments:
All comments that you add will await moderation. We'll publish all comments that are topic related, and adhere to our Code of Conduct.
Want to tell us something privately? Contact Us
Post comment