Abstract
In the regular methods solving transportation problems, the optimal basic cells are determined only after the optimal solution has been obtained, whereas in the early stages, no indication is available whether a particular cell will be basic (or non-basic) in the solution. In this article some methods are given which enable fixing optimal basic and non-basic even in the very early stages of the solution process. Such knowledge is very useful in decomposing large problems, treatment of sensitivity analysis, this in addition to considerable reduction in time and storage requirements. These applications are demonstrated in some examples.
| Original language | English |
|---|---|
| Pages (from-to) | 83-91 |
| Number of pages | 9 |
| Journal | Economic Computation and Economic Cybernetics Studies and Research |
| Volume | 19 |
| Issue number | 1 |
| State | Published - 1984 |