Improved integer programming approaches for chance-constrained stochastic programming

Authors:
Hiroki Yanagisawa;Takayuki Osogami
Affiliations:
IBM Research, Tokyo, Japan;IBM Research, Tokyo, Japan
Venue:
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Year:
2013

Citing 8
Cited 1

The Probabilistic Set-Covering Problem

Operations Research
A Sample Approximation Approach for Optimization with Probabilistic Constraints

SIAM Journal on Optimization
An Efficient Trajectory Method for Probabilistic Production-Inventory-Distribution Problems

Operations Research
An integer programming approach for linear programs with probabilistic constraints

Mathematical Programming: Series A and B
Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions

Operations Research
An integer programming and decomposition approach to general chance-constrained mathematical programs

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
On mixing sets arising in chance-constrained programming

Mathematical Programming: Series A and B
Planning under partial observability by classical replanning: theory and experiments

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three

Integer feasibility of random polytopes: random integer programs

Proceedings of the 5th conference on Innovations in theoretical computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Chance-Constrained Stochastic Programming (CCSP) is one of the models for decision making under uncertainty. In this paper, we consider the special case of the CCSP in which only the right-hand side vector is random with a discrete distribution having a finite support. The unit commitment problem is one of the applications of the special case of the CCSP. Existing methods for exactly solving the CCSP problems require an enumeration of scenarios when they model a CCSP problem using a Mixed Integer Programming (MIP). We show how to reduce the number of scenarios enumerated in the MIP model. In addition, we give another compact MIP formulation to approximately solve the CCSP problems.