Abstract
This paper addresses integer programming problems under probabilistic constraints involving discrete distributions. Such problems can be reformulated as large scale integer problems with knapsack constraints. For their solution we propose a specialized Branch and Bound approach where the feasible solutions of the knapsack constraint are used as partitioning rules of the feasible domain. The numerical experience carried out on a set covering problem with random covering matrix shows the validity of the solution approach and the efficiency of the implemented algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Balas, E. (1983). A class of location, distribution and scheduling problems: modeling and solution methods. In P. Gray & L. Yuanzhang (Eds.), Proceedings of the Chinese—US symposium on systems analysis. New York: Wiley.
Balas, E. (1985). Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. SIAM Journal on Algebraic and Discrete Methods, 6, 466–486.
Beraldi, P., & Bruni, M. E. (2005). An exact approach for integer problems under probabilistic constraints with random technology matrix. ParcoLab Technical Report, Unical, Italy.
Beraldi, P., & Ruszczyński, A. (2002a). The probabilistic set covering problem. Operations Research, 50, 956–967.
Beraldi, P., & Ruszczyński, A. (2002b). A branch and bound method for stochastic integer problems under probabilistic constraints. Optimization Methods and Software, 17, 359–382.
Beraldi, P., Bruni, M. E., & Conforti, D. (2004). Designing robust emergency medical service via stochastic programming. European Journal of Operational Research, 158, 183–193.
Charnes, A., & Cooper, W. W. (1959). Chance-constrained programming. Management Science, 6, 73–89.
Cheon, M.-S., Ahmed, S., & Al-Khayyal, F. (2006). A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs. Mathematical Programming B, 108(2), 617–634.
Dentcheva, D., Prékopa, A., & Ruszczyński, A. (2000). Concavity and efficient points of discrete distributions in probabilistic programming. Mathematical Programming, 89, 55–77.
Dentcheva, D., Prékopa, A., & Ruszczyński, A. (2002). Bounds for probabilistic integer programming problems. Discrete Applied Mathematics, 124, 5–65.
Gaivoronski, A., & Pflug, G. (2005). Value-at-risk in portfolio optimization: properties and computational approach. The Journal of Risk, 7, 1–339.
Gendreau, M., Laporte, G., & Séguin, R. (1996). Stochastic vehicle routing. European Journal of Operational Research, 88, 3–12.
LINDO Systems Inc. LINDO API 2.0 and LINGO 8.0 http://www-lind.com/.
Owen, S. H., & Daskin, M. S. (1998). Strategic facility location: a review. European Journal of Operational Research, 111, 423–447.
Prékopa, A. (1990). Dual method for the solution of one-stage stochastic programming problem with random RHS obeying a discrete probability distribution. ZOR—Methods and Models of Operations Research, 34, 441–461.
Prékopa, A. (1993). Contributions to the theory of stochastic programming. Mathematical Programming, 4, 202–221.
Prékopa, A. (1995). Stochastic programming. Boston: Kluwer Scientific.
Ruszczyński, A. (2002). Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra. Mathematical Programming Ser. A, 93, 195–215.
Sen, S. (1992). Relaxation for probabilistically constrained programs with discrete random variables. Operations Research Letters, 11, 81–86.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Beraldi, P., Bruni, M.E. An exact approach for solving integer problems under probabilistic constraints with random technology matrix. Ann Oper Res 177, 127–137 (2010). https://doi.org/10.1007/s10479-009-0670-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-009-0670-9