Solving Inequalities and Proving Farkas's Lemma Made Easy

American Mathematical Monthly

Volumn 111, Issue 2, 2004, Pages 152-157

  Avis, David ^a   Kaluzny, Bohdan ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 1442352923     PISSN: 00029890     EISSN: None     Source Type: Journal    
DOI: 10.2307/4145216     Document Type: Article

References (4)

1. R. G. Bland, New finite pivot rules for the simplex method, Math. Oper. Res. 2 (1977) 103-107.
2. V. Chvátal, Linear Programming, Freeman, New York, 1983.
3. K. Fukuda and T. Terlaky, Criss-cross methods: A fresh view on pivot algorithms, Math. Program. 79 (1997) 369-395.
4. G. Strang, Linear Algebra and Its Applications, Academic Press, London, 1980.