{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,3]],"date-time":"2026-08-03T09:50:51Z","timestamp":1785750651976,"version":"3.56.0"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,5,16]],"date-time":"2018-05-16T00:00:00Z","timestamp":1526428800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,5,16]],"date-time":"2018-05-16T00:00:00Z","timestamp":1526428800000},"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":["1633196"],"award-info":[{"award-number":["1633196"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-18-1-207"],"award-info":[{"award-number":["N00014-18-1-207"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s10107-018-1295-z","type":"journal-article","created":{"date-parts":[[2018,5,16]],"date-time":"2018-05-16T09:28:39Z","timestamp":1526462919000},"page":"43-65","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["Relaxations and approximations of chance constraints under finite distributions"],"prefix":"10.1007","volume":"170","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7049-7305","authenticated-orcid":false,"given":"Shabbir","family":"Ahmed","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weijun","family":"Xie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,5,16]]},"reference":[{"issue":"1","key":"1295_CR1","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10107-016-0979-5","volume":"157","author":"A Abdi","year":"2016","unstructured":"Abdi, A., Fukasawa, R.: On the mixing set with a knapsack constraint. Math. Program. 157(1), 191\u2013217 (2016)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"1295_CR2","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s10107-016-1029-z","volume":"162","author":"S Ahmed","year":"2017","unstructured":"Ahmed, S., Luedtke, J., Song, Y., Xie, W.: Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs. Math. Program. 162(1\u20132), 51\u201381 (2017)","journal-title":"Math. Program."},{"key":"1295_CR3","first-page":"261","volume":"10","author":"S Ahmed","year":"2008","unstructured":"Ahmed, S., Shapiro, A.: Solving chance-constrained stochastic programs via sampling and integer programming. Tutor. Oper. Res. (INFORMS) 10, 261\u2013269 (2008)","journal-title":"Tutor. Oper. Res. (INFORMS)"},{"issue":"9","key":"1295_CR4","doi-asserted-by":"publisher","first-page":"1261","DOI":"10.1287\/mnsc.1040.0201","volume":"50","author":"GJ Alexander","year":"2004","unstructured":"Alexander, G.J., Baptista, A.M.: A comparison of var and cvar constraints on portfolio selection with the mean-variance model. Manag. Sci. 50(9), 1261\u20131273 (2004)","journal-title":"Manag. Sci."},{"key":"1295_CR5","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s101070000154.","volume":"89","author":"A Atamt\u00fcrk","year":"2000","unstructured":"Atamt\u00fcrk, A., Nemhauser, G.L., Savelsbergh, M.W.P.: The mixed vertex packing problem. Math. Program. 89, 35\u201353 (2000)","journal-title":"Math. Program."},{"key":"1295_CR6","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050","volume-title":"Robust Optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust Optimization. Princeton University Press, Princeton (2009)"},{"issue":"3","key":"1295_CR7","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1080\/1055678021000033937","volume":"17","author":"P Beraldi","year":"2002","unstructured":"Beraldi, P., Ruszczy\u0144ski, A.: A branch and bound method for stochastic integer problems under probabilistic constraints. Optim. Methods Softw. 17(3), 359\u2013382 (2002)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"1295_CR8","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1137\/130910312","volume":"56","author":"D Bienstock","year":"2014","unstructured":"Bienstock, D., Chertkov, M., Harnett, S.: Chance-constrained optimal power flow: risk-aware network control under uncertainty. SIAM Rev. 56(3), 461\u2013495 (2014)","journal-title":"SIAM Rev."},{"key":"1295_CR9","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-003-0499-y","volume":"102","author":"GC Calafiore","year":"2005","unstructured":"Calafiore, G.C., Campi, M.C.: Uncertain convex programs: randomized solutions and confidence levels. Math. Program. 102, 25\u201346 (2005)","journal-title":"Math. Program."},{"issue":"5","key":"1295_CR10","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1109\/TAC.2006.875041","volume":"51","author":"GC Calafiore","year":"2006","unstructured":"Calafiore, G.C., Campi, M.C.: The scenario approach to robust control design. IEEE Trans. Autom. Control 51(5), 742\u2013753 (2006)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"3","key":"1295_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(3), 235\u2013263 (1958)","journal-title":"Manag. Sci."},{"key":"1295_CR12","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10107-016-0990-x","volume":"157","author":"Y Deng","year":"2016","unstructured":"Deng, Y., Shen, S.: Decomposition algorithm for optimizing multi-server appointment scheduling with chance constraints. Math. Program. 157, 245\u2013276 (2016)","journal-title":"Math. Program."},{"key":"1295_CR13","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/PL00011393","volume":"89","author":"D Dentcheva","year":"2000","unstructured":"Dentcheva, D., Pr\u00e9kopa, A., Ruszczynski, A.: Concavity and efficient points of discrete distributions in probabilistic programming. Math. Program. 89, 55\u201377 (2000)","journal-title":"Math. Program."},{"key":"1295_CR14","unstructured":"Goyal, V., Ravi, R.: Approximation algorithms for robust covering problems with chance constraints. \n                    http:\/\/repository.cmu.edu\/cgi\/viewcontent.cgi?article=1365&context=tepper\n                    \n                   (2008)"},{"issue":"3","key":"1295_CR15","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.orl.2010.01.003","volume":"38","author":"V Goyal","year":"2010","unstructured":"Goyal, V., Ravi, R.: A PTAS for the chance-constrained knapsack problem with random item sizes. Oper. Res. Lett. 38(3), 161\u2013164 (2010)","journal-title":"Oper. Res. Lett."},{"key":"1295_CR16","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.disopt.2006.10.003","volume":"4","author":"Y Guan","year":"2007","unstructured":"Guan, Y., Ahmed, S., Nemhauser, G.L.: Sequential pairing of mixed integer inequalities. Discrete Optim. 4, 21\u201339 (2007)","journal-title":"Discrete Optim."},{"key":"1295_CR17","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/PL00011430","volume":"90","author":"O G\u00fcnl\u00fck","year":"2001","unstructured":"G\u00fcnl\u00fck, O., Pochet, Y.: Mixing mixed-integer inequalities. Math. Program. 90, 429\u2013457 (2001)","journal-title":"Math. Program."},{"key":"1295_CR18","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, 31\u201356 (2012)","journal-title":"Math. Program."},{"issue":"4","key":"1295_CR19","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1287\/opre.2016.1493","volume":"64","author":"MA Lejeune","year":"2016","unstructured":"Lejeune, M.A., Margot, F.: Solving chance-constrained optimization problems with stochastic quadratic inequalities. Oper. Res. 64(4), 939\u2013957 (2016)","journal-title":"Oper. Res."},{"key":"1295_CR20","doi-asserted-by":"crossref","unstructured":"Liu, X., K\u0131l\u0131n\u00e7-Karzan, F., K\u00fc\u00e7\u00fckyavuz, S.: On intersection of two mixing sets with applications to joint chance-constrained programs. Math. Program. (2018). \n                    https:\/\/doi.org\/10.1007\/s10107-018-1231-2","DOI":"10.1007\/s10107-018-1231-2"},{"issue":"1","key":"1295_CR21","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10107-014-0832-7","volume":"157","author":"X Liu","year":"2016","unstructured":"Liu, X., K\u00fc\u00e7\u00fckyavuz, S., Luedtke, J.: Decomposition algorithms for two-stage chance-constrained programs. Math. Program. 157(1), 219\u2013243 (2016)","journal-title":"Math. Program."},{"key":"1295_CR22","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, 219\u2013244 (2014)","journal-title":"Math. Program."},{"issue":"2","key":"1295_CR23","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(2), 674\u2013699 (2008)","journal-title":"SIAM J. Optim."},{"key":"1295_CR24","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10107-008-0247-4","volume":"122","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. 122, 247\u2013272 (2010)","journal-title":"Math. Program."},{"key":"1295_CR25","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s10107-003-0397-3","volume":"98","author":"AJ Miller","year":"2003","unstructured":"Miller, A.J., Wolsey, L.A.: Tight formulations for some simple mixed integer programs and convex objective integer programs. Math. Program. 98, 73\u201388 (2003)","journal-title":"Math. Program."},{"key":"1295_CR26","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1016\/j.ejor.2011.11.006","volume":"219","author":"A Nemirovski","year":"2012","unstructured":"Nemirovski, A.: On safe tractable approximations of chance constraints. Eur. J. Oper. Res. 219, 707\u2013718 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"1295_CR27","first-page":"3","volume-title":"Probabilistic and Randomized Methods for Design Under Uncertainty","author":"A Nemirovski","year":"2005","unstructured":"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\u201348. Springer, London (2005)"},{"issue":"4","key":"1295_CR28","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1137\/050622328","volume":"17","author":"A Nemirovski","year":"2006","unstructured":"Nemirovski, A., Shapiro, A.: Convex approximations of chance constrained programs. SIAM J. Optim. 17(4), 969\u2013996 (2006)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1295_CR29","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s10957-009-9523-6","volume":"142","author":"BK Pagnoncelli","year":"2009","unstructured":"Pagnoncelli, B.K., Ahmed, S., Shapiro, A.: Sample average approximation method for chance constrained programming: theory and applications. J. Optim. Theory Appl. 142(2), 399\u2013416 (2009)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"1295_CR30","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s10957-009-9523-6","volume":"142","author":"BK Pagnoncelli","year":"2009","unstructured":"Pagnoncelli, B.K., Ahmed, S., Shapiro, A.: Computational study of a chance constrained portfolio selection problem. J. Optim. Theory Appl. 142(2), 399\u2013416 (2009)","journal-title":"J. Optim. Theory Appl."},{"key":"1295_CR31","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1057\/s41274-017-0197-4","volume":"69","author":"K Pavlikov","year":"2018","unstructured":"Pavlikov, K., Veremyev, A., Pasiliao, E.L.: Optimization of value-at-risk: computational aspects of mip formulations. J. Oper. Res. Soc. 69, 127\u2013141 (2018)","journal-title":"J. Oper. Res. Soc."},{"key":"1295_CR32","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01423332","volume":"33","author":"J Pinter","year":"1989","unstructured":"Pinter, J.: Deterministic approximations of probability inequalities. ZOR Methods Models Oper. Res. 33, 219\u2013239 (1989)","journal-title":"ZOR Methods Models Oper. Res."},{"key":"1295_CR33","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. Springer, Berlin (1995)"},{"issue":"3","key":"1295_CR34","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":"1295_CR35","doi-asserted-by":"publisher","first-page":"21","DOI":"10.21314\/JOR.2000.038","volume":"2","author":"RT Rockafellar","year":"2000","unstructured":"Rockafellar, R.T., Uryasev, S.: Optimization of conditional value-at-risk. J. Risk 2, 21\u201342 (2000)","journal-title":"J. Risk"},{"key":"1295_CR36","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139003858","volume-title":"Convex Bodies: The Brunn\u2013Minkowski Theory","author":"R Schneider","year":"2013","unstructured":"Schneider, R.: Convex Bodies: The Brunn\u2013Minkowski Theory, vol. 151. Cambridge University Press, Cambridge (2013)"},{"key":"1295_CR37","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, vol. 9. SIAM, Philadelphia (2009)"},{"issue":"2","key":"1295_CR38","first-page":"128","volume":"42","author":"T Shiina","year":"1999","unstructured":"Shiina, T.: Numerical solution technique for joint chance-constrained programming problem: an application to electric power capacity expansion. J. Oper. Res. Soc. Jpn. 42(2), 128\u2013140 (1999)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"1295_CR39","doi-asserted-by":"crossref","unstructured":"Snyder, L.V., Daskin, M.S: Models for reliable supply chain network design. In: Murray, A.T., Grubesic, T.H. (eds.) Critical Infrastructure, pp. 257\u2013289. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-68056-7_13"},{"key":"1295_CR40","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, 735\u2013747 (2014)","journal-title":"INFORMS J. Comput."},{"key":"1295_CR41","doi-asserted-by":"crossref","unstructured":"Swamy, C.: Risk-averse stochastic optimization: probabilistically-constrained models and algorithms for black-box distributions. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms. pp. 1627\u20131646. SIAM (2011)","DOI":"10.1137\/1.9781611973082.126"},{"issue":"5","key":"1295_CR42","doi-asserted-by":"publisher","first-page":"1657","DOI":"10.1029\/98WR02771","volume":"35","author":"AK Takyi","year":"1999","unstructured":"Takyi, A.K., Lence, B.J.: Surface water quality management using a multiple-realization chance constraint method. Water Resour. Res. 35(5), 1657\u20131670 (1999)","journal-title":"Water Resour. Res."},{"issue":"2","key":"1295_CR43","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/j.ijpe.2004.11.012","volume":"100","author":"S Talluri","year":"2006","unstructured":"Talluri, S., Narasimhan, R., Nair, A.: Vendor performance with supply risk: a chance-constrained dea approach. Int. J. Prod. Econ. 100(2), 212\u2013222 (2006)","journal-title":"Int. J. Prod. Econ."},{"key":"1295_CR44","doi-asserted-by":"crossref","unstructured":"van Ackooij, W., Zorgati, R., Henrion, R., M\u00f6ller, A.: Chance constrained programming and its applications to energy management. In: Dritsas I. (ed.) Stochastic Optimization\u2014Seeing the Optimal for the Uncertain. InTech (2011)","DOI":"10.5772\/15438"},{"key":"1295_CR45","unstructured":"Xie, W., Ahmed, S.: Bicriteria approximation of chance constrained covering problems. Submitted for publication, Preprint available at Optimization Online (2018)"},{"key":"1295_CR46","doi-asserted-by":"publisher","first-page":"1860","DOI":"10.1109\/TPWRS.2017.2725581","volume":"33","author":"W Xie","year":"2018","unstructured":"Xie, W., Ahmed, S.: Distributionally robust chance constrained optimal power flow with renewables: a conic reformulation. IEEE Trans. Power Syst. 33, 1860 (2018). (To appear)","journal-title":"IEEE Trans. Power Syst."},{"key":"1295_CR47","doi-asserted-by":"publisher","unstructured":"Xie, W., Ahmed, S.: On quantile cuts and their closure for chance constrained optimization problems. Math. Program. (2017). \n                    https:\/\/doi.org\/10.1007\/s10107-017-1190-z","DOI":"10.1007\/s10107-017-1190-z"},{"issue":"5","key":"1295_CR48","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."},{"issue":"1\u20132","key":"1295_CR49","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10107-016-1103-6","volume":"166","author":"M Zhao","year":"2017","unstructured":"Zhao, M., Huang, K., Zeng, B.: A polyhedral study on chance constrained program with random right-hand side. Math. Program. 166(1\u20132), 19\u201364 (2017)","journal-title":"Math. Program."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-018-1295-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1295-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1295-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T16:23:52Z","timestamp":1589646232000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-018-1295-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,16]]},"references-count":49,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["1295"],"URL":"https:\/\/doi.org\/10.1007\/s10107-018-1295-z","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,16]]},"assertion":[{"value":"28 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 May 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}