Robust Optimization by A. Ben-Tal, L. El Ghaoui, A. Nemirovski

Large book cover: Robust Optimization

Robust Optimization

Publisher: Princeton University Press
Number of pages: 564

Robust optimization is still a relatively new approach to optimization problems affected by uncertainty, but it has already proved so useful in real applications that it is difficult to tackle such problems today without considering this powerful methodology. Written by the principal developers of robust optimization, and describing the main achievements of a decade of research, this is the first book to provide a comprehensive and up-to-date account of the subject.

Home page url

Download or read it online for free here:
Read online
(online reading)

Similar books

Book cover: Applied Mathematical Programming Using Algebraic SystemsApplied Mathematical Programming Using Algebraic Systems
by - Texas A&M University
This book is intended to both serve as a reference guide and a text for a course on Applied Mathematical Programming. The text concentrates upon conceptual issues, problem formulation, computerized problem solution, and results interpretation.
Book cover: Universal Optimization and Its ApplicationUniversal Optimization and Its Application
by - viXra.org
This book describes new method of optimization (''Method of Deformation of Functional'') that has the advantages at greater generality and flexibility as well as the ability to solve complex problems which other methods cannot solve.
Book cover: Optimization and Dynamical SystemsOptimization and Dynamical Systems
by - Springer
Aimed at mathematics and engineering graduate students and researchers in the areas of optimization, dynamical systems, control systems, signal processing, and linear algebra. The problems solved are those of linear algebra and linear systems theory.
Book cover: Discrete OptimizationDiscrete Optimization
by - Utrecht University
From the table of contents: Preliminaries (Optimization Problems); Minimum Spanning Trees; Matroids; Shortest Paths; Maximum Flows; Minimum Cost Flows; Matchings; Integrality of Polyhedra; Complexity Theory; Approximation Algorithms.