Linear optimization

Dmitris Alevras and Manfred W. Padberg, Linear Optimization and Extensions: Problems and Solutions, Universitext, Springer-Verlag, 2001. (Problems from Padberg with solutions.)

de Berg, Mark; van Kreveld, Marc; Overmars, Mark; Schwarzkopf, Otfried (2000). Computational Geometry (2nd revised ed.). Springer-Verlag. ISBN . Chapter 4: Linear Programming: pp. 63–94. Describes a randomized half-plane intersection algorithm for linear programming.

Michael R. Garey and David S. Johnson (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman. ISBN . A6: MP1: INTEGER PROGRAMMING, pg.245. (computer science, complexity theory)

Gärtner, Bernd; Matoušek, Jiří (2006). Understanding and Using Linear Programming. Berlin: Springer. ISBN . (elementary introduction for mathematicians and computer scientists)

Cornelis Roos, Tamás Terlaky, Jean-Philippe Vial, Interior Point Methods for Linear Optimization, Second Edition, Springer-Verlag, 2006. (Graduate level)

Alexander Schrijver (2003). Combinatorial optimization: polyhedra and efficiency. Springer.

Alexander Schrijver, Theory of Linear and Integer Programming. John Wiley & sons, 1998, ISBN (mathematical)

Gerard Sierksma; Yori Zwols (2015). Linear and Integer Optimization: Theory and Practice. CRC Press. ISBN .; with online solver: https://online-optimizer.appspot.com/

Gerard Sierksma; Diptesh Ghosh (2010). Networks in Action; Text and Computer Exercises in Network Optimization. Springer. ISBN . (linear optimization modeling)

H. P. Williams, Model Building in Mathematical Programming, Fifth Edition, 2013. (Modeling)

Stephen J. Wright, 1997, Primal-Dual Interior-Point Methods, SIAM. (Graduate level)

Yinyu Ye, 1997, Interior Point Algorithms: Theory and Analysis, Wiley. (Advanced graduate-level)

Ziegler, Günter M., Chapters 1–3 and 6–7 in Lectures on Polytopes, Springer-Verlag, New York, 1994. (Geometry)

Further reading