Maximum {Supplies, Demands} Method to Find the Initial Transportation Problem
Article Sidebar
Main Article Content
Abstract
In this paper, we have developed an additional method using the Maximum {Supplies, Demands} and combining both of them with the minimum cost to find an initial solution which is very close to the optimal or at most it is the optimum solution. The transportation algorithm follows the exact steps of the simplex method. However, instead of using the regular simplex tableau, we take advantage of the special structure of the transportation model to organize the computation in a more convenient form. There are several methods for finding the initial basic feasible solution (BFS) of Transportation Problem (TP). But, there is no suitable answer to the question: Which method is the best one
Downloads
Article Details
Section
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License [CC BY-NC-SA 4.0] that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work, with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online.