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: Optimization Models For Decision MakingOptimization Models For Decision Making
by - Springer
This is a Junior level book on some versatile optimization models for decision making in common use. The aim of this book is to develop skills in mathematical modeling, and in algorithms and computational methods to solve and analyze these models.
(10067 views)
Book cover: Convex Optimization: Algorithms and ComplexityConvex Optimization: Algorithms and Complexity
by - arXiv.org
This text presents the main complexity theorems in convex optimization and their algorithms. Starting from the fundamental theory of black-box optimization, the material progresses towards recent advances in structural and stochastic optimization.
(4961 views)
Book cover: Linear Complementarity, Linear and Nonlinear ProgrammingLinear Complementarity, Linear and Nonlinear Programming
by
This book provides an in-depth and clear treatment of all the important practical, technical, computational, geometric, and mathematical aspects of the Linear Complementarity Problem, Quadratic Programming, and their various applications.
(10515 views)
Book cover: The Design of Approximation AlgorithmsThe Design of Approximation Algorithms
by - Cambridge University Press
This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. It is organized around techniques for designing approximation algorithms, including greedy and local search algorithms.
(14628 views)