Items related to Linear Programming: Foundations and Extensions
Synopsis
1. Basic Theory-The Simplex Method and Duality.- 1. Introduction.- 2. The Simplex Method.- 3. Degeneracy.- 4. Efficiency of the Simplex Method.- 5. Duality Theory.- 6. The Simplex Method in Matrix Notation.- 7. Sensitivity and Parametric Analyses.- 8. Implementation Issues.- 9. Problems in General Form.- 10. Convex Analysis.- 11. Game Theory.- 12. Regression.- 2. Network-Type Problems.- 13. Network Flow Problems.- 14. Applications.- 15. Structural Optimization.- 3. Interior-Point Methods.- 16. The Central Path.- 17. A Path-Following Method.- 18. The KKT System.- 19. Implementation Issues.- 20. The Affine-Scaling Method.- 21. The Homogeneous Self-Dual Method.- 4. Extensions.- 22. Integer Programming.- 23. Quadratic Programming.- 24. Convex Programming.- Appendix A. Source Listings.- 1. The Self-Dual Simplex Method.- 2. The Homogeneous Self-Dual Method.- Answers to Selected Exercises.
"synopsis" may belong to another edition of this title.
- PublisherSpringer
- Publication date2013
- ISBN 10 1475756631
- ISBN 13 9781475756630
- BindingPaperback
- LanguageEnglish
- Number of pages472
- Rating
(No Available Copies)
Search Books: Create a WantCan't find the book you're looking for? We'll keep searching for you. If one of our booksellers adds it to AbeBooks, we'll let you know!
Create a Want
