Holger Heitsch

Scenario Reduction Algorithms in Stochastic Programming

We consider convex stochastic programs with an (approximate) initial probability distribution P having finite support supp P, i.e., finitely many scenarios. The behaviour of such stochastic programs is stable with respect to perturbations of P measured in terms of a Fortet-Mourier probability metric. The problem of optimal scenario reduction consists in determining a probability measure that is supported by a subset of supp P of prescribed cardinality and is closest to P in terms of such a probability metric. Two new versions of forward and backward type algorithms are presented for computing such optimally reduced probability measures approximately. Compared to earlier versions, the computational performance (accuracy, running time) of the new algorithms has been improved considerably. Numerical experience is reported for different instances of scenario trees with computable optimal lower bounds. The test examples also include a ternary scenario tree representing the weekly electrical load process in a power management model.

Scenario reduction and scenario tree construction for power management problems

Portfolio and risk management problems of power utilities may be modeled by multistage stochastic programs. These models use a set of scenarios and corresponding probabilities to model the multivariate random data process (electrical load, stream flows to hydro units, and fuel and electricity prices). For most practical problems the optimization problem that contains all possible scenarios is too large. Due to computational complexity and to time limitations this program is often approximated by a model involving a (much) smaller number of scenarios. The proposed reduction algorithms determine a subset of the initial scenario set and assign new probabilities to the preserved scenarios. The scenario tree construction algorithms successively reduce the number of nodes of a fan of individual scenarios by modifying the tree structure and by bundling similar scenarios. Numerical experience is reported for constructing scenario trees for the load and spot market prices entering a stochastic portfolio management model of a German utility.

Scenario tree modeling for multistage stochastic programs

An important issue for solving multistage stochastic programs consists in the approximate representation of the (multivariate) stochastic input process in the form of a scenario tree. In this paper, we develop (stability) theory-based heuristics for generating scenario trees out of an initial set of scenarios. They are based on forward or backward algorithms for tree generation consisting of recursive scenario reduction and bundling steps. Conditions are established implying closeness of optimal values of the original process and its tree approximation, respectively, by relying on a recent stability result in Heitsch, Römisch and Strugarek (SIAM J Optim 17:511–525, 2006) for multistage stochastic programs. Numerical experience is reported for constructing multivariate scenario trees in electricity portfolio management.

Scenario tree reduction for multistage stochastic programs

A framework for the reduction of scenario trees as inputs of (linear) multistage stochastic programs is provided such that optimal values and approximate solution sets remain close to each other. The argument is based on upper bounds of the Lr-distance and the filtration distance, and on quantitative stability results for multistage stochastic programs. The important difference from scenario reduction in two-stage models consists in incorporating the filtration distance. An algorithm is presented for selecting and removing nodes of a scenario tree such that a prescribed error tolerance is met. Some numerical experience is reported.

A note on scenario reduction for two-stage stochastic programs

We extend earlier work on scenario reduction by relying directly on Fortet-Mourier metrics instead of using upper bounds given in terms of mass transportation problems. The importance of Fortet-Mourier metrics for quantitative stability of two-stage models is reviewed and some numerical results are also provided.

Generation of multivariate scenario trees to model stochasticity in power management

Modern electricity portfolio and risk management models represent multistage stochastic programs. The input of such programs consists in a finite set of scenarios having the form of a scenario tree. They model the probabilistic information on random data (electrical load, stream flows to hydro units, market prices of fuel and electricity). Since the corresponding deterministic equivalents of multistage stochastic programs are mostly large scale, one has to find significant tree-structured scenarios. Our approach to generate multivariate scenario trees is based on recursive deletion and bundling of scenarios out of some given (possibly large) scenario set originating from historical or simulated data. The procedure makes use of certain Monge-Kantorovich transportation distances for multivariate probability distributions. We report on computational results for generating load-inflow scenario trees based on realistic data of EDF Electricite de France.

Scenario tree modelling for multistage stochastic programs

An important issue for solving multistage stochastic programs consists in the approximate representation of the (multivariate) stochastic input process in the form of a scenario tree. In this paper, forward and backward approaches are developed for generating scenario trees out of an initial fan of individual scenarios. Both approaches are motivated by the recent stability result in [15] for optimal values of multistage stochastic programs. They are based on upper bounds for the two relevant ingredients of the stability estimate, namely, the probabilistic and the filtration distance, respectively. These bounds allow to control the process of recursive scenario reduction [13] and branching. Numerical experience is reported for constructing multivariate scenario trees in electricity portfolio management.

Stochastic Optimization of Electricity Portfolios: Scenario Tree Modeling and Risk Management

We present recent developments in the field of stochastic programming with regard to application in power management. In particular, we discuss issues of scenario tree modeling, that is, appropriate discrete approximations of the underlying stochastic parameters. Moreover, we suggest risk avoidance strategies via the incorporation of so-called polyhedral risk functionals into stochastic programs. This approach, motivated through tractability of the resulting problems, is a constructive framework providing particular flexibility with respect to the dynamic aspects of risk.

Stability and Scenario Trees for Multistage Stochastic Programs

By extending the stability analysis of Heitsch et al. (2006) for multistage stochastic programs we show that their (approximate) solution sets behave stable with respect to the sum of an

Scenario Tree Approximation and Risk Aversion Strategies for Stochastic Optimization of Electricity Production and Trading

L_r