Available:*
Library | Item Barcode | Call Number | Material Type | Item Category 1 | Status |
---|---|---|---|---|---|
Searching... | 30000010138224 | T57.7 L834 2003 | Open Access Book | Book | Searching... |
Searching... | 30000010151745 | T57.7 L834 2003 | Open Access Book | Book | Searching... |
On Order
Summary
Summary
The original edition of this book was celebrated for its coverage of the central concepts of practical optimization techniques. This updated edition expands and illuminates the connection between the purely analytical character of an optimization problem, expressed by properties of the necessary conditions, and the behavior of algorithms used to solve a problem. Incorporating modern theoretical insights, this classic text is even more useful.
Author Notes
David G. Luenberger has directed much of his career toward teaching "portable concepts" - organizing theory around concepts and actually "porting" the concepts to applications where, in the process, the general concepts are often discovered. The search for fundamentals has explicitly directed his research in the fields of control, optimization, planning, economics, and investments, and in turn, it is the discovery of these fundamentals that have motivated his textbook writing projects.
Table of Contents
1 Introduction |
Part I Linear Programming |
2 Basic Properties of Linear Programs |
3 The Simplex Method |
4 Duality |
5 Transportation and Network Flow Problems |
Part II Unconstrained Problems |
6 Basic Properties of Solutions and Algorithms |
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 Lagrange 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 |