International Journal of Mathematics Trends and Technology
Volume 66 | Issue 1 | Year 2020 | Article Id. IJMTT-V66I1P510 | DOI : https://doi.org/10.14445/22315373/IJMTT-V66I1P510
The transportation problem is a particular case of linear programming problems in operations research. It is used to determine the minimum cost for transporting a homogenous commodity from ‘m’ sources to ‘n’ destinations. Transportation models are extensively used in industries to simulate real-life problems and hence reduce the overall cost by minimizing transportation costs. In this paper, three methods of obtaining an initial basic feasible solution (IBFS) viz. the Least-cost method, the North-west corner method, and Vogel’s approximation method, are tested and compared.
[1] Rai Technology University, “Rai Technology University - Operations Research,” [Online]. Available: http://164.100.133.129:81/econtent/Uploads/Operations_Research.pdf.
[2] D. S. Mishra, “Solving Transportation Problem by Various Methods and Their Comaprison,” International Journal of Mathematics Trends and Technology (IJMTT) – Volume 44 Number 4, April 2017.
[3] P. R. Murthy, “Linear Programming: II (Transportation Model),” in Operations Research, New Age International (P) Limited, Publishers, 2005, pp. 141-152.
[4] R. P. Sen, “Linear Programming Extensions Transportation and Assignment Models,” in Operations Research Algorithm and Applications, PHI Learning Private Limited, 2010, pp. 120-142.
[5] “Chegg Study Expert Q&A,” Chegg Study, 2003. [Online]. Available: https://www.chegg.com/homework-help/questions-and-answers/agriculturecritical- component-india-s-cconomy-contributing-17-country-s-gdp-58-households-q31331072. [Accessed 2019].
Mohak Gupta, "Comparison of Various Methods for Solving Linearly Programmed Transportation Problem," International Journal of Mathematics Trends and Technology (IJMTT), vol. 66, no. 1, pp. 54-60, 2020. Crossref, https://doi.org/10.14445/22315373/IJMTT-V66I1P510
PDF 
Abstract 
Keywords 
References 
Citation