Fundamentals of Transportation Problem
B. Mallia1, M. Das2, C. Das3

1Mrs. BhabaniMallia*, M.Phil., Statistics, Utkal University, Bhubaneswar, Odisha, India.
2Dr. Manjula Das, Professor, Department, Centre for Applied Mathematics & Computing, SOA deemed to be University, Bhubaneswar, Odisha, India.
3Dr. C. Das, Professor, Department of Mathematics, NIIT, Rourkela, Odisha, India.

Manuscript received on May 18, 2021. | Revised Manuscript received on May 25, 2021. | Manuscript published on June 30, 2021. | PP: 90-103 | Volume-10 Issue-5, June 2021. | Retrieval Number: 100.1/ijeat.E26540610521 | DOI: 10.35940/ijeat.E2654.0610521
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

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. 
Keywords: Transportation Problem, Initial Basic Feasible Solution, Optimal Solution