A Hybrid Benders’ Decomposition Method for Solving Stochastic Constraint Programs with Linear Recourse
We adopt Benders’ decomposition algorithm to solve scenario-based Stochastic Constraint Programs (SCPs) with linear recourse. Rather than attempting to solve SCPs via a monolithic model, we show that one can iteratively solve a collection of smaller sub-problems and arrive at a solution to the entire problem. In this approach, decision variables corresponding to the initial stage and linear recourse actions are grouped into two sub-problems. The sub-problem corresponding to the recourse action further decomposes into independent problems, each of which is a representation of a single scenario. Our computational experience on stochastic versions of the well-known template design and warehouse location problems shows that, for linear recourse SCPs, Benders’ decomposition algorithm provides a very efficient solution method.
KeywordsConstraint Program Master Problem Chance Constraint News Vendor Problem Stochastic Constraint
Unable to display preview. Download preview PDF.
- 8.ILOG Inc.: OPL Studio 3.7, Studio User’s Manual (2003)Google Scholar
- 12.Manandhar, S., Tarim, S.A., Walsh, T.: Scenario-Based Stochastic Constraint Programming. In: Proceedings of IJCAI-2003, Acapulco, Mexico, pp. 257–262 (2003)Google Scholar
- 15.Tarim, S.A., Manandhar, S., Walsh, T.: Stochastic Constraint Programming: A Scenario-Based Approach. Constraints 11(1) (2006)Google Scholar