Abstract
Linear programs with joint probabilistic constraints (PCLP) are difficult to solve because the feasible region is not convex. We consider a special case of PCLP in which only the right-hand side is random and this random vector has a finite distribution. We give a mixed-integer programming formulation for this special case and study the relaxation corresponding to a single row of the probabilistic constraint. We obtain two strengthened formulations. As a byproduct of this analysis, we obtain new results for the previously studied mixing set, subject to an additional knapsack inequality. We present computational results which indicate that by using our strengthened formulations, instances that are considerably larger than have been considered before can be solved to optimality.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Prékopa A.: Probabilistic programming. In: Ruszczyński, A., Shapiro, A.(eds) Stochastic Programming. Handbooks Oper. Res. Management Sci., vol. 10, pp. 267–351. Elsevier, Amsterdam (2003)
Lejeune M.A., Ruszczyński A.: An efficient trajectory method for probabilistic inventory-production–distribution problems. Oper. Res. 55, 378–394 (2007)
Murr M.R., Prékopa A.: Solution of a product substitution problem using stochastic programming. In: Uryasev, S.P.(eds) Probabilistic Constrained Optimization: Methodology and Applications., pp. 252–271. Kluwer, Dordrecht (2000)
Henrion R., Li P., Möller A., Steinbach M.C., Wendt M., Wozny G.: Stochastic optimization for operating chemical processes under uncertainty. In: Grötschel, M., Krunke, S., Rambau, J.(eds) Online Optimization of Large Scale Systems, pp. 457–478. Springer, Heidelberg (2001)
Henrion R., Möller A.: Optimization of a continuous distillation process under random inflow rate. Comput. Math. Appl. 45, 247–262 (2003)
Takyi A.K., Lence B.J.: Surface water quality management using a multiple-realization chance constraint method. Water Resour. Res. 35, 1657–1670 (1999)
Bukszár J., Prékopa A.: Probability bounds with cherry trees. Math. Oper. Res. 26, 174–192 (2001)
Deák I.: Subroutings for computing normal probabilities of sets—computer experiments. Ann. Oper. Res. 100, 103–122 (2000)
Szántai T.: Improved bounds and simulation procedures on the value of the multivariate normal probability distribution function. Ann. Oper. Res. 100, 85–101 (2000)
Cheon M.S., Ahmed S., Al-Khayyal F.: A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs. Math. Program. 108, 617–634 (2006)
Dentcheva D., Prékopa A., Ruszczyński A.: Concavity and efficient points of discrete distributions in probabilistic programming. Math. Program. 89, 55–77 (2000)
Beraldi P., Ruszczyński A.: A branch and bound method for stochastic integer programs under probabilistic constraints. Optim. Methods Softw. 17, 359–382 (2002)
Atlason J., Epelman M.A., Henderson S.G.: Call center staffing with simulation and cutting plane methods. Ann. Oper. Res. 127, 333–358 (2004)
Calafiore G., Campi M.: The scenario approach to robust control design. IEEE Trans. Automat. Control 51, 742–753 (2006)
Henrion R., Römisch W.: Metric regularity and quantitative stability in stochastic programs with probabilistic constraints. Math. Program. 84, 55–88 (1999)
Henrion R., Römisch W.: Hölder and Lipschitz stability of solution sets in programs with probabilistic constraints. Math. Program. 100, 589–611 (2004)
Luedtke J., Ahmed S.: A sample approximation approach for optimization with probabilistic constraints. SIAM J. Opt. 19, 674–699 (2008)
Nemirovski A., Shapiro A.: Scenario approximation of chance constraints. In: Calafiore, G., Dabbene, F.(eds) Probabilistic and Randomized Methods for Design Under Uncertainty., pp. 3–48. Springer, London (2005)
Ruszczyński A.: Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra. Math. Program. 93, 195–215 (2002)
Günlük O., Pochet Y.: Mixing mixed-integer inequalities. Math. Program. 90, 429–457 (2001)
Atamtürk A., Nemhauser G.L., Savelsbergh M.W.P.: The mixed vertex packing problem. Math. Program. 89, 35–53 (2000)
Guan Y., Ahmed S., Nemhauser G.L.: Sequential pairing of mixed integer inequalities. Discrete Optim. 4, 21–39 (2007)
Miller A.J., Wolsey L.A.: Tight formulations for some simple mixed integer programs and convex objective integer programs. Math. Program. 98, 73–88 (2003)
Luedtke J., Ahmed S., Nemhauser G.: An integer programming approach for linear programs with probabilistic constraints. In: Fischetti, M., Williamson, D.(eds) IPCO 2007, Lecture Notes in Comput. Sci., pp. 410–423. Springer, Berlin (2007)
Luedtke, J.: Integer programming approaches to some non-convex and stochatic optimization problems. Ph.D. thesis, Georgia Institute of Technology, Atlanta, GA (2007). Available at http://etd.gatech.edu
Christof, T., Löbel, A.: Polyhedral representation transformation algorithm (PORTA) (1997). http://www.zib.de/Optimization/Software/Porta/
Van Vyve M.: The continuous mixing polyhedron. Math. Oper. Res. 30, 441–452 (2005)
Author information
Authors and Affiliations
Corresponding author
Additional information
This research has been supported in part by the National Science Foundation under grants DMI-0121495 and DMI-0522485.
Rights and permissions
About this article
Cite this article
Luedtke, J., Ahmed, S. & Nemhauser, G.L. An integer programming approach for linear programs with probabilistic constraints. Math. Program. 122, 247–272 (2010). https://doi.org/10.1007/s10107-008-0247-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-008-0247-4