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: 570

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.

Download or read it online for free here:
Download link
(7.2MB, PDF)

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.
(12811 views)
Book cover: Optimization Algorithms: Methods and ApplicationsOptimization Algorithms: Methods and Applications
by - InTech
This book covers state-of-the-art optimization methods and their applications in wide range especially for researchers and practitioners who wish to improve their knowledge in this field. It covers applications in engineering and various other areas.
(7566 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.
(20112 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.
(16449 views)