This paper develops a solution strategy for two-stage stochastic programs with integer recourse. The proposed methodology relies on approximating the underlying stochastic program via sampling, and solving the approximate problem via a specialized optimization algorithm. We show that the proposed scheme will produce an optimal solution to the true problem with probability approaching one exponentially fast as the sample size is increased. For fixed sample size, we describe statistical and deterministic bounding techniques to validate the quality of a candidate optimal solution. Preliminary computational experience with the method is reported.
Citation
Submitted for publication. Technical Report, School of Industrial & Systems Engineering, Georgia Institute of Technology.