Linear Programming: An Introduction to Finite Improvement Algorithms

Autorentext

Daniel Solow

Inhalt

Introduction to the Dover Edition Preface Acknowledgments 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. Sinsitivity and Parametric Analysis 10. Techniques for Handling Bound Constraints 11. Network Flow Problems Appendix A. The Tableau Method Appendix B. How Efficiently Can We Solve LP Problems? Appendix C. Spreadsheet Modeling Using Ecxcel Index