A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs

✍ Scribed by Myun-Seok Cheon; Shabbir Ahmed; Faiz Al-Khayyal

• Publisher: Springer-Verlag
• Year: 2006
• Tongue: English
• Weight: 292 KB
• Volume: 108
• Category: Article
• ISSN: 0025-5610
• DOI: 10.1007/s10107-006-0725-5

✦ Synopsis

We consider probabilistically constrained linear programs with general distributions for the uncertain parameters. These problems involve non-convex feasible sets. We develop a branch-and-bound algorithm that searches for a global optimal solution to this problem by successively partitioning the nonconvex feasible region and by using bounds on the objective function to fathom inferior partition elements. This basic algorithm is enhanced by domain reduction and cutting plane strategies to reduce the size of the partition elements 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.