| Dewey Class |
519.6 |
| Title |
Linear and Nonlinear Programming ([Ebook]) / by David G. Luenberger, Yinyu Ye. |
| Author |
Luenberger, David G. , 1937- |
| Added Personal Name |
Ye, Yinyu |
| Other name(s) |
SpringerLink (Online service) |
| Edition statement |
Third Edition. |
| Publication |
Boston, MA : Springer US , 2008. |
| Physical Details |
XIV, 550 pages, 93 illus. : online resource. |
| Series |
International Series in Operations Research & Management Science 0884-8289 ; ; 116 |
| ISBN |
9780387745039 |
| Summary Note |
"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. Yinyu Ye has written chapters and chapter material on a number of these areas including Interior Point Methods. This book is designed for either self-study by professionals or classroom work at the undergraduate or graduate level for technical students. Like the field of optimization itself, which involves many classical disciplines, the book should be useful to system analysts, operations researchers, numerical analysts, management scientists, and other specialists.: |
| Contents note |
Introduction -- Part I: Linear Programming -- 2. Basic Properties of Linear Programs -- 3. The Simplex Method -- 4. Duality -- 5. Interior-Point Methods -- 6. Transportation and Network Flow Problems -- Part II: Unconstrained Problems.-7. Basic Descent Methods -- 8. Conjugate Direction Methods -- 9. Quasi-Newton Methods -- Part III: Constrained Minimization -- 10. Constrained Minimization Conditions -- 11. Primal Methods -- 12. Penalty and Barrier Methods -- 13. Dual and Cutting Plane Methods -- 14. Primal-Dual Methods -- Appendix A: Mathematical Review -- A.1. Sets -- A.2. Matrix Notation -- A.3. Spaces -- A.4. Eigenvalues and Quadratic Forms -- A.5. Topological Concepts -- A.6. Functions -- Appendix B: Convex Sets -- B.1. Basic Definitions -- B.2. Hyperplanes and Polytopes -- B.3. Separating and Supporting Hyperplanes -- B.4. Extreme Points -- Appendix C: Gaussian Elimination -- Bibliography -- Index. |
| System details note |
Online access is restricted to subscription insitutions through IP address (only for SISSA internal users) |
| Internet Site |
http://dx.doi.org/10.1007/978-0-387-74503-9 |
| Links to Related Works |
Subject References:
Authors:
Corporate Authors:
Series:
Classification:
|
|---|
