OPTIMIZATION
Edited by G.L. Nemhauser, A.H.G. Rinnooy Kan and M.J. Todd
CHAPTER 2
Linear Programming
D. Goldfarb and M.J. Todd
1. Introduction*
2. Geometric interpretation
3. The simplex method
4. Duality and sensitivity analysis
5. Exploiting structure
6. Column generation and the decomposition principle
7. The complexity of linear programming
8. The elipsoid method
9. Karmarkar's projective scaling algorithm
References
* The first two pages of the chapters are available as PDF file.
Complete chapters on ScienceDirect
[Description and order information]
