Panik | Linear Programming: Mathematics, Theory and Algorithms | E-Book | sack.de
E-Book

E-Book, Englisch, Band 2, 498 Seiten, eBook

Reihe: Applied Optimization

Panik Linear Programming: Mathematics, Theory and Algorithms


1996
ISBN: 978-1-4613-3434-7
Verlag: Springer US
Format: PDF
 Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, Band 2, 498 Seiten, eBook

Reihe: Applied Optimization

ISBN: 978-1-4613-3434-7
Verlag: Springer US
Format: PDF
 Kopierschutz: 1 - PDF Watermark

provides an in-depth look at simplex based as well as the more recent interior point techniques for solving linear programming problems. Starting with a review of the mathematical underpinnings of these approaches, the text provides details of the primal and dual simplex methods with the primal-dual, composite, and steepest edge simplex algorithms. This then is followed by a discussion of interior point techniques, including projective and affine potential reduction, primal and dual affine scaling, and path following algorithms. Also covered is the theory and solution of the linear complementarity problem using both the complementary pivot algorithm and interior point routines. A feature of the book is its early and extensive development and use of duality theory.
The book is written for students in the areas of mathematics, economics, engineering and management science, and professionals who need a sound foundation in the important and dynamic discipline of linear programming.
Panik Linear Programming: Mathematics, Theory and Algorithms jetzt bestellen!

Zielgruppe

Research

Autoren/Hrsg.

Panik, M.J.

Weitere Infos & Material

1. Introduction and Overview. 2. Preliminary Mathematics. 3. Introduction to Linear Programming. 4. Duality Theory. 5. The Theory of Linear Programming. 6. Duality Theory Revisited. 7. Computational Aspects of Linear Programming. 8. One-Phase, Two-Phase, and Composite Methods of Linear Programming. 9. Computational Aspects of Linear Programming: Selected Transformations. 10. The Dual Simplex, Primal-Dual, and Complementary Pivot Methods. 11. Postoptimality Analysis I. 12. Postoptimality Analysis II. 13. Interior Point Methods. 14. Interior Point Algorithms for Solving Linear Complementary Problems. Appendix A: Updating the Basis Inverse. Appendix B: Steepest Edge Simplex Methods. Appendix C: Derivation of the Projection Matrix. References. Notation Index. Index.

Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.