{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T04:33:10Z","timestamp":1768451590365,"version":"3.49.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2016,5,26]],"date-time":"2016-05-26T00:00:00Z","timestamp":1464220800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,5,26]],"date-time":"2016-05-26T00:00:00Z","timestamp":1464220800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-0952907"],"award-info":[{"award-number":["CMMI-0952907"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-AC02-06CH11357"],"award-info":[{"award-number":["DE-AC02-06CH11357"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1331426"],"award-info":[{"award-number":["1331426"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007297","name":"Office of Naval Research Global","doi-asserted-by":"publisher","award":["N00014-15-1-2078"],"award-info":[{"award-number":["N00014-15-1-2078"]}],"id":[{"id":"10.13039\/100007297","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1129871"],"award-info":[{"award-number":["1129871"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Fellowship from the Algorithms and Randomness Center at Georgia Tech"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s10107-016-1029-z","type":"journal-article","created":{"date-parts":[[2016,5,26]],"date-time":"2016-05-26T07:30:37Z","timestamp":1464247837000},"page":"51-81","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":54,"title":["Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs"],"prefix":"10.1007","volume":"162","author":[{"given":"Shabbir","family":"Ahmed","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Luedtke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongjia","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weijun","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,26]]},"reference":[{"key":"1029_CR1","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1016\/j.orl.2013.07.009","volume":"41","author":"S Ahmed","year":"2013","unstructured":"Ahmed, S.: A scenario decomposition algorithm for 0\u20131 stochastic programs. Oper. Res. Lett. 41, 555\u2013569 (2013)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"1029_CR2","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/opre.1120.1135","volume":"61","author":"S Ahmed","year":"2013","unstructured":"Ahmed, S., Papageorgiou, D.J.: Probabilistic set covering with correlations. Oper. Res. 61(2), 438\u2013452 (2013)","journal-title":"Oper. Res."},{"key":"1029_CR3","unstructured":"Bai, X., Sun, J., Sun, X., Zheng, X.: An alternating direction method for chance-constrained optimization problems with discrete distributions. \n                    http:\/\/www.optimization-online.org\/DB_FILE\/2012\/04\/3448.pdf\n                    \n                   (2012)"},{"issue":"6","key":"1029_CR4","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1287\/opre.50.6.956.345","volume":"50","author":"P Beraldi","year":"2002","unstructured":"Beraldi, P., Ruszczynski, A.: The probabilistic set-covering problem. Oper. Res. 50(6), 956\u2013967 (2002)","journal-title":"Oper. Res."},{"key":"1029_CR5","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-003-0499-y","volume":"102","author":"G Calafiore","year":"2005","unstructured":"Calafiore, G., Campi, M.: Uncertain convex programs: randomized solutions and confidence levels. Math. Program. 102, 25\u201346 (2005)","journal-title":"Math. Program."},{"key":"1029_CR6","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1109\/TAC.2006.875041","volume":"51","author":"G Calafiore","year":"2006","unstructured":"Calafiore, G., Campi, M.: The scenario approach to robust control design. IEEE Trans. Autom. Contr. 51, 742\u2013753 (2006)","journal-title":"IEEE Trans. Autom. Contr."},{"issue":"5","key":"1029_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1287\/inte.20.5.61","volume":"20","author":"JD Camm","year":"1990","unstructured":"Camm, J.D., Raturi, A.S., Tsubakitani, S.: Cutting big m down to size. Interfaces 20(5), 61\u201366 (1990)","journal-title":"Interfaces"},{"key":"1029_CR8","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0167-6377(98)00050-9","volume":"24","author":"CC Car\u00f8e","year":"1999","unstructured":"Car\u00f8e, C.C., Schultz, R.: Dual decomposition in stochastic integer programming. Oper. Res. Lett. 24, 37\u201345 (1999)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"1029_CR9","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s101070050106","volume":"86","author":"S Ceria","year":"1999","unstructured":"Ceria, S., Soares, J.: Convex programming for disjunctive convex optimization. Math. Program. 86(3), 595\u2013614 (1999)","journal-title":"Math. Program."},{"key":"1029_CR10","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1287\/opre.11.1.18","volume":"11","author":"A Charnes","year":"1963","unstructured":"Charnes, A., Cooper, W.W.: Deterministic equivalents for optimizing and satisficing under chance constraints. Oper. Res. 11, 18\u201339 (1963)","journal-title":"Oper. Res."},{"key":"1029_CR11","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1287\/mnsc.4.3.235","volume":"4","author":"A Charnes","year":"1958","unstructured":"Charnes, A., Cooper, W.W., Symonds, G.H.: Cost horizons and certainty equivalents: an approach to stochastic programming of heating oil. Manag. Sci. 4, 235\u2013263 (1958)","journal-title":"Manag. Sci."},{"issue":"6","key":"1029_CR12","doi-asserted-by":"publisher","first-page":"1180","DOI":"10.1080\/10556788.2013.871282","volume":"29","author":"W de Oliveira","year":"2014","unstructured":"de Oliveira, W., Sagastiz\u00e1bal, C.: Level bundle methods for oracles with on demand accuracy. Optim. Methods Softw. 29(6), 1180\u20131209 (2014)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"1029_CR13","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s10107-014-0809-6","volume":"148","author":"W de Oliveira","year":"2014","unstructured":"de Oliveira, W., Sagastiz\u00e1bal, C., Lemar\u00e9chal, C.: Convex proximal bundle methods in depth: a unified analysis for inexact oracles. Math. Program. 148(1), 241\u2013277 (2014)","journal-title":"Math. Program."},{"key":"1029_CR14","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/1-84628-095-8_2","volume-title":"Probabilistic and Randomized Methods for Design under Uncertainty","author":"D Dentcheva","year":"2006","unstructured":"Dentcheva, D.: Optimization Models with Probabilistic Constraints. In: Calafiore, G., Dabbene, F. (eds.) Probabilistic and Randomized Methods for Design under Uncertainty, pp. 49\u201397. Springer, London (2006)"},{"issue":"1","key":"1029_CR15","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s10107-012-0539-6","volume":"138","author":"D Dentcheva","year":"2013","unstructured":"Dentcheva, D., Martinez, G.: Regularization methods for optimization problems with probabilistic constraints. Math. Program. 138(1), 223\u2013251 (2013)","journal-title":"Math. Program."},{"key":"1029_CR16","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s10107-003-0496-1","volume":"101","author":"D Dentcheva","year":"2004","unstructured":"Dentcheva, D., R\u00f6misch, W.: Duality gaps in nonconvex stochastic optimization. Math. Program. 101, 515\u2013535 (2004)","journal-title":"Math. Program."},{"key":"1029_CR17","unstructured":"Henrion, R.: A critical note on empirical (sample average, Monte Carlo) approximation of solutions to chance constrained programs. In: H\u00f6mberg, D., Tr\u00f6ltzsch, F. (eds.) System Modeling and Optimization. 25th IFIP TC 7 Conference, CSMO 2011, Berlin, Germany, 12\u201316 September 2011, Revised Selected Papers, pp. 25\u201337. Springer, Berlin (2013)"},{"issue":"3","key":"1029_CR18","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1287\/moor.1120.0544","volume":"37","author":"R Henrion","year":"2012","unstructured":"Henrion, R., M\u00f6ller, A.: A gradient formula for linear chance constraints under Gaussian distribution. Math. Oper. Res. 37(3), 475\u2013488 (2012)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"1029_CR19","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1137\/040603929","volume":"16","author":"KC Kiwiel","year":"2006","unstructured":"Kiwiel, K.C.: A proximal bundle method with approximate subgradient linearizations. SIAM J. Optim. 16(4), 1007\u20131023 (2006)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1029_CR20","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10107-010-0385-3","volume":"132","author":"S K\u00fc\u00e7\u00fckyavuz","year":"2012","unstructured":"K\u00fc\u00e7\u00fckyavuz, S.: On mixing sets arising in chance-constrained programming. Math. Program. 132(1), 31\u201356 (2012)","journal-title":"Math. Program."},{"issue":"6","key":"1029_CR21","doi-asserted-by":"publisher","first-page":"1356","DOI":"10.1287\/opre.1120.1120","volume":"60","author":"MA Lejeune","year":"2012","unstructured":"Lejeune, M.A.: Pattern-based modeling and solution of probabilistically constrained optimization problems. Oper. Res. 60(6), 1356\u20131372 (2012)","journal-title":"Oper. Res."},{"issue":"3","key":"1029_CR22","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/PL00011429","volume":"90","author":"C Lemar\u00e9chal","year":"2001","unstructured":"Lemar\u00e9chal, C., Renaud, A.: A geometric study of duality gaps, with applications. Math. Program. 90(3), 399\u2013427 (2001)","journal-title":"Math. Program."},{"issue":"1","key":"1029_CR23","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10107-014-0832-7","volume":"157","author":"X Liu","year":"2014","unstructured":"Liu, X., K\u00fc\u00e7\u00fckyavuz, S., Luedtke, J.: Decomposition algorithms for two-stage chance-constrained programs. Math. Program. 157(1), 219\u2013243 (2014)","journal-title":"Math. Program."},{"issue":"1","key":"1029_CR24","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10107-013-0684-6","volume":"146","author":"J Luedtke","year":"2014","unstructured":"Luedtke, J.: A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support. Math. Program. 146(1), 219\u2013244 (2014)","journal-title":"Math. Program."},{"key":"1029_CR25","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1137\/070702928","volume":"19","author":"J Luedtke","year":"2008","unstructured":"Luedtke, J., Ahmed, S.: A sample approximation approach for optimization with probabilistic constraints. SIAM J. Optim. 19, 674\u2013699 (2008)","journal-title":"SIAM J. Optim."},{"key":"1029_CR26","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10107-008-0247-4","volume":"12","author":"J Luedtke","year":"2010","unstructured":"Luedtke, J., Ahmed, S., Nemhauser, G.L.: An integer programming approach for linear programs with probabilistic constraints. Math. Program. 12, 247\u2013272 (2010)","journal-title":"Math. Program."},{"issue":"11","key":"1029_CR27","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.1287\/mnsc.22.11.1195","volume":"22","author":"T Magnanti","year":"1976","unstructured":"Magnanti, T., Shapiro, J., Wagner, M.: Generalized linear programming solves the dual. Manag. Sci. 22(11), 1195\u20131203 (1976)","journal-title":"Manag. Sci."},{"key":"1029_CR28","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s10957-009-9523-6","volume":"142","author":"B Pagnoncelli","year":"2009","unstructured":"Pagnoncelli, B., Ahmed, S., Shapiro, A.: The sample average approximation method for chance constrained programming: theory and applications. J. Optim. Theory Appl. 142, 399\u2013416 (2009)","journal-title":"J. Optim. Theory Appl."},{"key":"1029_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-3087-7","volume-title":"Stochastic Programming","author":"A Pr\u00e9kopa","year":"1995","unstructured":"Pr\u00e9kopa, A.: Stochastic Programming. Kluwer, Dordrecht (1995)"},{"issue":"3","key":"1029_CR30","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1287\/ijoc.2013.0582","volume":"26","author":"F Qiu","year":"2014","unstructured":"Qiu, F., Ahmed, S., Dey, S.S., Wolsey, L.A.: Covering linear programming with violations. INFORMS J. Comput. 26(3), 531\u2013546 (2014)","journal-title":"INFORMS J. Comput."},{"key":"1029_CR31","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/BFb0120750","volume-title":"Stochastic Systems: Modeling, Identification and Optimization, II","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Nonanticipativity and L1-martingales in stochastic optimization problems. In: Wets, R.J.-B. (ed.) Stochastic Systems: Modeling, Identification and Optimization, II, pp. 170\u2013187. Springer, Berlin Heidelberg (1976)"},{"key":"1029_CR32","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718751","volume-title":"Lectures on Stochastic Programming: Modeling and Theory","author":"A Shapiro","year":"2009","unstructured":"Shapiro, A., Dentcheva, D., Ruszczy\u0144ski, A.: Lectures on Stochastic Programming: Modeling and Theory. SIAM, Philadelphia (2009)"},{"key":"1029_CR33","unstructured":"Slater, M.: Lagrange Multipliers Revisited. Technical report, Cowles Foundation for Research in Economics, Yale University (1959)"},{"issue":"4","key":"1029_CR34","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s12532-013-0058-3","volume":"5","author":"Y Song","year":"2013","unstructured":"Song, Y., Luedtke, J.: Branch-and-cut approaches for chance-constrained formulations of reliable network design problems. Math. Program. Comput. 5(4), 397\u2013432 (2013)","journal-title":"Math. Program. Comput."},{"issue":"4","key":"1029_CR35","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1287\/ijoc.2014.0595","volume":"26","author":"Y Song","year":"2014","unstructured":"Song, Y., Luedtke, J., K\u00fc\u00e7\u00fckyavuz, S.: Chance-constrained binary packing problems. INFORMS J. Comput. 26(4), 735\u2013747 (2014)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"1029_CR36","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s00186-014-0478-5","volume":"80","author":"W van Ackooij","year":"2014","unstructured":"van Ackooij, W.: Decomposition approaches for block-structured chance-constrained programs with application to hydro-thermal unit commitment. Math. Methods Oper. Res. 80(3), 227\u2013253 (2014)","journal-title":"Math. Methods Oper. Res."},{"key":"1029_CR37","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1287\/ijoc.1090.0372","volume":"22","author":"JP Watson","year":"2010","unstructured":"Watson, J.P., Wets, R.J.-B., Woodruff, D.L.: Scalable heuristics for a class of chance-constrained stochastic programs. INFORMS J. Comput. 22, 543\u2013554 (2010)","journal-title":"INFORMS J. Comput."},{"issue":"5","key":"1029_CR38","doi-asserted-by":"publisher","first-page":"1317","DOI":"10.1287\/mnsc.2013.1822","volume":"60","author":"M Zhang","year":"2014","unstructured":"Zhang, M., K\u00fc\u00e7\u00fckyavuz, S., Goel, S.: A branch-and-cut method for dynamic decision making under joint chance constraints. Manag. Sci. 60(5), 1317\u20131333 (2014)","journal-title":"Manag. Sci."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1029-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-016-1029-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1029-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1029-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T16:20:12Z","timestamp":1589646012000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-016-1029-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,26]]},"references-count":38,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["1029"],"URL":"https:\/\/doi.org\/10.1007\/s10107-016-1029-z","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,26]]},"assertion":[{"value":"5 March 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 May 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 May 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}