A Practical Guide to Robust Optimization
by Bram L. Gorissen, Ihsan Yanıkoğlu, Dick den Hertog
Publisher: arXiv 2015
Number of pages: 29
Description:
The aim of this paper is to help practitioners to understand robust optimization and to successfully apply it in practice. We provide a brief introduction to robust optimization, and also describe important do's and don'ts for using it in practice. We use many small examples to illustrate our discussions.
Download or read it online for free here:
Download link
(700KB, PDF)
Similar books
Linear Programming
by Jim Burke - University of Washington
These are notes for an introductory course in linear programming. The four basic components of the course are modeling, solution methodology, duality theory, and sensitivity analysis. We focus on the simplex algorithm due to George Dantzig.
(8441 views)
by Jim Burke - University of Washington
These are notes for an introductory course in linear programming. The four basic components of the course are modeling, solution methodology, duality theory, and sensitivity analysis. We focus on the simplex algorithm due to George Dantzig.
(8441 views)
Convex Optimization
by Stephen Boyd, Lieven Vandenberghe - Cambridge University Press
A comprehensive introduction to the subject for students and practitioners in engineering, computer science, mathematics, statistics, finance, etc. The book shows in detail how optimization problems can be solved numerically with great efficiency.
(19643 views)
by Stephen Boyd, Lieven Vandenberghe - Cambridge University Press
A comprehensive introduction to the subject for students and practitioners in engineering, computer science, mathematics, statistics, finance, etc. The book shows in detail how optimization problems can be solved numerically with great efficiency.
(19643 views)
Convex Optimization: Algorithms and Complexity
by Sebastien Bubeck - 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.
(6847 views)
by Sebastien Bubeck - 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.
(6847 views)
Optimal Stopping and Applications
by Thomas S. Ferguson - 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.
(13689 views)
by Thomas S. Ferguson - 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.
(13689 views)