Abstract
The developed algorithm in this article provides an initial basic feasible solution (IBFS) of the transportation problem (TP) of the linear programming problem. The proposed method, which involves fewer calculations and fewer steps or iterations, is able to provide a better approximate solution to the TP than classical methods, especially Vogel's approximation method (VAM). This method is also easier and more effective than some recent methods to solve TPs, which were introduced by various researches. This article illustrates the simplicity and effectiveness of the developed algorithm by providing a good number of examples.
Sign-in/Register to access full text options 
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 Mathematics in Operational Research
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.
