Abstract
In this paper we discuss problems arising from variation of the original requirements, prices or both for some given transportation problem. Through the methods presented a considerable fraction of the new optimal variables is identified, provided that the new problem does not differ "too much" from the original one. This identification is achieved immediately once the given original basic variables are arranged in some simple sequences. Such sequences are already at our disposal when the original solution is obtained by the RSA method [2]. It is shown how the results obtained may help determine the location and capacity of a proposed factory in an optimal fashion.
Original language | English |
---|---|
Pages (from-to) | 213-226 |
Number of pages | 14 |
Journal | Computers and Operations Research |
Volume | 4 |
Issue number | 3 |
DOIs | |
State | Published - 1977 |