An effective algorithm to solve cost minimising transportation problem
by S.M. Abul Kalam Azad; M. Kamrul Hasan
International Journal of Mathematics in Operational Research (IJMOR), Vol. 15, No. 4, 2019

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.

Online publication date: Mon, 14-Oct-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com