Scenarios and Policy Aggregation in Optimization Under Uncertainty

  title={Scenarios and Policy Aggregation in Optimization Under Uncertainty},
  author={R. Tyrrell Rockafellar and Roger J.-B. Wets},
  journal={Math. Oper. Res.},
A common approach in coping with multiperiod optimization problems under uncertainty where statistical information is not really enough to support a stochastic programming model, has been to set up and analyze a number of scenarios. The aim then is to identify trends and essential features on which a robust decision policy can be based. This paper develops for the first time a rigorous algorithmic procedure for determining such a policy in response to any weighting of the scenarios. The… 

Assessing policy quality in multi-stage stochastic programming

Solving a multi-stage stochastic program with a large number of scenarios and a moderate-tolarge number of stages can be computationally challenging. We develop two Monte Carlo-based methods that

Stochastic network optimization models for investment planning

We describe and compare stochastic network optimization models for investment planning under uncertainty. Emphasis is placed on multiperiod a sset allocation and active portfolio management problems.

On multistage Stochastic Integer Programming for incorporating logical constraints in asset and liability management under uncertainty

We present a model for optimizing a mean-risk function of the terminal wealth for a fixed income asset portfolio restructuring with uncertainty in the interest rate path and the liabilities along a

Modeling Equilibria and Risk under Global Environmental Constraints

Policy makers are consistently in need of technical analysis to support decision making. This is particularly true in the environmental area due to the variety of paradigms that must be integrated to

Stochastic Programming and Robust Optimization

This chapter presents prescriptive approaches to problems of sensitivity analysis and parametric programming and provides an introduction to stochastic programming and robust optimization models.

Robust Decision Making as a Decision Making Aid Under Uncertainty

A general modeling framework for robust optimization of linear programs with uncertainty in the values of the objective function coefficients and thevalues of the right-hand-side coefficients is presented and some ideas for problem solving are explored.

Financial planning via multi-stage stochastic optimization

The aggregation principle in scenario analysis stochastic optimization

Most systems that need to be controlled or analyzed involve some level of uncertainty about the value to assign to some of the parameters, if not about the actual layout of certain subcomponents of

A Class of stochastic programs with decision dependent uncertainty

This work presents a hybrid mixed-integer disjunctive programming formulation for the stochastic program corresponding to this class of problems and hence extends the Stochastic programming framework.

Optimising data-driven network under limited resource: a partial diversification approach

A cardinality constrained network flow structure whose special characteristics are used to analyse different risk aspects under an environment of uncertainty is described, and a Lagrangian bound is embedded to enhance the capacity of the method.



Generalized linear-quadratic problems of deterministic and stochastic optimal control in discrete time

Two fundamental classes of problems in large-scale linear and quadratic programming are described and strong properties of duality are revealed which support the development of iterative approximate techniques of solution in terms of saddlepoints.

Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming

The theory of the proximal point algorithm for maximal monotone operators is applied to three algorithms for solving convex programs, one of which has not previously been formulated and is shown to have much the same convergence properties, but with some potential advantages.

A Decomposition Method and Its Application to Convex Programming

A method is proposed for minimizing a function of the form q(x − d) + f1(x) + ⋯ + fm(x) where q is definite quadratic and fi are proper closed convex. The key feature of the method is its capability

Generalized equations and their solutions, Part I: Basic theory

We consider a class of “generalized equations,” involving point-to-set mappings, which formulate the problems of linear and nonlinear programming and of complementarity, among others. Solution sets

Monotone Operators and the Proximal Point Algorithm

For the problem of minimizing a lower semicontinuous proper convex function f on a Hilbert space, the proximal point algorithm in exact form generates a sequence $\{ z^k \} $ by taking $z^{k + 1} $

Applications of the method of partial inverses to convex programming: Decomposition

A primal–dual decomposition method is presented to solve the separable convex programming problem, equivalent to the proximal point algorithm applied to a certain maximal monotone multifunction.

Partial inverse of a monotone operator

ForT a maximal monotone operator on a Hilbert spaceH andA a closed subspace ofH, the “partial inverse”TA ofT with respect toA is introduced.TA is maximal monotone. The proximal point algorithm, as it

The Lions-Mercier splitting algorithm and the alternating direction method are instances of the proximal point algorithm

Suppose we have two maximal monotone operators A and B over a Hilbert space and wish to find a zero of the operator A+B. We introduce an auxiliary maximal monotone operator SAAB whose set of zeroes