Abstract
The problem of successive identification of optimal variables during several stages of an iterative solution process, on a special case of such algorithm-transportation problems with m ≪ n-is considered. The presented experiments show that a great part of the optimal variables is essentially determined, even in the most initial stage of the solution process (immediately after the initial feasible solution is obtained) and the problem of their identification is examined.
Original language | English |
---|---|
Pages (from-to) | 297-301 |
Number of pages | 5 |
Journal | Computers and Operations Research |
Volume | 9 |
Issue number | 4 |
DOIs | |
State | Published - 1982 |