Robert Bland: New finite pivoting rules for the simplex algorithm.
Math. Op. Res. 2 (1977), 103-107.

6639 Robert Bland: Programmazione lineare e allocazione delle risorse.
6626 Israel, 94-103.

19202 Richard Cottle/Ellis Johnson/Roger Wets: George B. Dantzig (1914-2005).
Notices AMS March 2007, 344-362.

R. Cottle/J. Pang/R. Stone: The linear complementarity problem.
Academic Press 1992, 760p. 0-12-192350-9. $60. Highly recommended.

George Dantzig: Linear programming and extensions. Princeton UP 1998, 630p. $30.

21106 George Dantzig/Mukund Thapa: Linear programming I.
Springer 1997, 430p. Eur 93.

21109 George Dantzig: Linear programming. Operations Res. 50/1 (2002), 42-47.

20475 Robert Dorfman/Paul Samuelson/Robert Solow: Linear programming
and economic analysis. Dover 1987, 520p. Eur 18.

19203 David Gale: Linear programming and the simplex method.
Notices AMS March 2007, 364-369.

21118 Saul Gass: An illustrated guide to linear programming.
Dover 1990, 170p. Eur 11.

21612 Monica Gazzetta: Il lemma di Farkas e le condizioni di
Karush-Kuhn-Tucker nell'ottimizzazione lineare e non lineare.
Tesi LS, Univ. Ferrara 2010, 70p.

20952 Carl Geiger/Christian Kanzow: Theorie und Numerik restringierter
Optimierungsaufgaben. Springer 2002, 490p. Eur 23.

13096 Christian Grossmann/Johannes Terno: Numerik der Optimierung.
Teubner 1997, 350p. 3-519-12090-9. DM 43.

21257 Horst Hamacher/Kathrin Klamroth: Lineare Optimierung und
Netzwerkoptimierung. Vieweg 2006, 240p. Eur 32.

16191 Florian Jarre/Josef Stoer: Optimierung. Springer 2004, 470p. Eur 30.

20476 Howard Karloff: Linear programming. Birkhäuser 1991, 142p. Eur 55.
Linear programming for mathematicians, contains a self-contained and
mathematically rigorous exposition of the simplex algorithm, duality, the
ellipsoid algorithm and Karmarkar's algorithm. With respect to both contents
and style this book can be recommended without restriction as a class-room
text and as a text for self-study. (Reviewer H. Mitsch).

N. Karmarkar: A new polynomial time algorithm for linear programming.
Combinatorica 4 (1984), 373-381.

M. Kojima/N. Megiddo/T. Noma/A. Yoshise: A unified approach to interior
point algorithms for linear complementarity problems. Springer 1991.

16009 Vilmos Komornik: A simple proof of Farkas' lemma.
Am. Math. Monthly December 1998, 949-950.

20740 Bernhard Korte/Jens Vygen: Kombinatorische Optimierung.
Springer 2008, 670p. Eur 39.

2549 Bela Kreko: Optimierung - nichtlineare Modelle. Berlin 1974.

20461 David Luenberger/Yinyu Ye: Linear and nonlinear programming.
Springer 2008, 550p. Eur 87.

20462 Kurt Marti/Detlef Gröger: Einführung in die lineare und
nichtlineare Optimierung. Physica 2000, 200p. Eur 20.

20955 Jiri Matousek/Bernd Gärtner: Understanding and using
linear programming. Springer 2007, 220p. Eur 41.

J. Maurras: Programmation lineaire, complexite'.
Springer 2002, 220p. Eur 45.

2258 Heiner Müller-Merbach: Operations research. Vahlen 1988.

K. Murty: Linear and combinatorial programming. Wiley 1976.

Manfred Padberg: Linear optimization and extensions.
Springer 1995, 460p. 3-540-58734-9. $99.

C. Roos/T. Terlaky/J. Vial: Theory and algorithms for linear optimization.
Wiley 1997.

2215 Michel Sakarovitch: Linear programming. Springer 1983.

5551 Jochen Schmidt: Dual algorithms for solving convex partially separable
optimization problems. Jber. DMV 94 (1992), 40-62.

2330 Alexander Schrijver: Theory of linear and integer programming.
Wiley 1990.

2406 Egon Seiffart/Karl Manteuffel: Lineare Optimierung. Teubner 1991.

20459 Robert Vanderbei: Linear programming. Springer 2008, 460p. Eur 81.