Distributionally robust stochastic optimization with. The robust optimization framework developed by lin et al. An inexact twostage stochastic robust programming for. Optimization problems arising in practice involve random model parameters.
Information about possible values of the problem data is incorporated in the model, and the model generates solutions that are less sensitive to data uncertainty. Robust optimization methods are much more recent, with most research in the past ten years. In stochastic optimization so, the uncertain numerical data are assumed to be random. Part of the lecture notes in computer science book series lncs, volume 3321. We use cookies to give you the best possible experience. There are constraints with uncertain parameters that must be satis. Introduction to stochastic programming springer series in operations.
Introduction to stochastic programming guide books. Introduction to linear optimization and extensions with. The book stochastic programming is a comprehensive introduction to the field and its basic mathematical tools. Whereas deterministic optimization problems are formulated with known parameters, real world problems almost. The proposed robust formulations have the advantage to be solvable in polynomial time and to have theoretical guarantees for the quality of their solutions. The proposed robust formulations have the advantage to be solvable in polynomial time and to have theoretical guarantees for the quality of their solutions, which is not the case for the stochastic formulation. Advances in stochastic programming and robust optimization for supply chain planning. An attractive feature of the framework is the computational scalability to multiperiod models. The objective function used in this model is total profit instead of minus total profit as used in the book. Aproximations of stochastic and robust optimization programs 3 throughout, we assume that there exists a feasible solution to rcp. While applications of stochastic programming have been reported over many years in the technical literature, and a number of applications of robust optimization have appeared recently, nearly all of these have been laborintensive individual projects. Stochastic optimization methods kurt marti springer. Over the last few decades these methods have become essential tools for science, engineering, business. Distributionally robust stochastic optimization with wasserstein distance rui gao, anton j.
The main topic of this book is optimization problems involving uncertain parameters, for which stochastic models are available. There are several ways to apply robust optimization and the choice of form. Birge, 9781461402367, available at book depository with free delivery worldwide. Many of the fundamental concepts are discussed in the linear case, stochastic linear programming. Introduction to stochastic programming book depository. The stochastic optimization model is less conservative than the worstcaseoriented robust optimization models or the chanceconstraint optimization models 9. In this paper, we introduce an approach for constructing uncertainty sets for robust optimization using new deviation measures for random variables termed the forward and backward deviations. Instead of seeking to immunize the solution in some probabilistic sense to. In this paper we study distributionally robust stochastic programming in a setting where there is a specified reference probability measure and the uncertainty set of probability measures consists of measures in some sense close to the reference measure. Software stochastic linear programming solvers on neos server. Robust stochastic approximation approach to stochastic. In the simplest case, these random data obey a known in advance probability distribution, while in more ad vanced settings, this distribution is only partially known. Praise for robust portfolio optimization and management in the half century since harry markowitz introduced his elegant theory for selecting portfolios, investors and scholars have extended and refined its application to a wide range of realworld problems, culminating in the contents of this masterful book. A robust optimization perspective on stochastic programming xin chen.
It provides an introduction to stochastic programming and robust optimization models. Using a linear decision rule, we also propose a tractable approximation approach for solving a class of multistage chanceconstrained stochastic. Stochasticversus robustoptimization fora transportationproblem. This book is an authoritative reference that will be very useful to researchers working in this area. Robust optimization princeton series in applied mathematics.
Online stochastic and robust optimization springerlink. Stochastic programming modeling ima new directions short course on mathematical optimization je linderoth department of industrial and systems engineering university of wisconsinmadison august 8, 2016 je linderoth uwmadison stochastic programming modeling lecture notes 1 77. Tractable stochastic analysis in high dimensions via robust optimization, with c. Modeling and theory, second edition, the authors introduce new material to reflect recent developments in stochastic. Stochastic programming the science that provides us with tools to design and control stochastic systems with the aid of mathematical programming techniques lies at the intersection of statistics and mathematical programming. A complementary methodology to stochastic programming and sensitivity analysis seeks a solution that will have an acceptable performance under most realizations of the uncertain inputs usually, no distribution assumption is made on uncertain. Help the students to understand how to model uncertainty into mathematical optimization problems, what uncertainty brings to the decision process and which techniques help to manage uncertainty in solving the problems. This book focuses on optimization problems involving uncertain parameters and covers the theoretical foundations and recent advances in areas where stochastic models are available. Stochastic programming and robust optimization springerlink. The robust optimization methods propose some relaxation techniques to deal with such a. Stochastic programming and robust optimization mie utoronto.
Stochastic programming is a framework for modeling optimization problems that involve uncertainty. In this paper a stochastic robust optimization problem of residential microgrid energy management is presented. Online stochastic and robust optimization 287 constraints are present, the generic algorithm naturally leads to the traditional expec tation algorithm and to a novel hedging algorithm that. Stochastic optimization refers to a collection of methods for minimizing or maximizing an objective function when randomness is present. In addition to fundamental topics, the book discusses current linear optimization technologies such as predictorpath following interior point methods for both linear and quadratic optimization, as well as the inclusion of linear optimization of uncertainty example. This field is currently developing rapidly with contributions from many disciplines including operations research, mathematics, and probability. Robust optimization the paradigm to explain the paradigm of robust optimization, we start by addressing the particular case of linear programming the generic optimization problem that is.
Back to optimization under uncertainty stochastic programming is a framework for modeling optimization problems that involve uncertainty. Stochastic versus robust optimization for a transportation problem. The problem is to determine the number of vehicles to book at. Stochastic optimization an overview sciencedirect topics. A tractable approximation of stochastic programming via. In the following, we present in brief the general robust optimization approach, which explicitly takes into account the various forms of. This is mainly due to solid mathematical foundations and. Optimization problems 267 optimization duality theory 269 how do optimization algorithms work. A basic difficulty of solving such stochastic optimization problems is that the involved multidimensional integrals expectations cannot be computed with high accuracy. We have stochastic and deterministic linear programming, deterministic and stochastic network. The robust convex programming problem is convex but it is numerically hard to solve because of in nite number of constraints. This book is devoted to robust optimization a specific and relatively.
In this paper we consider optimization problems where the objective function is given in a form of the expectation. There are several ways to apply robust optimization and the choice of form is typical of the problem that is being solved. In this extensively updated new edition there is more material on methods and examples including several new approaches for discrete variables, new results on risk measures in modeling and monte carlo sampling methods, a new chapter on relationships to other methods including approximate dynamic programming, robust optimization and online methods. Robust optimization is a subset of stochastic optimization. Keywords robust optimization models comparisons of robust optimization with sensitivity analysis and stochastic linear programming notes see also references.
A robust optimization perspective on stochastic programming. Robust optimization an overview sciencedirect topics. Stochastic program robust optimization portfolio management stochastic network terminal wealth these keywords were added by machine and not by the authors. This paper considers online stochastic optimization problems where uncertainties are. For the computation of robust optimal solutions, i. Comparison of approximations in stochastic and robust. This textbook provides a first course in stochastic programming suitable for students with a basic knowledge of linear programming, elementary analysis, and probability. Distributionally robust stochastic programming siam. We also propose a tractable robust optimization approach for obtaining robust solutions to a class of stochastic linear optimization problems where the risk of infeasibility can be tolerated as a tradeoff to improve upon the objective value. Numerical experiments show that the robust approach results in larger objective function values. In the simplest theoretical formulation, you know the mean returns and covariance matrix of all the securities in your universe, so you can just do the optimization and get the right answe.
May 16, 2006 abstract in this paper, we introduce an approach for constructing uncertainty sets for robust optimization using new deviation measures for random variables termed the forward and backward deviations. This process is experimental and the keywords may be updated as the learning algorithm improves. The simplest example is markowitz portfolio optimization. Download for offline reading, highlight, bookmark or take. Although many ways have been proposed to model uncertain quantities, stochastic models have proved their. A tractable approximation of stochastic programming via robust optimization xin chen.
The book is highly illustrated with chapter summaries and many examples and exercises. Although this book mostly covers stochastic linear programming since that is the best developed topic, we also discuss stochastic nonlinear programming, integer programming and network. These deviation measures capture distributional asymmetry and lead to better approximations of chance constraints. Introduction to stochastic programming springer for. Theory and applications of robust optimization 465 textbooks 91, 40, 121, 93and the many references therein for a more comprehensive picture of so.
Robust portfolio optimization and management wiley. Robust optimization robust optimization is a field of optimization theory that deals with optimization problems in which a certain measure of robustness is sought against uncertainty that can be. Such models deal, in a constructive manner, with noisy, incomplete or uncertain data. Some of the problem parameters are estimates and carry estimation risk. Advances in stochastic programming and robust optimization for. Robust optimization refers to the modeling of optimization problems with data uncertainly. The aim of stochastic programming is to find optimal decisions in problems which involve uncertain data. Robust optimization models can be useful in the following situations.
On the performance of affine policies for twostage adaptive optimization. Moments of arbitrary order, as well as nonpolynomial moments can be included in the formulation. In this search, conference papers, notebook chapters, books, and short. The authors aim to present a broad overview of the main themes and methods of the subject. Stochastic linear programming and robust optimization models are. Robust optimization is an emerging area in research that allows addressing different optimization problems and specifically industrial optimization problems where there is a degree of uncertainty in some of the variables involved. Fabozzi, kolm, pachamanova, and focardi deserve high praise. Normally when you think of optimization, here are following things you can follow to improve the formulation of the problem. Robust optimization is an active area of research that is likely to find many practical applications in the future. We show that this gives rise to a hierarchy of optimization problems with decreasing levels of riskaversion, with classic robust optimization at one end of the spectrum, and stochastic programming at the other. Stochastic programming and robust optimization in addition to its high performance simulation optimization capabilities, risk solver platform implements two other technologies. Hows robust optimization and stochastic programming used.