What is a transportation problem ? How is
it useful in business and industry ? Explain the differences and similarities between MODI method and stepping stone method used for solving transportation problem
A transportation problem in the field of Operations Research (OR) is a special type of linear programming problem that deals with the efficient allocation of goods from several sources (e.g., warehouses) to several destinations (e.g., retailers) while minimizing the transportation cost. The objective is to find the least-cost plan to transport a commodity from its sources to its destinations, satisfying supply and demand constraints.
In business and industry, the transportation problem is highly relevant and valuable. It has various applications such as supply chain management, distribution logistics, manufacturing, and inventory management. By optimizing the transportation of goods, companies can reduce transportation costs, improve efficiency, enhance customer service, and ultimately increase profitability.
Now, let's discuss two popular methods used for solving transportation problems: the MODI (Modified Distribution) method and the stepping stone method.
### MODI Method:
The MODI method is an iterative technique for finding an optimal solution to a transportation problem. It is an improvement over the Northwest Corner Method and the Least Cost Method. The steps involved in the MODI method are as follows:
1. Initialization: Start with an initial feasible solution.
2. Calculate U and V values: Use the 'U' and 'V' values to find the opportunity cost of each cell.
3. Identify the Cell with Maximum Opportunity Cost (MODI): Select the cell with the highest opportunity cost (greatest improvement
________ _____ _________ ________ ______ __________ _______.
____ ___ _______ _______ _______ _____ ________ _______ _________ ________ ___.
_______ ___ __________ ____ _______ _________.
____ ___ _____ ________ _________ ______ ____ _______ ____.
________ ___ ____ _____ _________.
___ ________ ________ ___ ____ ____ ___ ________ _________.
______ _________ __________ _________ ______ ________.
_______ __________ _______ ____ ___ ___ ____ _____ ___ _____.
__________ ________ ___ ____ ____.
__________ ________ ________ _______ ________ __________.
_____ ______ _________ _________ ___ ____ ____.
__________ ________ _______ _______ _______ ___.
_________ _______ _______ ________ _____ __________ ______ ________ __________ __________ __________.
___ ______ _______ _________ ___ __________ _____ _________.
____ _____ ___ _____ _____ ______ _____ ___ ________ ______ ________ ____.
______ ________ ________ ________ _______ ________ __________ _______ ______ ________ __________ ____.
_________ ___ _______ _________ _________ ______ ____ ______.
_______ _________ _____ ________ _____ _______ __________ ____.
_________ __________ ____ _____ ___ ___ _________ ____ ________.
______ __________ ___ _____ _________.
_______ ___ ____ ______ _____ ________ ______ ________ ________ ________.
________ ___ ___ _____ ______ ___ ________ __________ ____ ______.
___ _____ _____ _________ _________ ________ _______.
_____ _________ ___ ________ ____ ____ ____ ______ ________ _______ __________.
___ __________ _____ ______ ________.
___ _______ _______ _____ ____ ___ ___ ______ ______ _______.
______ ____ _______ ________ __________.
___ _____ _____ __________ ________ ___ __________ __________.
________ __________ ________ ______ _______ ______.
___ _____ ___ ______ __________ __________ ______ ___ ________.
___ _________ __________ ________ ___.
____ __________ ______ _________ ______ ____ _______ ____ _________ ______.
_____ _________ ___ _____ ____ _________ ______ _____ ________ ____ _____ ________.
__________ ________ ____ ________ _____ ______ ________ _____ __________ ________.
_______ _________ ________ ___ _________ ________ __________ _____ _________ _______.
____ ____ ________ _____ ___ ________ __________ _________ ___ _____ _____ ___.
______ _________ ______ ____ _______ ______ _______ _______ ____ _________ ______.
______ ___ _______ ___ ______ ______.
__________ _________ _____ ____ ______ ____ _____.
_________ _____ ___ _____ _____ _____ ______ ___ ______.
____ __________ ____ __________ _______ ___ _______ ___ _____ __________ ________.
_______ __________ _________ _______ _____ ______ ________ _______.
- Solved Assignments
- Study Notes
- Guess Papers
- Question Papers
✓ Unlock up to 60% of the answer
✓ No payment required
Dynamic programming
Dual of an LPP
Write the generalized from of linear programming problem with matrix notation.
Goal programming
Periodic Review System