Buch, Englisch, Band 116, 546 Seiten, Previously published in hardcover, Format (B × H): 155 mm x 235 mm, Gewicht: 844 g
Reihe: International Series in Operations Research & Management Science
Buch, Englisch, Band 116, 546 Seiten, Previously published in hardcover, Format (B × H): 155 mm x 235 mm, Gewicht: 844 g
Reihe: International Series in Operations Research & Management Science
ISBN: 978-1-4419-4504-4
Verlag: Springer US
"Linear and Nonlinear Programming" is considered a classic textbook in Optimization. While it is a classic, it also reflects modern theoretical insights. These insights provide structure to what might otherwise be simply a collection of techniques and results, and this is valuable both as a means for learning existing material and for developing new results. One major insight of this type is the connection between the purely analytical character of an optimization problem, expressed perhaps by properties of the necessary conditions, and the behavior of algorithms used to solve a problem. This was a major theme of the first and second editions. Now the third edition has been completely updated with recent Optimization Methods. The new co-author, Yinyu Ye, has written chapters and chapter material on a number of these areas including Interior Point Methods.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik Mathematik Operations Research
- Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Nichtlineare Wissenschaft
- Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Mathematische Modellierung
- Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Optimierung
- Wirtschaftswissenschaften Betriebswirtschaft Unternehmensforschung
Weitere Infos & Material
Linear Programming.- Basic Properties of Linear Programs.- The Simplex Method.- Duality.- Interior-Point Methods.- Transportation and Network Flow Problems.- Unconstrained Problems.- Basic Properties of Solutions and Algorithms.- Basic Descent Methods.- Conjugate Direction Methods.- Quasi-Newton Methods.- Constrained Minimization.- Constrained Minimization Conditions.- Primal Methods.- Penalty and Barrier Methods.- Dual and Cutting Plane Methods.- Primal-Dual Methods.