Linear programming and the simplex method

Notices of the American Mathematical Society

Volumn 54, Issue 3, 2007, Pages 364-369

  Gale, David ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33947673913     PISSN: 00029920     EISSN: 10889477     Source Type: Journal    
DOI: None     Document Type: Article

References (7)

1. R. G. BLAND New finite pivoting rules for the simplex method, Mathematics of Operations Research 2 (1977) 103-107.
2. J. B. J. FOURIER, Solution d'une question particulière du calcul des inégalités (1826), and extracts from Histoire de l'Academie (1823, 1824), Oeuvres II, French Academy of Sciences, pp. 317-328.
3. G. B. DANTZIG, Maximization of a linear function subject to linear inequalities, in T. C. Koopmans (ed.), Activity Analysis of Production and Allocation, John Wiley & Sons, New York, 1951, pp. 339-347.
4. D. GALE, H. W. KUHN, and A. W. TUCKER, Linear programming and the theory of games, in T. C. Koopmans (ed.), Activity Analysis of Production and Allocation, John Wiley & Sons, New York, 1951, pp. 317-329.
5. A. J. HOFFMAN, Cycling in the simplex algorithm, National Bureau of Standards, Report No. 2974, Washington, D.C., December 16, 1953.
6. V. KLEE and G. J. MINTY, How good is the simplex algorithm? in (O. Shisha, ed.) Inequalities III, New York, Academic Press, 1972, 159-175.
7. J. VON NEUMANN, Discussion of a maximum problem, working paper dated November 15-16, 1947, reproduced in A. H. Taub (ed.), John von Neumann: Collected Works, Vol. VI, Pergamon Press, Oxford, 1963, pp. 89-95.