Logo

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

Large book cover: Robust Optimization

Robust Optimization
by

Publisher: Princeton University Press
ISBN/ASIN: B0087I5CBO
Number of pages: 564

Description:
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: An Introduction to Nonlinear Optimization TheoryAn Introduction to Nonlinear Optimization Theory
by - De Gruyter Open
Starting with the case of differentiable data and the classical results on constrained optimization problems, continuing with the topic of nonsmooth objects involved in optimization, the book concentrates on both theoretical and practical aspects.
(1982 views)
Book cover: Applied Mathematical ProgrammingApplied Mathematical Programming
by - Addison-Wesley
This book shows you how to model a wide array of problems. Covered are topics such as linear programming, duality theory, sensitivity analysis, network/dynamic programming, integer programming, non-linear programming, and my favorite, etc.
(9245 views)
Book cover: Optimal Stopping and ApplicationsOptimal Stopping and Applications
by - UCLA
From the table of contents: Stopping Rule Problems; Finite Horizon Problems; The Existence of Optimal Rules; Applications. Markov Models; Monotone Stopping Rule Problems; Maximizing the Rate of Return; Bandit Problems; Solutions to the Exercises.
(6974 views)
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.
(3851 views)