Overview

1. Introduction -- 2. The geometry of linear programming -- 3. The simplex method -- 4. Duality theory -- 5. Sensitivity analysis -- 6. Large scale optimization -- 7. Network flow problems -- 8. Complexity of linear programming and the ellipsoid method -- 9. Interior point methods -- 10. Integer programming formulations -- 11. Integer programming methods -- 12. The art in linear optimization.