{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:47:13Z","timestamp":1761896833442,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,7,23]],"date-time":"2018-07-23T00:00:00Z","timestamp":1532304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["STE 772\/14-1"],"award-info":[{"award-number":["STE 772\/14-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s10898-018-0690-6","type":"journal-article","created":{"date-parts":[[2018,7,23]],"date-time":"2018-07-23T11:41:09Z","timestamp":1532346069000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Global optimization of generalized semi-infinite programs using disjunctive programming"],"prefix":"10.1007","volume":"73","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8472-3569","authenticated-orcid":false,"given":"Peter","family":"Kirst","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oliver","family":"Stein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,23]]},"reference":[{"key":"690_CR1","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1137\/1035089","volume":"35","author":"R Hettich","year":"1993","unstructured":"Hettich, R., Kortanek, K.O.: Semi-infinite programming: theory, methods, and applications. SIAM Rev. 35, 380\u2013429 (1993)","journal-title":"SIAM Rev."},{"key":"690_CR2","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/j.ejor.2006.08.045","volume":"180","author":"M L\u00f3pez","year":"2007","unstructured":"L\u00f3pez, M., Still, G.: Semi-infinite programming. Eur. J. Oper. Res. 180, 491\u2013518 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"690_CR3","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/j.cam.2007.02.012","volume":"217","author":"F Guerra V\u00e1zquez","year":"2008","unstructured":"Guerra V\u00e1zquez, F., R\u00fcckmann, J.J., Stein, O., Still, G.: Generalized semi-infinite programming: a tutorial. J. Comput. Appl. Math. 217, 394\u2013419 (2008)","journal-title":"J. Comput. Appl. Math."},{"key":"690_CR4","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1016\/j.ejor.2012.06.009","volume":"223","author":"O Stein","year":"2012","unstructured":"Stein, O.: How to solve a semi-infinite optimization problem. Eur. J. Oper. Res. 223, 312\u2013320 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"690_CR5","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF00934096","volume":"19","author":"JW Blankenship","year":"1976","unstructured":"Blankenship, J.W., Falk, J.W.: Infinitely constrained optimization problems. J. Optim. Theory Appl. 19, 261\u2013281 (1976)","journal-title":"J. Optim. Theory Appl."},{"key":"690_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10589-005-4556-8","volume":"30","author":"B Bhattacharjee","year":"2005","unstructured":"Bhattacharjee, B., Green, W.H., Barton, P.: Interval methods for semi-infinite programs. Comput. Optim. Appl. 30, 63\u201393 (2005)","journal-title":"Comput. Optim. Appl."},{"key":"690_CR7","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10107-005-0583-6","volume":"103","author":"B Bhattacharjee","year":"2005","unstructured":"Bhattacharjee, B., Lemonidis, P., Green, W.H., Barton, P.: Global solution of semi-infinite programs. Math. Program. 103, 283\u2013307 (2005)","journal-title":"Math. Program."},{"key":"690_CR8","unstructured":"Lemonidis, P.: Global Optimization Algorithms for Semi-infinite and Generalized Semi-infinite Programs. Ph.D. Thesis. Massachusetts Institute of Technology (2008)"},{"key":"690_CR9","doi-asserted-by":"publisher","first-page":"1291","DOI":"10.1080\/02331934.2010.527970","volume":"60","author":"A Mitsos","year":"2011","unstructured":"Mitsos, A.: Global optimization of semi-infinite programs via restriction of the right-hand side. Optimization 60, 1291\u20131308 (2011)","journal-title":"Optimization"},{"key":"690_CR10","doi-asserted-by":"publisher","first-page":"1187","DOI":"10.1137\/060657741","volume":"18","author":"CA Floudas","year":"2007","unstructured":"Floudas, C.A., Stein, O.: The adaptive convexification algorithm: a feasible point method for semi-infinite programming. SIAM J. Optim. 18, 1187\u20131208 (2007)","journal-title":"SIAM J. Optim."},{"key":"690_CR11","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10107-012-0556-5","volume":"136","author":"O Stein","year":"2012","unstructured":"Stein, O., Steuermann, P.: The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets. Math. Program. 136, 183\u2013207 (2012)","journal-title":"Math. Program."},{"key":"690_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10898-014-0146-6","volume":"61","author":"A Mitsos","year":"2015","unstructured":"Mitsos, A., Tsoukalas, A.: Global optimization of generalized semi-infinite programs via restriction of the right hand side. J. Global Optim. 61, 1\u201317 (2015)","journal-title":"J. Global Optim."},{"key":"690_CR13","unstructured":"Schwientek, J., Seidel, T., K\u00fcfer, K.-H.: A Transformation-based Discretization Method for Solving General Semi-infinite Optimization Problems. Optimization Online Preprint-ID 2017-12-6380 (2017)"},{"key":"690_CR14","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s10100-007-0030-2","volume":"15","author":"H G\u00fcnzel","year":"2007","unstructured":"G\u00fcnzel, H., Jongen, H.T., Stein, O.: On the closure of the feasible set in generalized semi-infinite programming. Central Eur. J. Oper. Res. 15, 271\u2013280 (2007)","journal-title":"Central Eur. J. Oper. Res."},{"key":"690_CR15","doi-asserted-by":"publisher","first-page":"2487","DOI":"10.1137\/090775294","volume":"20","author":"F Guerra V\u00e1zquez","year":"2010","unstructured":"Guerra V\u00e1zquez, F., Jongen, HTh, Shikhman, V.: General semi-infinite programming: symmetric Mangasarian\u2013Fromovitz constraint qualification and the closure of the feasible set. SIAM J. Optim. 20, 2487\u20132503 (2010)","journal-title":"SIAM J. Optim."},{"key":"690_CR16","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1023\/A:1021039126272","volume":"3","author":"IE Grossmann","year":"2002","unstructured":"Grossmann, I.E.: Review of nonlinear mixed-integer and disjunctive programming techniques. Optim. Eng. 3, 227\u2013252 (2002)","journal-title":"Optim. Eng."},{"key":"690_CR17","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10898-008-9321-y","volume":"44","author":"A Tsoulakas","year":"2009","unstructured":"Tsoulakas, A., Rustem, B., Pistikopoulos, E.N.: A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems. J. Global Optim. 44, 235\u2013250 (2009)","journal-title":"J. Global Optim."},{"key":"690_CR18","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/S0377-2217(99)00132-0","volume":"119","author":"G Still","year":"1999","unstructured":"Still, G.: Generalized semi-infinite programming: theory and methods. Eur. J. Oper. Res. 119, 301\u2013313 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"690_CR19","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1080\/02331930108844531","volume":"49","author":"G Still","year":"2001","unstructured":"Still, G.: Generalized semi-infinite programming: numerical aspects. Optimization 49, 223\u2013242 (2001)","journal-title":"Optimization"},{"key":"690_CR20","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10589-012-9489-4","volume":"54","author":"M Diehl","year":"2013","unstructured":"Diehl, M., Houska, B., Stein, O., Steuermann, S.: A lifting method for generalized semi-infinite programs based on lower level Wolfe duality. Comput. Optim. Appl. 54, 189\u2013210 (2013)","journal-title":"Comput. Optim. Appl."},{"key":"690_CR21","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/s10957-010-9674-5","volume":"146","author":"O Stein","year":"2010","unstructured":"Stein, O., Winterfeld, A.: Feasible method for generalized semi-infinite programming. J. Optim. Theory Appl. 146, 419\u2013443 (2010)","journal-title":"J. Optim. Theory Appl."},{"key":"690_CR22","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1023\/A:1008245113420","volume":"13","author":"E Levitin","year":"1998","unstructured":"Levitin, E., Tichatschke, R.: A branch-and-bound approach for solving a class of generalized semi-infinite programming problems. J. Global Optim. 13, 299\u2013315 (1998)","journal-title":"J. Global Optim."},{"key":"690_CR23","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10898-017-0526-9","volume":"69","author":"P Kirst","year":"2017","unstructured":"Kirst, P., Rigterink, F., Stein, O.: Global optimization of disjunctive programs. J. Global Optim. 69, 283\u2013307 (2017)","journal-title":"J. Global Optim."},{"key":"690_CR24","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/s11750-015-0387-7","volume":"23","author":"P Kirst","year":"2015","unstructured":"Kirst, P., Stein, O., Steuermann, P.: Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints. TOP 23, 591\u2013616 (2015)","journal-title":"TOP"},{"key":"690_CR25","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF02241818","volume":"28","author":"R Krawczyk","year":"1982","unstructured":"Krawczyk, R., Nickel, K.: Die zentrische Form in der Intervallarithmetik, ihre quadratische Konvergenz und ihre Inklusionsisotonie. Computing 28, 117\u2013137 (1982)","journal-title":"Computing"},{"key":"690_CR26","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/BF01934696","volume":"28","author":"E Baumann","year":"1988","unstructured":"Baumann, E.: Optimal centered forms. BIT Numer. Math. 28, 80\u201387 (1988)","journal-title":"BIT Numer. Math."},{"key":"690_CR27","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-1-4614-1927-3_5","volume-title":"Disjunctive Cuts for Nonconvex MINLP. Mixed Integer Nonlinear Programming","author":"P Belotti","year":"2012","unstructured":"Belotti, P.: Disjunctive Cuts for Nonconvex MINLP. Mixed Integer Nonlinear Programming, pp. 117\u2013144. Springer, New York (2012)"},{"key":"690_CR28","doi-asserted-by":"publisher","first-page":"S791","DOI":"10.1016\/S0098-1354(97)00146-4","volume":"21","author":"EM Smith","year":"1997","unstructured":"Smith, E.M., Pantelides, C.C.: Global optimisation of nonconvex MINLPs. Comput. Chem. Eng. 21, S791\u2013S796 (1997)","journal-title":"Comput. Chem. Eng."},{"key":"690_CR29","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/S0098-1354(98)00286-5","volume":"23","author":"EM Smith","year":"1999","unstructured":"Smith, E.M., Pantelides, C.C.: A symbolic reformulation\/spatial branch-and-bound algorithm for the global optimization of nonconvex MINLPs. Comput. Chem. Eng. 23, 457\u2013478 (1999)","journal-title":"Comput. Chem. Eng."},{"key":"690_CR30","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF01580665","volume":"10","author":"GP McCormick","year":"1976","unstructured":"McCormick, G.P.: Computability of global solutions to factorable nonconvex programs. Part I\u2014convex underestimating problems. Math. Program. 10, 145\u2013175 (1976)","journal-title":"Math. Program."},{"key":"690_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3532-1","volume-title":"Convexification and Global Optimization in Continous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software and Applications","author":"M Tawarmalani","year":"2002","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Convexification and Global Optimization in Continous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software and Applications. Springer Science and Business Media, Berlin (2002)"},{"key":"690_CR32","volume-title":"Interval Methods for Systems of Equations","author":"A Neumaier","year":"1990","unstructured":"Neumaier, A.: Interval Methods for Systems of Equations. Cambridge University Press, Cambridge (1990)"},{"key":"690_CR33","volume-title":"Model Building in Mathematical Programming","author":"HP Williams","year":"1978","unstructured":"Williams, H.P.: Model Building in Mathematical Programming. Wiley, Chichester (1978)"},{"key":"690_CR34","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, 466\u2013486 (1985)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"690_CR35","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E Balas","year":"1993","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G.: A lift-and-project cutting plane algorithm for mixed 0\u20131 programs. Math. Program. 58, 295\u2013324 (1993)","journal-title":"Math. Program."},{"key":"690_CR36","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/BF00933095","volume":"21","author":"E Balas","year":"1977","unstructured":"Balas, E.: A note on duality in disjunctive programming. J. Optim. Theory Appl. 21, 523\u2013528 (1977)","journal-title":"J. Optim. Theory Appl."},{"key":"690_CR37","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/BF02307379","volume":"53","author":"O Kn\u00fcppel","year":"1994","unstructured":"Kn\u00fcppel, O.: PROFIL\/BIAS-a fast interval library. Computing 53, 277\u2013287 (1994)","journal-title":"Computing"},{"key":"690_CR38","volume-title":"GNU Linear Proramming Kit","author":"A Makhorin","year":"2010","unstructured":"Makhorin, A.: GNU Linear Proramming Kit. Department for Applied Informatics, Moscow Aviation Institute, Moscow (2010)"},{"key":"690_CR39","first-page":"145","volume":"83","author":"HT Jongen","year":"1998","unstructured":"Jongen, H.T., R\u00fcckmann, J.J., Stein, O.: Generalized semi-infinite optimization: a first order optimality condition and examples. Math. Program. 83, 145\u2013158 (1998)","journal-title":"Math. Program."},{"key":"690_CR40","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, 595\u2013614 (1999)","journal-title":"Math. Program."},{"key":"690_CR41","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s101070050103","volume":"86","author":"RA Stubbs","year":"1999","unstructured":"Stubbs, R.A., Mehrotra, S.: A branch-and-cut method for 0\u20131 mixed convex programming. Math. Program. 86, 515\u2013532 (1999)","journal-title":"Math. Program."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-018-0690-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-018-0690-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-018-0690-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,22]],"date-time":"2019-09-22T22:40:59Z","timestamp":1569192059000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-018-0690-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,23]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["690"],"URL":"https:\/\/doi.org\/10.1007\/s10898-018-0690-6","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2018,7,23]]},"assertion":[{"value":"5 October 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}