Maximum {Supplies, Demands} Method to Find the Initial Transportation Problem
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 t...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Zakho
2013-09-01
|
| Series: | Science Journal of University of Zakho |
| Subjects: | |
| Online Access: | https://sjuoz.uoz.edu.krd/index.php/sjuoz/article/view/430 |
| Summary: | 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 |
|---|---|
| ISSN: | 2663-628X 2663-6298 |