Research Article | Open Access | Download PDF
Volume 44 | Number 4 | Year 2017 | Article Id. IJMTT-V44P538 | DOI : https://doi.org/10.14445/22315373/IJMTT-V44P538
Solving Transportation Problem by Various
Methods and Their Comaprison
Dr. Shraddha Mishra
Citation :
Dr. Shraddha Mishra, "Solving Transportation Problem by Various
Methods and Their Comaprison," International Journal of Mathematics Trends and Technology (IJMTT), vol. 44, no. 4, pp. 270-275, 2017. Crossref, https://doi.org/10.14445/22315373/IJMTT-V44P538
Abstract
The most important and successful
applications in the optimaization refers to
transportation problem (tp), that is a special class of
the linear programming (lp) in the operation
research (or).
Transportation problem is considered a vitally
important aspect that has been studied in a wide
range of operations including research domains. As
such, it has been used in simulation of several real
life problems. The main objective of transportation
problem solution methods is to minimize the cost or
the time of transportation.
An Initial Basic Feasible Solution(IBFS) for the
transportation problem can be obtained by using the
North-West corner rule, Miinimum Cost Method and
Vogel’s Approximation Method. In this paper the
best optimality condition has been checked.
Thus, optimizing transportation problem of variables
has remarkably been significant to various
disciplines.
Keywords
Transportation problem, Linear Programming (LP)
References
[1] Kanti Swarup ,P. K. Gupta ,Man Mohan . “Operation Research”, Sultan Chand & Sons, New Delhi,2005.
[2] Hamdy A.Taha.” Operations Research: An Introduction “,Prentice Hall, 7 editions 5 ,USA,2006.
[3] Prem Kumar Gupta, D.S.Hira.” Operations Research”, An Introduction, S.Chand and Co., Ltd. New Delhi, 1999.
PDF 
Citation 
Abstract 
Keywords 
References