Sensitivity analysis of the classical transportation problem. A combinatorial approach

Jacob Intrator, Jacob Paroush

Research output: Contribution to journalArticlepeer-review

11 Scopus citations


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 languageEnglish
Pages (from-to)213-226
Number of pages14
JournalComputers and Operations Research
Issue number3
StatePublished - 1977


Dive into the research topics of 'Sensitivity analysis of the classical transportation problem. A combinatorial approach'. Together they form a unique fingerprint.

Cite this