The main purpose of this paper is to show that David Gale's result (1960, Lemma 9.3 on sensitivity in linear programming) is not generally valid. In this lemma, additional assumptions, that are instead required, are not made. We give some correct versions of the above mentioned lemma, and with these an elementary proof of the Gale-Samuelson nonsubstitution theorem.
File in questo prodotto:
Non ci sono file associati a questo prodotto.