A heuristic procedure for stochastic integer programs with complete recourse

A heuristic procedure for stochastic integer programs with complete recourse

0.00 Avg rating0 Votes
Article ID: iaor2007966
Country: Netherlands
Volume: 171
Issue: 3
Start Page Number: 879
End Page Number: 890
Publication Date: Jun 2006
Journal: European Journal of Operational Research
Authors: ,
Keywords: heuristics, programming: integer
Abstract:

In this paper, we propose a successive approximation heuristic which solves large stochastic mixed-integer programming problem with complete fixed recourse. We refer to this method as the Scenario Updating Method, since it solves the problem by considering only a subset of scenarios which is updated at each iteration. Only those scenarios which imply a significant change in the objective function are added. The algorithm is terminated when no such scenarios are available to enter in the current scenario subtree. Several rules to select scenarios are discussed. Bounds on heuristic solutions are computed by relaxing some of the non-anticipativity constraints. The proposed procedure is tested on a multistage stochastic batch-sizing problem.

Reviews

Required fields are marked *. Your email address will not be published.