Optimization Theory - Rilegato

Jongen, Hubertus Th; Meer, Klaus; Triesch, Eberhard

Rilegato

ISBN 10: 1402080980 ISBN 13: 9781402080982

Casa editrice: Kluwer Academic Pub, 2004

Riassunto

This volume provides a comprehensive introduction to the theory of (deterministic) optimization. It covers both continuous and discrete optimization. This allows readers to study problems under different points-of-view, which supports a better understanding of the entire field. Many exercises are included to increase the reader's understanding.

Su questo libro

Recensione

From the reviews:

"If you have to read a book about (deterministic) optimization in finite dimension, this is the one. The book covers the whole theory of modern optimization; the authors have included a lot of exercises, examples and figures that make the book understandable and more interesting. All the current knowledge on existence of solutions, optimality criteria, structural properties of the models as well as the algorithms ... have been included in this work in a rigorous, concise and elegant manner." (Francisco Guerra Vazquez, Zentralblatt MATH, Vol. 1059 (10), 2005)

"The book covers a wide range of subjects pertaining to mathematical programming ... . The various subjects are described in considerable detail, several examples are given and numerous examples problems are proposed. The authors write that the book is intended for undergraduates and graduates, but I think that it might be useful also for those postgraduates who wish to learn the basic aspects of mathematical programming ... . The book has a rich list of bibliographical references which are surely useful ... ." (Giorgio Giorgi, Mathematical Reviews, Issue 2005 b)

Contenuti

Preface.- PART I. CONTINUOUS OPTIMIZATION.- 1. Optimality Criteria on Simple Regions.- 2. Constraints, Lagrange Function, Optimality.- 3. Parametric Aspects, Semi-Infinite Optimization.- 4. Convex Functions, Duality, Separation Theorem.- 5. Linear Inequalities, Constraint Qualifications.- 6. Linear Programming: The Simplex Method.- 7. The Ellipsoid Method.- 8. Karmarkar’s Method for Linear Programming.- 9. Order of Convergence, Steepest Descent.- 10. Conjugate Direction, Variable Metric.- 11. Penalty-, Barrier-, Multiplier-, IP-Methods.- 12. Search Methods without Derivatives.- 13. One-Dimensional Minimization.- PART II. DISCRETE OPTIMIZATION.- 14. Graphs and Networks.- 15. Flows in Networks.- 16. Applications of the Max-Flow Min-Cut Theorem.- 17. Integer Linear Programming.- 18. Computability; the Turing machine.- 19. Complexity theory.- 20. Reducibility and NP-completeness.- 21. Some NP-completeness results.- 22. The Random Access Machine.- 23. Complexity Theory over the Real Numbers.- 24. Approximating NP-hard Problems.- 25. Approximation Algorithms for TSP.- 26. Approximation algorithms for Bin Packing.- 27. A FPTAS for Knapsack.- 28. Miscellaneous.- Index.- Index of Symbols.- References.

Dettagli dell?edizione

• Editore: Kluwer Academic Pub
• Data di pubblicazione: 2004
• Lingua: Inglese
• ISBN 10: 1402080980
• ISBN 13: 9781402080982
• Rilegatura: Copertina rigida
• Numero di pagine: 443
• Contatto del produttore: non disponibile
• Persona responsabile: CMN Printpool Inh. Mathis Neumann; https://www.also.com/ec/cms5/en_6000/6000/index.jsp; ; Friedrich-Karl-Str. 9; Hamburg; Germania