A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems

Authors:
Guglielmo Lulli;Suvrajeet Sen
Affiliations:
-;-
Venue:
Management Science
Year:
2004

Citing 0
Cited 12

Fix and Relax Heuristic for a Stochastic Lot-Sizing Problem

Computational Optimization and Applications
On a stochastic sequencing and scheduling problem

Computers and Operations Research
A Stochastic Programming Approach to Power Portfolio Optimization

Operations Research
Stochastic Power Generation Unit Commitment in Electricity Markets: A Novel Formulation and a Comparison of Solution Methods

Operations Research
Cutting Planes for Multistage Stochastic Integer Programs

Operations Research
Dantzig-Wolfe Decomposition for Solving Multistage Stochastic Capacity-Planning Problems

Operations Research
A polynomial time algorithm for the stochastic uncapacitated lot-sizing problem with backlogging

IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Scalable Heuristics for a Class of Chance-Constrained Stochastic Programs

INFORMS Journal on Computing
Stochastic lot-sizing with backlogging: computational complexity analysis

Journal of Global Optimization
Optimizing the Societal Benefits of the Annual Influenza Vaccine: A Stochastic Programming Approach

Operations Research
On stochastic lot-sizing problems with random lead times

Operations Research Letters
Fix-and-Relax-Coordination for a multi-period location-allocation problem under uncertainty

Computers and Operations Research

Quantified Score

Hi-index	0.02

Visualization

Abstract

In this paper, we present a branch-and-price method to solve special structured multistage stochastic integer programming problems. We validate our method on two different versions of a multistage stochastic batch-sizing problem (SBSP). One version adopts a recourse formulation, and the other is based on probabilistic constraints. Our algorithmic approach is applicable to both formulations. Our computational results suggest that both classes of problems can be solved using relatively few nodes of a branch-and-price tree. The success of our approach calls for extensions in methodology as well as applications.