{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T23:34:01Z","timestamp":1770680041624,"version":"3.49.0"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,8,23]],"date-time":"2019-08-23T00:00:00Z","timestamp":1566518400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,23]],"date-time":"2019-08-23T00:00:00Z","timestamp":1566518400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s10898-019-00820-y","type":"journal-article","created":{"date-parts":[[2019,8,23]],"date-time":"2019-08-23T06:02:22Z","timestamp":1566540142000},"page":"921-947","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["A finite $$\\epsilon $$-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables"],"prefix":"10.1007","volume":"75","author":[{"given":"Can","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7210-084X","authenticated-orcid":false,"given":"Ignacio E.","family":"Grossmann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,23]]},"reference":[{"issue":"3","key":"820_CR1","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1287\/ijoc.2016.0695","volume":"28","author":"G Angulo","year":"2016","unstructured":"Angulo, G., Ahmed, S., Dey, S.S.: Improving the integer L-shaped method. INFORMS J. Comput. 28(3), 483\u2013499 (2016)","journal-title":"INFORMS J. Comput."},{"key":"820_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10287-018-0311-3","volume":"15","author":"S Atakan","year":"2018","unstructured":"Atakan, S., Sen, S.: A progressive hedging based branch-and-bound algorithm for mixed-integer stochastic programs. Comput. Manag. Sci. 15, 1\u201340 (2018)","journal-title":"Comput. Manag. Sci."},{"issue":"3","key":"820_CR3","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1137\/0606047","volume":"6","author":"E Balas","year":"1985","unstructured":"Balas, E.: Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. SIAM J. Algebraic Discrete Methods 6(3), 466\u2013486 (1985)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"820_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0237-4","volume-title":"Introduction to stochastic programming","author":"JR Birge","year":"2011","unstructured":"Birge, J.R., Louveaux, F.: Introduction to stochastic programming. Springer, New York (2011)"},{"key":"820_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2017.05.011","author":"B Brunaud","year":"2017","unstructured":"Brunaud, B., Bassett, M.H., Agarwal, A., Wassick, J.M., Grossmann, I.E.: Efficient formulations for dynamic warehouse location under discrete transportation costs. Comput. Chem. Eng. (2017). \nhttps:\/\/doi.org\/10.1016\/j.compchemeng.2017.05.011","journal-title":"Comput. Chem. Eng."},{"key":"820_CR6","unstructured":"Bussieck, M.R., Drud, A.: SBB: A new solver for mixed integer nonlinear programming. Talk, OR (2001). \nhttp:\/\/ftp.gamsworld.org\/presentations\/present_sbb.pdf\n\n. Accessed 20 Aug 2019"},{"key":"820_CR7","first-page":"35","volume-title":"Nonconvex Optimization and Its Applications","author":"Richard H. Byrd","year":"2006","unstructured":"Byrd, R.H., Nocedal, J., Waltz, R.A.: Knitro: an integrated package for nonlinear optimization. In: Large-Scale Nonlinear Optimization, pp. 35\u201359. Springer, New York (2006)"},{"issue":"1","key":"820_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(1), 37\u201345 (1999)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"820_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":"820_CR10","unstructured":"CPLEX, I.I.: V12. 1: User\u2019s manual for CPLEX, Vol. 46, No. 53, p. 157. International Business Machines Corporation (2009)"},{"issue":"2","key":"820_CR11","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1137\/15M1020575","volume":"59","author":"I Dunning","year":"2017","unstructured":"Dunning, I., Huchette, J., Lubin, M.: JuMP: a modeling language for mathematical optimization. SIAM Rev. 59(2), 295\u2013320 (2017)","journal-title":"SIAM Rev."},{"key":"820_CR12","unstructured":"Furman, K.C., Sawaya, N., Grossmann, I.: A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function. Optimization Online (2016). \nhttp:\/\/www.optimization-online.org\/DB_FILE\/2016\/07\/5544.pdf\n\n. Accessed 20 Aug 2019"},{"issue":"1","key":"820_CR13","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10107-016-1000-z","volume":"157","author":"D Gade","year":"2016","unstructured":"Gade, D., Hackebeil, G., Ryan, S.M., Watson, J.P., Wets, R.J.B., Woodruff, D.L.: Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs. Math. Program. 157(1), 47\u201367 (2016)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"820_CR14","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10107-012-0615-y","volume":"144","author":"D Gade","year":"2014","unstructured":"Gade, D., K\u00fc\u00e7\u00fckyavuz, S., Sen, S.: Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs. Math. Program. 144(1\u20132), 39\u201364 (2014)","journal-title":"Math. Program."},{"issue":"4","key":"820_CR15","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"AM Geoffrion","year":"1972","unstructured":"Geoffrion, A.M.: Generalized Benders decomposition. J. Optim. Theory Appl. 10(4), 237\u2013260 (1972)","journal-title":"J. Optim. Theory Appl."},{"issue":"9","key":"820_CR16","doi-asserted-by":"publisher","first-page":"3276","DOI":"10.1002\/aic.14088","volume":"59","author":"IE Grossmann","year":"2013","unstructured":"Grossmann, I.E., Trespalacios, F.: Systematic modeling of discrete-continuous optimization models through generalized disjunctive programming. AIChE J. 59(9), 3276\u20133295 (2013)","journal-title":"AIChE J."},{"issue":"2","key":"820_CR17","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF02579036","volume":"11","author":"M Guignard","year":"2003","unstructured":"Guignard, M.: Lagrangean relaxation. Top 11(2), 151\u2013200 (2003)","journal-title":"Top"},{"issue":"1","key":"820_CR18","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10107-015-0971-5","volume":"157","author":"R Jiang","year":"2016","unstructured":"Jiang, R., Guan, Y., Watson, J.P.: Cutting planes for the multistage stochastic unit commitment problem. Math. Program. 157(1), 121\u2013151 (2016)","journal-title":"Math. Program."},{"issue":"2","key":"820_CR19","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s12532-017-0128-z","volume":"10","author":"Kibaek Kim","year":"2017","unstructured":"Kim, K., Zavala, V.M.: Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs. In: Mathematical Programming Computation, pp. 1\u201342 (2017)","journal-title":"Mathematical Programming Computation"},{"key":"820_CR20","first-page":"1","volume-title":"The Operations Research Revolution","author":"Simge K\u00fc\u00e7\u00fckyavuz","year":"2017","unstructured":"K\u00fc\u00e7\u00fckyavuz, S., Sen, S.: An introduction to two-stage stochastic mixed-integer programming. In: Leading Developments from INFORMS Communities, pp. 1\u201327. INFORMS (2017)"},{"issue":"3","key":"820_CR21","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0167-6377(93)90002-X","volume":"13","author":"G Laporte","year":"1993","unstructured":"Laporte, G., Louveaux, F.V.: The integer L-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett. 13(3), 133\u2013142 (1993)","journal-title":"Oper. Res. Lett."},{"key":"820_CR22","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.compchemeng.2018.01.017","volume":"112","author":"C Li","year":"2018","unstructured":"Li, C., Grossmann, I.E.: An improved L-shaped method for two-stage convex 0\u20131 mixed integer nonlinear stochastic programs. Comput. Chem. Eng. 112, 165\u2013179 (2018)","journal-title":"Comput. Chem. Eng."},{"issue":"3","key":"820_CR23","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s10957-011-9888-1","volume":"151","author":"X Li","year":"2011","unstructured":"Li, X., Tomasgard, A., Barton, P.I.: Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs. J. Optim. Theory Appl. 151(3), 425 (2011)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"820_CR24","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1007\/s10898-011-9792-0","volume":"54","author":"X Li","year":"2012","unstructured":"Li, X., Tomasgard, A., Barton, P.I.: Decomposition strategy for the stochastic pooling problem. J. Global Optim. 54(4), 765\u2013790 (2012)","journal-title":"J. Global Optim."},{"key":"820_CR25","first-page":"102","volume-title":"Extended Formulations in Mixed-Integer Convex Programming","author":"M Lubin","year":"2016","unstructured":"Lubin, M., Yamangil, E., Bent, R., Vielma, J.P.: Extended Formulations in Mixed-Integer Convex Programming, pp. 102\u2013113. Springer, Cham (2016)"},{"issue":"1","key":"820_CR26","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/s10479-015-1899-0","volume":"235","author":"E Mijangos","year":"2015","unstructured":"Mijangos, E.: An algorithm for two-stage stochastic mixed-integer nonlinear convex problems. Ann. Oper. Res. 235(1), 581\u2013598 (2015)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"820_CR27","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10898-007-9245-y","volume":"41","author":"L Ntaimo","year":"2008","unstructured":"Ntaimo, L., Tanner, M.W.: Computations with disjunctive cuts for two-stage stochastic mixed 0\u20131 integer programs. J. Global Optim. 41(3), 365\u2013384 (2008)","journal-title":"J. Global Optim."},{"issue":"1\u20132","key":"820_CR28","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10107-010-0412-4","volume":"133","author":"OY \u00d6zalt\u0131n","year":"2012","unstructured":"\u00d6zalt\u0131n, O.Y., Prokopyev, O.A., Schaefer, A.J.: Two-stage quadratic integer programs with stochastic right-hand sides. Math. Program. 133(1\u20132), 121\u2013158 (2012)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"820_CR29","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s10107-016-1006-6","volume":"161","author":"Y Qi","year":"2017","unstructured":"Qi, Y., Sen, S.: The ancestral Benders cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming. Math. Program. 161(1\u20132), 193\u2013235 (2017)","journal-title":"Math. Program."},{"issue":"1","key":"820_CR30","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1287\/moor.16.1.119","volume":"16","author":"RT Rockafellar","year":"1991","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Scenarios and policy aggregation in optimization under uncertainty. Math. Oper. Res. 16(1), 119\u2013147 (1991)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"820_CR31","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.ejor.2011.10.002","volume":"218","author":"JP Ruiz","year":"2012","unstructured":"Ruiz, J.P., Grossmann, I.E.: A hierarchy of relaxations for nonlinear convex generalized disjunctive programming. Eur. J. Oper. Res. 218(1), 38\u201347 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"820_CR32","unstructured":"Sawaya, N.: Reformulations, relaxations and cutting planes for generalized disjunctive programming. Ph.D. thesis, Carnegie Mellon University, Pittsburgh (2006)"},{"issue":"1","key":"820_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-004-0566-z","volume":"104","author":"S Sen","year":"2005","unstructured":"Sen, S., Higle, J.L.: The C-3 theorem and a D-2 algorithm for large scale stochastic mixed-integer programming: set convexification. Math. Program. 104(1), 1\u201320 (2005)","journal-title":"Math. Program."},{"issue":"2","key":"820_CR34","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s10107-005-0592-5","volume":"106","author":"S Sen","year":"2006","unstructured":"Sen, S., Sherali, H.D.: Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming. Math. Program. 106(2), 203\u2013223 (2006)","journal-title":"Math. Program."},{"issue":"1\u20134","key":"820_CR35","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1023\/A:1013827731218","volume":"22","author":"HD Sherali","year":"2002","unstructured":"Sherali, H.D., Fraticelli, B.M.: A modification of Benders decomposition algorithm for discrete subproblems: an approach for stochastic programs with integer recourse. J. Global Optim. 22(1\u20134), 319\u2013342 (2002)","journal-title":"J. Global Optim."},{"issue":"2","key":"820_CR36","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s10107-006-0724-6","volume":"108","author":"HD Sherali","year":"2006","unstructured":"Sherali, H.D., Zhu, X.: On solving discrete two-stage stochastic programs having mixed-integer first-and second-stage variables. Math. Program. 108(2), 597\u2013616 (2006)","journal-title":"Math. Program."},{"issue":"4","key":"820_CR37","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1137\/0117061","volume":"17","author":"RM Van Slyke","year":"1969","unstructured":"Van Slyke, R.M., Wets, R.: L-shaped linear programs with applications to optimal control and stochastic programming. SIAM J. Appl. Math. 17(4), 638\u2013663 (1969)","journal-title":"SIAM J. Appl. Math."},{"issue":"7","key":"820_CR38","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1016\/0098-1354(90)87085-4","volume":"14","author":"J Viswanathan","year":"1990","unstructured":"Viswanathan, J., Grossmann, I.E.: A combined penalty function and outer-approximation method for MINLP optimization. Comput. Chem. Eng. 14(7), 769\u2013782 (1990)","journal-title":"Comput. Chem. Eng."},{"issue":"1","key":"820_CR39","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2006)","journal-title":"Math. Program."},{"issue":"4","key":"820_CR40","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s10287-010-0125-4","volume":"8","author":"JP Watson","year":"2011","unstructured":"Watson, J.P., Woodruff, D.L.: Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems. Comput. Manag. Sci. 8(4), 355\u2013370 (2011)","journal-title":"Comput. Manag. Sci."},{"issue":"2","key":"820_CR41","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s12532-012-0036-1","volume":"4","author":"JP Watson","year":"2012","unstructured":"Watson, J.P., Woodruff, D.L., Hart, W.E.: PySP: modeling and solving stochastic programs in Python. Math. Program. Comput. 4(2), 109\u2013149 (2012)","journal-title":"Math. Program. Comput."},{"key":"820_CR42","unstructured":"Westerlund, T., Lundqvist, K.: Alpha-ECP, version 5.01: An interactive MINLP-solver based on the extended cutting plane method. \u00c5bo Akademi (2001)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00820-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-019-00820-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00820-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,21]],"date-time":"2020-08-21T23:15:22Z","timestamp":1598051722000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-019-00820-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,23]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["820"],"URL":"https:\/\/doi.org\/10.1007\/s10898-019-00820-y","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,23]]},"assertion":[{"value":"18 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 August 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}