Optimization Theory / Edition 1

by Hubertus Th. Jongen, Klaus Meer, Eberhard Triesch

Overview

Optimization Theory is becoming a more and more important mathematical as well as interdisciplinary area, especially in the interplay between mathematics and many other sciences like computer science, physics, engineering, operations research, etc.

This volume gives a comprehensive introduction into the theory of (deterministic) optimization on an advanced undergraduate and graduate level. One main feature is the treatment of both continuous and discrete optimization at the same place. This allows to study the problems under different points of view, supporting a better understanding of the entire field.

Audience: The book can be adapted well as an introductory textbook into optimization theory on a basis of a two semester course; however, each of its parts can also be taught separately. Many exercises are included to increase the reader's understanding.

Product Details

ISBN-13:	9781402080982
Publisher:	Springer US
Publication date:	07/20/2004
Edition description:	2004
Pages:	443
Product dimensions:	6.10(w) x 9.25(h) x 0.04(d)

Table of Contents

Optimality Criteria on Simple Regions.- Constraints, Lagrange Function, Optimality Criteria.- Parametric Aspects, Semi-Infinite Optimization.- Convex Functions, Duality, Separation Theorem.- Linear Inequalities, Constraint Qualifications.- Linear Programming: The Simplex Method.- The Ellipsoid Method.- The Method of Karmarkar for Linear Programming.- Order of Convergence, Steepest Descent, (Lagrange -)Newton.- Conjugate Direction, Variable Metric.- Penalty-, Barrier-, Multiplier-, Interior Point-Methods.- Search Methods without Derivatives.- One-Dimensional Minimization.- Graphs and Networks.- Flows in Networks.- Applications of the Max-Flow Min-Cut Theorem.- Integer Linear Programming.- Computability; the Turing machine.- Complexity theory.- Reducibility and NP-completeness.- Some NP-completeness results.- The Random Access Machine.- Complexity Theory over the Real Numbers.- Approximating NP-hard Problems.- Approximation Algorithms for TSP.- Approximation algorithms for Bin Packing.- A FPTAS for Knapsack.- Miscellaneous.

Editorial Reviews

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)

From the Publisher