Linear Programming
This book is designed for an introductory graduate course on Linear Programming using the simplex algorithm. A systematic approach to building such models is presented together with the geometry, algebra, and computational implementation of the simplex algorithm. Duality theory is also developed and an appendix on spreadsheet modeling in EXCEL is included.
Return to Main Menu
| 1. Problem Formulation |
| 2. Geometric Motivation |
| 3. Proof Techniques |
| 4. Linear Algebra |
| 5. The Simplex Algorithm |
| 6. Phase 1 |
| 7. Computational Implementation |
| 8. Duality Theory |
| 9. Sensitivity and Parametric Analysis |
| 10. Techniques for Handling Bounds |
| 11. Network Flow Problems |
| |
| Appendix A: The Tableau Method |
| Appendix B: How Efficiently Can We Solve LP Problems? |
| Appendix C: Spreadsheet Modeling Using Excel |
Return to Main Menu
Return to Main Menu
