Abstract
Transportation Problem is a linear programming problem. Like LPP, transportation problem has basic feasible solution (BFS) and then from it we obtain the optimal solution. Among these BFS the optimal solution is developed by constructing dual of the TP. By using complimentary slackness conditions the optimal solutions is obtained by the same iterative principle. The method is known as MODI (Modified Distribution) method. In this paper we have discussed all the aspect of transportation problem.
Highlights
Transportation Problem is a special structure of Linear
At the beginning of chapter-I, we are given a brief account of the transportation problem
Most of the operations research papers are aware of the transportation problem
Summary
Programming Problem (LPP), that is frequently encountered in the Operation Research literature. In 1950's simplexbased solution techniques were developed for the transportation problem exploiting its special structure. The bottleneck transportation problem was first discussed by Fulkerson, Glickberg, and Guss (1953) and subsequently by Guss in 1959[25]. Bottleneck models were mathematically formulated with a special type of objective function in which the maximal cost coefficient of any variable with strictly positive value is minimized concerning a given set of constraints. To every depot combat zone pair, a coefficient cij is assigned indicating the amount of time required to ship any number of units ith origin to jth destination. Revised Manuscript received on May 24, 2021. Dr Manjula Das, Professor, Department, Centre for Applied Mathematics & Computing, SOA deemed to be University, Bhubaneswar, Odisha, India. Professor, Department of Mathematics, NIIT, Rourkela, Odisha, India.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Engineering and Advanced Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
