{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T17:21:54Z","timestamp":1763140914766,"version":"3.37.3"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2016,12,31]],"date-time":"2016-12-31T00:00:00Z","timestamp":1483142400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,12,31]],"date-time":"2016-12-31T00:00:00Z","timestamp":1483142400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000179","name":"NSF Office of the Director","doi-asserted-by":"publisher","award":["1235135"],"award-info":[{"award-number":["1235135"]}],"id":[{"id":"10.13039\/100000179","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s10107-016-1103-6","type":"journal-article","created":{"date-parts":[[2016,12,31]],"date-time":"2016-12-31T09:01:41Z","timestamp":1483174901000},"page":"19-64","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["A polyhedral study on chance constrained program with random right-hand side"],"prefix":"10.1007","volume":"166","author":[{"given":"Ming","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Kai","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Bo","family":"Zeng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,31]]},"reference":[{"issue":"1","key":"1103_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":"2","key":"1103_CR2","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/s10957-016-0943-9","volume":"170","author":"L Adam","year":"2016","unstructured":"Adam, L., Branda, M.: Nonlinear chance constrained problems: optimality conditions, regularization and solvers. J. Optim. Theor. Appl. 170(2), 419\u2013436 (2016)","journal-title":"J. Optim. Theor. Appl."},{"issue":"1","key":"1103_CR3","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(1), 35\u201353 (2000)","journal-title":"Math. Program."},{"issue":"3","key":"1103_CR4","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/PL00011380","volume":"88","author":"A Ben-Tal","year":"2000","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust solutions of linear programming problems contaminated with uncertain data. Math. Program. 88(3), 411\u2013424 (2000)","journal-title":"Math. Program."},{"issue":"1","key":"1103_CR5","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0377-2217(03)00351-5","volume":"158","author":"P Beraldi","year":"2004","unstructured":"Beraldi, P., Bruni, M.E., Conforti, D.: Designing robust emergency medical service via stochastic programming. Eur. J. Oper. Res. 158(1), 183\u2013193 (2004)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1103_CR6","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 programs under probabilistic constraints. Optim. Methods Softw. 17(3), 359\u2013382 (2002)","journal-title":"Optim. Methods Softw."},{"issue":"6","key":"1103_CR7","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., Ruszczy\u0144ski, A.: The probabilistic set covering problem. Oper. Res. 50(6), 956\u2013967 (2002)","journal-title":"Oper. Res."},{"issue":"2","key":"1103_CR8","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10957-010-9754-6","volume":"148","author":"MC Campi","year":"2011","unstructured":"Campi, M.C., Garatti, S.: A sampling-and-discarding approach to chance-constrained optimization: feasibility and optimality. J. Optim. Theory App. 148(2), 257\u2013280 (2011)","journal-title":"J. Optim. Theory App."},{"issue":"1","key":"1103_CR9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/PL00011393","volume":"89","author":"D Dentcheva","year":"2000","unstructured":"Dentcheva, D., Pr\u00e9kopa, A., Ruszczy\u0144ski, A.: Concavity and efficient points of discrete distributions in probabilistic programming. Math. Program. 89(1), 55\u201377 (2000)","journal-title":"Math. Program."},{"issue":"2","key":"1103_CR10","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/j.ejor.2014.06.045","volume":"240","author":"JF Ehmke","year":"2015","unstructured":"Ehmke, J.F., Campbell, A.M., Urban, T.L.: Ensuring service levels in routing problems with time windows and stochastic travel times. Eur. J. Oper. Res. 240(2), 539\u2013550 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"1103_CR11","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1287\/ijoc.10.4.427","volume":"10","author":"Z Gu","year":"1998","unstructured":"Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.: Lifted cover inequalities for 0\u20131 integer programs: computation. INFORMS J. Comp. 10(4), 427\u2013437 (1998)","journal-title":"INFORMS J. Comp."},{"issue":"1","key":"1103_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1023\/A:1009841107478","volume":"4","author":"Z Gu","year":"2000","unstructured":"Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.: Sequence independent lifting in mixed integer programming. J. Comb. Optim. 4(1), 109\u2013129 (2000)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"1103_CR13","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(1), 21\u201339 (2007)","journal-title":"Discrete Optim."},{"issue":"3","key":"1103_CR14","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.: Math. Program. 90(3), 429\u2013457 (2001)","journal-title":"Math. Program."},{"issue":"6","key":"1103_CR15","first-page":"1358","volume":"62","author":"GA Hanasusanto","year":"2016","unstructured":"Hanasusanto, G.A., Roitch, V., Kuhn, D., Wiesemann, W.: Ambiguous joint chance constraints under mean and dispersion information. Oper. Res. 62(6), 1358\u20131376 (2016)","journal-title":"Oper. Res."},{"issue":"4","key":"1103_CR16","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1080\/02331930701421046","volume":"56","author":"R Henrion","year":"2007","unstructured":"Henrion, R.: Structural properties of linear probabilistic constraints. Optimization 56(4), 425\u2013440 (2007)","journal-title":"Optimization"},{"issue":"3","key":"1103_CR17","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":"2","key":"1103_CR18","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10589-007-9105-1","volume":"41","author":"R Henrion","year":"2008","unstructured":"Henrion, R., Strugarek, C.: Convexity of chance constraints with independent random variables. Comput. Optim. Appl. 41(2), 263\u2013276 (2008)","journal-title":"Comput. Optim. Appl."},{"key":"1103_CR19","unstructured":"High Performance Computing Center. \n                    http:\/\/www.hpcc.ttu.edu\/\n                    \n                  . Accessed April 2016"},{"issue":"3","key":"1103_CR20","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1287\/opre.1100.0910","volume":"59","author":"LJ Hong","year":"2011","unstructured":"Hong, L.J., Yang, Y., Zhang, L.: Sequential convex approximations to joint chance constrained programs: a Monte Carlo approach. Oper. Res. 59(3), 617\u2013630 (2011)","journal-title":"Oper. Res."},{"issue":"1\u20132","key":"1103_CR21","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10107-013-0728-y","volume":"147","author":"A Kogan","year":"2014","unstructured":"Kogan, A., Lejeune, M.: Threshold boolean form for joint probabilistic constraints with random technology matrix. Math. Program. 147(1\u20132), 391\u2013427 (2014)","journal-title":"Math. Program."},{"issue":"1","key":"1103_CR22","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":"1","key":"1103_CR23","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10107-015-0953-7","volume":"159","author":"S K\u00fc\u00e7\u00fckyavuz","year":"2016","unstructured":"K\u00fc\u00e7\u00fckyavuz, S., Noyan, N.: Cut generation for optimization problems with multivariate risk constraints. Math. Program. 159(1), 165\u2013199 (2016)","journal-title":"Math. Program."},{"issue":"6","key":"1103_CR24","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":"2","key":"1103_CR25","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1016\/j.ejor.2010.05.025","volume":"207","author":"M Lejeune","year":"2010","unstructured":"Lejeune, M., Noyan, N.: Mathematical programming approaches for generating $$p$$-efficient points. Eur. J. Oper. Res. 207(2), 590\u2013600 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"1103_CR26","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":"1103_CR27","doi-asserted-by":"crossref","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)","DOI":"10.1007\/s10107-014-0832-7"},{"issue":"1","key":"1103_CR28","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."},{"issue":"2","key":"1103_CR29","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.: An integer programming approach for linear programs with probabilistic constraints. Math. Program. 122(2), 247\u2013272 (2010)","journal-title":"Math. Program."},{"issue":"1","key":"1103_CR30","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(1), 73\u201388 (2003)","journal-title":"Math. Program."},{"issue":"4","key":"1103_CR31","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":"6","key":"1103_CR32","first-page":"441","volume":"34","author":"A Pr\u00e9kopa","year":"1990","unstructured":"Pr\u00e9kopa, A.: Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution. Z. Oper. Res. 34(6), 441\u2013461 (1990)","journal-title":"Z. Oper. Res."},{"key":"1103_CR33","first-page":"267","volume-title":"Stochastic Programming, Handbooks in Operations Research and Management Science","author":"A Pr\u00e9kopa","year":"2003","unstructured":"Pr\u00e9kopa, A.: Probabilistic programming. In: Ruszczy\u0144ski, A., Shapiro, A. (eds.) Stochastic Programming, Handbooks in Operations Research and Management Science, vol. 10, pp. 267\u2013351. Elsevier, Amsterdam (2003)"},{"issue":"3","key":"1103_CR34","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1287\/ijoc.2013.0582","volume":"26","author":"F Qiu","year":"2014","unstructured":"Qiu, F., Shabbir, A., Dey, S.D., Wolsey, L.A.: Covering linear programming with violations. INFORMS J. Comp. 26(3), 531\u2013546 (2014)","journal-title":"INFORMS J. Comp."},{"issue":"3","key":"1103_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 valueat-risk. J. Risk 2(3), 21\u201341 (2000)","journal-title":"J. Risk"},{"issue":"2","key":"1103_CR36","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10107-002-0337-7","volume":"93","author":"A Ruszczy\u0144ski","year":"2002","unstructured":"Ruszczy\u0144ski, A.: Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra. Math. Program. 93(2), 195\u2013215 (2002)","journal-title":"Math. Program."},{"issue":"1","key":"1103_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-008-0224-y","volume":"121","author":"A Saxena","year":"2010","unstructured":"Saxena, A., Goyal, V., Lejeune, M.A.: MIP reformulations of the probabilistic set covering problem. Math. Program. 121(1), 1\u201331 (2010)","journal-title":"Math. Program."},{"issue":"2","key":"1103_CR38","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0167-6377(92)90037-4","volume":"11","author":"S Sen","year":"1992","unstructured":"Sen, S.: Relaxations for probabilistically constrained programs with discrete random variables. Oper. Res. Lett. 11(2), 81\u201386 (1992)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"1103_CR39","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.ejor.2010.04.019","volume":"207","author":"NW Tanner","year":"2010","unstructured":"Tanner, N.W., Ntaimo, L.: IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation. Eur. J. Oper. Res. 207(1), 290\u2013296 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"1103_CR40","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.cor.2016.08.002","volume":"77","author":"W van Ackooij","year":"2017","unstructured":"van Ackooij, W., Berge, V., De Oliveira, W., Sagastizabal, C.: Probabilistic optimization via approximate p-efficient points and bundle methods. Comput. Oper. Res. 77, 177\u2013193 (2017)","journal-title":"Comput. Oper. Res."},{"key":"1103_CR41","doi-asserted-by":"publisher","first-page":"1864","DOI":"10.1137\/130922689","volume":"24","author":"W van Ackooij","year":"2014","unstructured":"van Ackooij, W., Henrion, R.: Gradient formulae for nonlinear probabilistic constraints with Gaussian and Gaussian-like distributions. SIAM J. Optim. 24, 1864\u20131889 (2014)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1103_CR42","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.orl.2011.01.005","volume":"39","author":"W van Ackooij","year":"2011","unstructured":"van Ackooij, W., Henrion, R., Mller, A., Zorgati, R.: On joint probabilistic constraints with Gaussian coefficient matrix. Oper. Res. Lett. 39(2), 99\u2013102 (2011)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"1103_CR43","first-page":"509","volume":"15","author":"W van Ackooij","year":"2014","unstructured":"van Ackooij, W., Henrion, R., M\u00f6ller, A., Zorgati, R.: Joint chance constrained programming for hydro reservoir management. Optim. Eng. 15(2), 509\u2013531 (2014)","journal-title":"Optim. Eng."},{"issue":"2","key":"1103_CR44","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1137\/120903099","volume":"24","author":"W van Ackooij","year":"2014","unstructured":"van Ackooij, W., Sagastiz\u00e1bal, C.: Constrained bundle methods for upper inexact oracles with application to joint chance constrained energy problems. SIAM J. Optim. 24(2), 733\u2013765 (2014)","journal-title":"SIAM J. Optim."},{"key":"1103_CR45","doi-asserted-by":"crossref","unstructured":"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, Illinois (2012)","DOI":"10.1109\/UCC.2012.37"},{"issue":"4","key":"1103_CR46","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1287\/moor.14.4.760","volume":"14","author":"E Zemel","year":"1989","unstructured":"Zemel, E.: Easily computable facets of the knapsack polytope. Math. Oper. Res. 14(4), 760\u2013764 (1989)","journal-title":"Math. Oper. Res."},{"key":"1103_CR47","unstructured":"Zeng, B., An, Y., Kuznia, L.: Chance constrained mixed integer program: Bilinear and linear formulations, and Benders decomposition. Optimization Online (2014). \n                    arXiv:1403.7875v2"},{"issue":"5","key":"1103_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","key":"1103_CR49","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s10107-007-0140-6","volume":"115","author":"M Zhao","year":"2008","unstructured":"Zhao, M., de Farias Jr, I.R.: The mixing-MIR set with divisible capacities. Math. Program. 115(1), 73\u2013103 (2008)","journal-title":"Math. Program."},{"issue":"6","key":"1103_CR50","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1016\/j.orl.2008.08.001","volume":"36","author":"M Zhao","year":"2008","unstructured":"Zhao, M., de Farias Jr, I.R.: A note on the continuous mixing set. Oper. Res. Lett. 36(6), 726\u2013733 (2008)","journal-title":"Oper. Res. Lett."},{"key":"1103_CR51","unstructured":"Zhao, M., Huang, K., Zeng, B.: Test instances of\u2014a polyhedral study on chance constrained program with random right-hand side. \n                    www.pitt.edu\/~bzeng\/"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-016-1103-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1103-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1103-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T16:18:16Z","timestamp":1589645896000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-016-1103-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,31]]},"references-count":51,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["1103"],"URL":"https:\/\/doi.org\/10.1007\/s10107-016-1103-6","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2016,12,31]]},"assertion":[{"value":"29 April 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 December 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 December 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}