Preface. Part I: Motivation. 1. Linear and Integer Linear Optimization. Part II: Theory. 2. Linear Systems and Projection. 3. Linear Systems and Inverse Projection. 4. Integer Linear Systems: Projection and Inverse Projection. Part III: Algorithms. 5. The Simplex Algorithm. 6. More on Simplex. 7. Interior Point Algorithms: Polyhedral Transformations. 8. Interior Point Algorithms: Barrier Methods. 9. Integer Programming. Part IV: Solving Large Scale Problems: Decomposition Methods. 10. Projection: Benders's Decomposition Methods. 11. Inverse Projection: Dantzig-Wolfe Decomposition. 12. Lagrangian Methods. Part V: Solving Large Scale Problems: Using Special Structure. 13. Sparse Methods. 14. Network Flow Linear Programs. 15. Large Integer Programs: Preprocessing and Cutting Planes. 16. Large Integer Programs: Projection and Inverse Projection. Part VI: Appendix. A. Polyhedral Theory. B. Complexity Theory. C. Basic Graph Theory. D. Software and Test Problems. E. Notation. Bibliography. References. Author Index. Topic Index.
Springer Book Archives