Article ID: | iaor20031182 |
Country: | United Kingdom |
Volume: | 17 |
Issue: | 3 |
Start Page Number: | 359 |
End Page Number: | 382 |
Publication Date: | May 2002 |
Journal: | Optimization Methods & Software |
Authors: | Ruszczyski Andrzej, Beraldi Patrizia |
Keywords: | programming: probabilistic |
Stochastic integer programming problems under probabilistic constraints are considered. Deterministic equivalent formulations of the original problem are obtained by using p-efficient points of the distribution function of the right hand side vector. A branch and bound solution method is proposed based on a partial enumeration of the set of these points. The numerical experience with the probabilistic lot-sizing problem shows the potential of the solution approach and the efficiency of the algorithms implemented.