AN EXACT APPROACH FOR SOLVING INTEGER PROBLEMS UNDER PROBABILISTIC CONSTRAINTS WITH RANDOM TECHNOLOGY MATRIX

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.