Global Optimization of Probabilistically Constrained Linear Programs

We consider probabilistic constrained linear programs with general distributions for the uncertain parameters. These problems generally involve non-convex feasible sets. We develop a branch and bound algorithm that searches for a global solution to this problem by successively partitioning the non-convex feasible region and by using bounds on the objective function to fathom inferior partitions. This basic algorithm is enhanced by domain reduction and cutting plane strategies to reduce the size of the partitions and hence tighten bounds. The proposed branch-reduce-cut algorithm exploits the monotonicity properties inherent in the problem, and requires solving linear programming subproblems. We provide convergence proofs for the algorithm. Some illustrative numerical results involving problems with discrete distributions are presented.

• Type: Conference
• Year: 2006
• Where: CP
• Authors: Shabbir Ahmed
• Keywords: Algorithm, Artificial Intelligence, CP 2006, Non-convex Feasible Region, Non-convex Feasible Sets