Scalable Heuristics for a Class of Chance-Constrained Stochastic Programs

Authors:
Jean-Paul Watson;Roger J-B Wets;David L. Woodruff
Affiliations:
Discrete Math and Complex Systems Department, Sandia National Laboratories, Albuquerque, New Mexico 87185;Department of Mathematics, University of California, Davis, Davis, California 95616;Graduate School of Management, University of California, Davis, Davis, California 95616
Venue:
INFORMS Journal on Computing
Year:
2010

Citing 7
Cited 1

Scenarios and policy aggregation in optimization under uncertainty

Mathematics of Operations Research
Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs

Annals of Operations Research - Special issue on sensitivity analysis and optimization of discrete event systems
The Minimization of Semicontinuous Functions: Mollifier Subgradients

SIAM Journal on Control and Optimization
A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems

Management Science
On the Generality of Event-Graph Models

INFORMS Journal on Computing
Convex Approximations of Chance Constrained Programs

SIAM Journal on Optimization
A Sample Approximation Approach for Optimization with Probabilistic Constraints

SIAM Journal on Optimization

The Express heuristic for probabilistically constrained integer problems

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe computational procedures for solving a wide-ranging class of stochastic programs with chance constraints where the random components of the problem are discretely distributed. Our procedures are based on a combination of Lagrangian relaxation and scenario decomposition, which we solve using a novel variant of Rockafellar and Wets' progressive hedging algorithm [Rockafellar, R. T., R. J.-B. Wets. 1991. Scenarios and policy aggregation in optimization under uncertainty. Math. Oper. Res.16(1) 119--147]. Experiments demonstrate the ability of the proposed algorithm to quickly find near-optimal solutions---where verifiable---to both difficult and very large chance-constrained stochastic programs, both with and without integer decision variables. The algorithm exhibits strong scalability in terms of both run time required and final solution quality on large-scale instances.