Del 0 - International Series in Operations Research & Management Science

Linear Programming: Foundations and Extensions

Inbunden, Engelska, 1996

AvRobert J. Vanderbei,Robert J Vanderbei

2 749 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (1)

Häftad

2 749 kr

Skickas inom 10-15 vardagar

This book focuses largely on constrained optimization. It begins with a substantial treatment of linear programming and proceeds to convex analysis, network flows, integer programming, quadratic programming, and convex optimization. Along the way, dynamic programming and the linear complementarity problem are touched on as well. This book aims to be the first introduction to the topic. Specific examples and concrete algorithms precede more abstract topics. Nevertheless, topics covered are developed in some depth, a large number of numerical examples worked out in detail, and many recent results are included, most notably interior-point methods. The exercises at the end of each chapter both illustrate the theory, and, in some cases, extend it. Optimization is not merely an intellectual exercise: its purpose is to solve practical problems on a computer. Accordingly, the book comes with software that implements the major algorithms studied. At this point, software for the following four algorithms is available: The two-phase simplex method The primal-dual simplex method The path-following interior-point method The homogeneous self-dual methods.

Produktinformation

Utgivningsdatum1996-12-31
Mått155 x 235 x 29 mm
Vikt822 g
FormatInbunden
SpråkEngelska
SerieInternational Series in Operations Research & Management Science
Antal sidor418
Upplaga1997
FörlagKluwer Academic Publishers
ISBN9780792398042

Tillhör följande kategorier

Optimering inom Naturvetenskap och teknik
Företagsekonomi inom Ekonomi och Ledarskap

Preface. Part 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. Part 2: Network-Type Problems. 13. Network Flow Problems. 14. Applications. 15. Structural Optimization. Part 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. Part 4: Extensions. 22. Integer Programming. 23. Quadratic Programming. 24. Convex Programming. Appendix A: Source Listings. Answers to Selected Exercises. Bibliography. Index.

'Vanderbei's book is thoroughly modern. Vanderbei's book has many novel features. Some nice features. This book has style. Overall, I greatly enjoyed reviewing this book, and I highly recommend it as a textbook for an advanced undergraduate or master's level course in linear programming, particularly for courses in an engineering environment. In addition, it also is a good reference book for interior point methods as well as for implementation and computational aspects of linear programming. This is an excellent new book.' Robert Freund, (MIT) in Optima, 56 (1997) 'In conclusion, Vanderbei's book gives an excellent introduction to linear programminbg, especially the algorithmic side of the subject. The book is highly recommended for both self study and as teaching material.' Optima, 58 (1998)

Mer från samma författare

Welcome to the Universe in 3D

Neil deGrasse Tyson, Michael A. Strauss, J. Richard Gott, Robert J. Vanderbei, III Gott, J. Richard, Neil Degrasse Tyson, Michael A Strauss, J Richard Gott, Robert J Vanderbei

Inbunden

319 kr

Real and Convex Analysis

Erhan Çınlar, Robert J Vanderbei, Erhan Çınlar, Robert J. Vanderbei, Erhan Çinlar, Erhan Ç¿nlar

Inbunden

1 119 kr

Real and Convex Analysis

Erhan Çınlar, Robert J Vanderbei, Erhan Çınlar, Robert J. Vanderbei, Erhan Çinlar, Erhan Ç¿nlar

Häftad

1 119 kr