Abstract
We study a class of chance-constrained two-stage stochastic optimization problems where second-stage feasible recourse decisions incur additional cost. In addition, we propose a new model, where “recovery” decisions are made for the infeasible scenarios to obtain feasible solutions to a relaxed second-stage problem. We develop decomposition algorithms with specialized optimality and feasibility cuts to solve this class of problems. Computational results on a chance-constrained resource planing problem indicate that our algorithms are highly effective in solving these problems compared to a mixed-integer programming reformulation and a naive decomposition method.
Similar content being viewed by others
References
Benders, J.: Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4(1), 238–252 (1962)
Beraldi, P., Ruszczyński, A.: A branch and bound method for stochastic integer programs under probabilistic constraints. Optim. Methods Softw. 17, 359–382 (2002)
Beraldi, P., Ruszczyński, A.: The probabilistic set covering problem. Oper. Res. 50(6), 956–967 (2002)
Bertsimas, D., Brown, D.: Constructing uncertainty sets for robust linear optimization. Oper. Res. 57(6), 1483–1495 (2009)
Birge, J.R., Louveaux, F.V.: A multicut algorithm for two-stage stochastic linear programs. Eur. J. Oper. Res. 34(3), 384–392 (1988)
Calafiore, G., Campi, M.: Uncertain convex programs: randomized solutions and confidence levels. Math. Program. 102, 25–46 (2005)
Calafiore, G., Campi, M.: The scenario approach to robust control design. IEEE Trans. Automat. Control 51, 742–753 (2006)
Campi, M., Garatti, S.: A sampling-and-discarding approach to chance-constrained optimization: feasibility and optimality. J. Optim. Theory Appl. 148, 257–280 (2011)
Charnes, A., Cooper, W.: Deterministic equivalents for optimizing and satisficing under chance constraints. Oper. Res. 11, 18–39 (1963)
Charnes, A., Cooper, W., Symonds, G.: Cost horizons and certainty equivalents: an approach to stochastic programming of heating oil. Manag. Sci. 4, 235–263 (1958)
Dentcheva, D., Prékopa, A., Ruszczyński, A.: Concavity and efficient points of discrete distributions in probabilistic programming. Math. Program. 89, 55–77 (2000)
Küçükyavuz, S.: On mixing sets arising in chance-constrained programming. Math. Program. 132, 31–56 (2012)
Luedtke, J.: A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support. Math. Program. 146, 219–244 (2014)
Luedtke, J., Ahmed, S.: A sample approximation approach for optimization with probabilistic constraints. SIAM J. Optim. 19, 674–699 (2008)
Luedtke, J., Ahmed, S., Nemhauser, G.: An integer programming approach for linear programs with probabilistic constraints. Math. Program. 12, 247–272 (2010)
Miller, B.L., Wagner, H.M.: Chance constrained programming with joint constraints. Oper. Res. 13(6), 930–965 (1965)
Miller, N., Ruszczyński, A.: Risk-averse two-stage stochastic linear programming: modeling and decomposition. Oper. Res. 59(1), 125–132 (2011)
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)
Noyan, N.: Risk-averse two-stage stochastic programming with an application to disaster management. Comput. Oper. Res. 39(3), 541–559 (2012)
Prékopa, A.: Contributions to the theory of stochastic programming. Math. Program. 4, 202–221 (1973)
Prékopa, A.: Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution. ZOR Methods Models Oper. Res. 34, 441–461 (1990)
Ruszczyński, A.: Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra. Math. Program. 93, 195–215 (2002)
Saxena, A., Goyal, V., Lejeune, M.: MIP reformulations of the probabilistic set covering problem. Math. Program. 121, 1–31 (2009)
Sen, S.: Relaxations for probabilistically constrained programs with discrete random variables. Oper. Res. Lett. 11, 81–86 (1992)
Song, Y., Luedtke, J., Küçükyavuz, S.: Chance-constrained binary packing problems. INFORMS J. Comput. 26(4), 735–747 (2014)
Song, Y., Luedtke, J.R.: Branch-and-cut approaches for chance-constrained formulations of reliable network design problems. Math. Program. Comput. 5(4), 397–432 (2013)
Takriti, S., Ahmed, S.: On robust optimization of two-stage systems. Math. Program. 99, 109–126 (2004)
Van Slyke, R., Wets, R.J.: L-shaped linear programs with applications to optimal control and stochastic programming. SIAM J. Appl. Math. 17, 638–663 (1969)
Wang, J., Shen, S.: Risk and energy consumption tradeoffs in cloud computing service via stochastic optimization models. In: Proceedings of the 5th IEEE/ACM International Conference on Utility and Cloud Computing (UCC 2012). Chicago, IL (2012)
Wang, S., Guan, Y., Wang, J.: A chance-constrained two-stage stochastic program for unit commitment with uncertain wind power output. IEEE Trans. Power Syst. 27, 206–215 (2012)
Zeng, B., An, Y., Kuznia, L.: Chance constrained mixed integer program: bilinear and linear formulations, and Benders decomposition. Optimization Online (2014). http://www.optimization-online.org/DB_FILE/2014/03/4295.pdf
Zhang, M., Küçükyavuz, S., Goel, S.: A branch-and-cut method for dynamic decision making under joint chance constraints. Manag. Sci. 60(5), 1317–1333 (2014)
Acknowledgments
We are grateful to the two anonymous referees and Dave Morton for their comments on an earlier version.
Author information
Authors and Affiliations
Corresponding author
Additional information
Simge Küçükyavuz and Xiao Liu are supported by the National Science Foundation (NSF) under Grant CMMI-1055668.
James Luedtke is supported by NSF under Grant CMMI-0952907 and by the Applied Mathematics activity, Advance Scientific Computing Research program within the DOE Office of Science under a contract from Argonne National Laboratory.
Rights and permissions
About this article
Cite this article
Liu, X., Küçükyavuz, S. & Luedtke, J. Decomposition algorithms for two-stage chance-constrained programs. Math. Program. 157, 219–243 (2016). https://doi.org/10.1007/s10107-014-0832-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-014-0832-7