Optimization Online


On a class of stochastic programs with exponentially many scenarios

Gustavo Angulo(gangulo***at***ing.puc.cl)

Abstract: We consider a class of stochastic programs whose uncertain data has an exponential number of possible outcomes, where scenarios are affinely parametrized by the vertices of a tractable binary polytope. Under these conditions, we propose a novel formulation that introduces a modest number of additional variables and a class of inequalities that can be efficiently separated. Moreover, when the underlying polytope is the unit hypercube, we present an extended formulation of polynomial size that can be solved directly with off--the--shelf optimization software. We assess the advantages and limitations of our formulation through a computational study.

Keywords: Stochastic programming, Chance constraints, Exponential scenarios

Category 1: Stochastic Programming

Category 2: Integer Programming ((Mixed) Integer Linear Programming )

Category 3: Combinatorial Optimization (Polyhedra )

Citation: Department of Industrial and Systems Engineering, Pontificia Universidad Católica de Chile

Download: [PDF]

Entry Submitted: 04/01/2020
Entry Accepted: 04/02/2020
Entry Last Modified: 04/01/2020

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society