{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T08:54:49Z","timestamp":1772614489987,"version":"3.50.1"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T00:00:00Z","timestamp":1583971200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T00:00:00Z","timestamp":1583971200000},"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":["Comput Optim Appl"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s10589-020-00176-0","type":"journal-article","created":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T18:03:50Z","timestamp":1584036230000},"page":"589-614","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function"],"prefix":"10.1007","volume":"76","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0089-8124","authenticated-orcid":false,"given":"Kevin C.","family":"Furman","sequence":"first","affiliation":[]},{"given":"Nicolas W.","family":"Sawaya","sequence":"additional","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":[[2020,3,12]]},"reference":[{"key":"176_CR1","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.orl.2008.12.009","volume":"37","author":"S Akturk","year":"2009","unstructured":"Akturk, S., Atamturk, A., Gurel, S.: A strong conic quadratic reformulation for machine-job assignment with controllable processing times. Oper. Res. Lett. 37, 187\u2013191 (2009)","journal-title":"Oper. Res. Lett."},{"key":"176_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E Balas","year":"1979","unstructured":"Balas, E.: Disjunctive programming. Ann. Discret. Math. 5, 3\u201351 (1979)","journal-title":"Ann. Discret. Math."},{"issue":"3","key":"176_CR3","doi-asserted-by":"crossref","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 continuous optimization problems. SIAM J. Algebr. Discret. Methods 6(3), 466\u2013486 (1985)","journal-title":"SIAM J. Algebr. Discret. Methods"},{"key":"176_CR4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(98)00136-X","volume":"89","author":"E Balas","year":"1998","unstructured":"Balas, E.: Disjunctive programming: properties of the convex hull of feasible points. Discret. Appl. Math. 89, 3\u201344 (1998)","journal-title":"Discret. Appl. Math."},{"key":"176_CR5","volume-title":"Data Networks","author":"D Bertsekas","year":"1987","unstructured":"Bertsekas, D., Gallager, R.: Data Networks. Prentice-Hall, Englewood Cliffs (1987)"},{"key":"176_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/978-3-642-20807-2_5","volume-title":"Integer Programming and Combinatoral Optimization. IPCO 2011","author":"P Bonami","year":"2011","unstructured":"Bonami, P.: Lift-and-project cuts for mixed integer convex programs. In: G\u00fcnl\u00fck, O., Woeginger, G.J. (eds.) Integer Programming and Combinatoral Optimization. IPCO 2011. Lecture Notes in Computer Science, vol. 6655, pp. 52\u201364. Springer, Berlin (2011)"},{"issue":"1","key":"176_CR7","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s10107-015-0891-4","volume":"151","author":"P Bonami","year":"2015","unstructured":"Bonami, P., Lodi, A., Tramontani, A., Wiese, S.: On mathematical programming with indicator constraints. Math. Program. 151(1), 191\u2013223 (2015)","journal-title":"Math. Program."},{"key":"176_CR8","unstructured":"Bonami, P., Tramontani, A.; Advances in CPLEX for mixed integer nonlinear optimization. In: Presentation at ISMP, Pittsburgh (2015)"},{"key":"176_CR9","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/TCOM.1977.1093708","volume":"25","author":"R Boorstyn","year":"1977","unstructured":"Boorstyn, R., Frank, H.: Large-scale network topological optimization. IEEE Trans. Commun. 25, 29\u201347 (1977)","journal-title":"IEEE Trans. Commun."},{"key":"176_CR10","unstructured":"Brooke, A., Kendrick, D., Meeraus, A., Raman, R.: GAMS language guide, version 98. GAMS Development Corporation. SBB: https:\/\/www.gams.com\/latest\/docs\/S_SBB.html, CONOPT: https:\/\/www.gams.com\/latest\/docs\/S_CONOPT.html"},{"key":"176_CR11","doi-asserted-by":"crossref","first-page":"5781","DOI":"10.1021\/ie2030486","volume":"51","author":"PM Castro","year":"2012","unstructured":"Castro, P.M., Grossmann, I.E.: Generalized disjunctive programming as a systematic modeling framework to derive scheduling formulations. Ind. Eng. Chem. Res. 51, 5781\u20135792 (2012)","journal-title":"Ind. Eng. Chem. Res."},{"issue":"3","key":"176_CR12","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/s101070050106","volume":"86","author":"S Ceria","year":"1999","unstructured":"Ceria, S., Soares, J.: Convex programming for disjunctive optimization. Math. Program. 86(3), 595\u2013614 (1999)","journal-title":"Math. Program."},{"key":"176_CR13","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF02592064","volume":"36","author":"MA Duran","year":"1986","unstructured":"Duran, M.A., Grossmann, I.E.: An outer approximation algorithm for a class of mixed integer nonlinear programs. Math. Program. 36, 307\u2013339 (1986)","journal-title":"Math. Program."},{"key":"176_CR14","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1287\/msom.1050.0094","volume":"8","author":"S Elhedhli","year":"2006","unstructured":"Elhedhli, S.: Service system design with immobile servers, stochastic demand, and congestion. Manuf. Serv. Oper. Manag. 8, 92\u201397 (2006)","journal-title":"Manuf. Serv. Oper. Manag."},{"key":"176_CR15","doi-asserted-by":"crossref","first-page":"1973","DOI":"10.1016\/j.compchemeng.2009.06.013","volume":"33","author":"MC Ferris","year":"2009","unstructured":"Ferris, M.C., Dirkse, S.P., Jagla, J.H., Meeraus, A.: An extended mathematical programming framework. Comput. Chem. Eng. 33, 1973\u20131982 (2009)","journal-title":"Comput. Chem. Eng."},{"key":"176_CR16","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-005-0594-3","volume":"106","author":"A Frangioni","year":"2006","unstructured":"Frangioni, A., Gentile, C.: Perspective cuts for a class of convex 0\u20131 mixed integer programs. Math. Program. 106, 225\u2013236 (2006)","journal-title":"Math. Program."},{"issue":"2","key":"176_CR17","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.orl.2006.03.008","volume":"35","author":"A Frangioni","year":"2007","unstructured":"Frangioni, A., Gentile, C.: SDP diagonalizations and perspective cuts for a class of nonseparable MIQP. Oper. Res. Lett. 35(2), 181\u2013185 (2007)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"176_CR18","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/j.orl.2009.02.003","volume":"37","author":"A Frangioni","year":"2009","unstructured":"Frangioni, A., Gentile, C.: A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes. Oper. Res. Lett. 37(3), 206\u2013210 (2009)","journal-title":"Oper. Res. Lett."},{"issue":"5","key":"176_CR19","doi-asserted-by":"crossref","first-page":"1225","DOI":"10.1287\/opre.1110.0930","volume":"59","author":"A Frangioni","year":"2011","unstructured":"Frangioni, A., Gentile, C., Grande, E., Pacifici, A.: Projected perspective reformulations with applications in design problems. Oper. Res. 59(5), 1225\u20131232 (2011)","journal-title":"Oper. Res."},{"key":"176_CR20","unstructured":"Furman, K.C.: Private conversation with N. Sawaya and I.E. Grossmann (November 4, 2005)"},{"key":"176_CR21","unstructured":"Furman, K.C., Sawaya, N.W., Grossmann, I.E.: An exact MINLP formulation for nonlinear disjunctive programs based on the convex hull. In: Presentation at 20th International Symposium on Mathematical Programming (2009)"},{"key":"176_CR22","unstructured":"Furman, K.C., Sawaya, N.W., Grossmann, I.E.: A useful algebraic representation of convex sets using the perspective function. In: Presentation at MINLP, Pittsburgh (2014)"},{"key":"176_CR23","unstructured":"Grossmann, I.E., Westerberg, A.W., Biegler, L.T.: Retrofit design of chemical processes. In: Reklaitis, G.V., Spriggs, H.D. (eds.) Proceedings of Foundations of Computer Aided Process Operations, vol. 403. Elsevier (1987)"},{"key":"176_CR24","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/BF02698263","volume":"16","author":"IE Grossmann","year":"1999","unstructured":"Grossmann, I.E., Caballero, J.A., Yeomans, H.: Mathematical programming approaches for the synthesis of chemical process systems. Korean J. Chem. Eng. 16, 407\u2013426 (1999)","journal-title":"Korean J. Chem. Eng."},{"key":"176_CR25","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1023\/A:1025154322278","volume":"26","author":"IE Grossmann","year":"2003","unstructured":"Grossmann, I.E., Lee, S.: Generalized disjunctive programming: nonlinear convex hull relaxation and algorithms. Comput. Optim. Appl. 26, 83\u2013100 (2003)","journal-title":"Comput. Optim. Appl."},{"key":"176_CR26","unstructured":"Gunluk, O., Lee, J., Weismantel, R.: MINLP strengthening for separable convex quadratic transportation-cost UFL. Technical Report RC24213 (W0703-042), IBM Research Division (March 2007)"},{"key":"176_CR27","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Integer Programming and Combinatorial Optimization","author":"O Gunluk","year":"2008","unstructured":"Gunluk, O., Linderoth, J.: Perspective relaxation of mixed integer nonlinear programs with indicator variables. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, vol. 5035, pp. 1\u201316. Springer, Berlin (2008)"},{"key":"176_CR28","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s10107-010-0360-z","volume":"124","author":"O Gunluk","year":"2010","unstructured":"Gunluk, O., Linderoth, J.: Perspective reformulations of mixed integer nonlinear programs with indicator variables. Math. Program. 124, 183\u2013205 (2010)","journal-title":"Math. Program."},{"key":"176_CR29","series-title":"The IMA Volumes in Mathematics and its Applications","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/978-1-4614-1927-3_3","volume-title":"Mixed Integer Nonlinear Programming","author":"O Gunluk","year":"2012","unstructured":"Gunluk, O., Linderoth, J.: Perspective reformulation and applications. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming. The IMA Volumes in Mathematics and its Applications, vol. 154, pp. 61\u201389. Springer, New York (2012)"},{"key":"176_CR30","unstructured":"Hart, W.E., Laird, C.D., Watson, J.-P., Woodruff, D.L., Hackebeil, G.A., Nicholson, B.L., Siirola, J.D.: Pyomo\u2014Optimization Modeling in Python, 2nd edn. Springer (2017). https:\/\/www.springer.com\/gp\/book\/9783319588193"},{"key":"176_CR31","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1016\/j.endm.2010.05.146","volume":"36","author":"H Hijazi","year":"2010","unstructured":"Hijazi, H., Bonami, P., Cornujols, G., Ouorou, A.: Mixed integer non linear programs featuring \u201con\/off\u201d constraints: convex analysis and applications. Electron. Notes Discret. Math. 36, 1153\u20131160 (2010)","journal-title":"Electron. Notes Discret. Math."},{"key":"176_CR32","volume-title":"Fundamentals of Convex Analysis","author":"J Hiriart-Urruty","year":"2004","unstructured":"Hiriart-Urruty, J., Lemar\u00e9chal, C.: Fundamentals of Convex Analysis, 2nd edn. Springer, Berlin (2004)","edition":"2"},{"key":"176_CR33","doi-asserted-by":"crossref","first-page":"3762","DOI":"10.1021\/ie010699x","volume":"41","author":"J Jackson","year":"2002","unstructured":"Jackson, J., Grossmann, I.E.: High-level optimization model for the retrofit planning of process networks. Ind. Eng. Chem. Res. 41, 3762\u20133770 (2002)","journal-title":"Ind. Eng. Chem. Res."},{"key":"176_CR34","doi-asserted-by":"crossref","first-page":"1661","DOI":"10.1016\/S0098-1354(01)00730-X","volume":"25","author":"J Jackson","year":"2001","unstructured":"Jackson, J., Grossmann, I.E.: A disjunctive programming approach for the optimal design of reactive distillation columns. Comput. Chem. Eng. 25, 1661\u20131673 (2001)","journal-title":"Comput. Chem. Eng."},{"key":"176_CR35","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-218X(87)90026-6","volume":"17","author":"RG Jeroslow","year":"1987","unstructured":"Jeroslow, R.G.: Representability in mixed integer programming, I: characterization results. Discret. Appl. Math. 17, 223\u2013243 (1987)","journal-title":"Discret. Appl. Math."},{"key":"176_CR36","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/s12532-017-0118-1","volume":"9","author":"M Kilinc","year":"2017","unstructured":"Kilinc, M., Linderoth, J., Luedtke, J.: Lift-and-project cuts for convex mixed integer nonlinear programs. Math. Program. Comput. 9, 499\u2013526 (2017)","journal-title":"Math. Program. Comput."},{"key":"176_CR37","doi-asserted-by":"crossref","first-page":"2125","DOI":"10.1016\/S0098-1354(00)00581-0","volume":"24","author":"S Lee","year":"2000","unstructured":"Lee, S., Grossmann, I.E.: New algorithms for nonlinear generalized disjunctive programming. Comput. Chem. Eng. 24, 2125\u20132141 (2000)","journal-title":"Comput. Chem. Eng."},{"key":"176_CR38","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1016\/S0098-1354(01)00706-2","volume":"24","author":"S Lee","year":"2001","unstructured":"Lee, S., Grossmann, I.E.: Erratum to \u201cnew algorithms for nonlinear generalized disjunctive programming\u201d. Comput. Chem. Eng. 24, 1153 (2001)","journal-title":"Comput. Chem. Eng."},{"key":"176_CR39","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/s10479-005-3451-0","volume":"139","author":"S Lee","year":"2005","unstructured":"Lee, S., Grossmann, I.E.: Logic-based modeling and solution of nonlinear discrete\/continuous optimization problems. Ann. Oper. Res. 139, 267\u2013288 (2005)","journal-title":"Ann. Oper. Res."},{"key":"176_CR40","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1016\/j.compchemeng.2006.02.008","volume":"30","author":"CA Mendez","year":"2006","unstructured":"Mendez, C.A., Cerd\u00e1, J., Grossmann, I.E., Harjunkoski, I., Fahl, M.: State-of-the-art review of optimization methods for short-term scheduling of batch processes. Comput. Chem. Eng. 30, 913\u2013946 (2006)","journal-title":"Comput. Chem. Eng."},{"key":"176_CR41","unstructured":"MINLPLib: A library of mixed-integer and continuous nonlinear programming instances. Available at http:\/\/www.minlplib.org\/index.html"},{"issue":"7","key":"176_CR42","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/0098-1354(93)E0010-7","volume":"18","author":"R Raman","year":"1994","unstructured":"Raman, R., Grossmann, I.E.: Modeling and computational techniques for logic based integer programming. Comput. Chem. Eng. 18(7), 563\u2013578 (1994)","journal-title":"Comput. Chem. Eng."},{"key":"176_CR43","unstructured":"Ravemark, E.: Optimization models for design and operation of chemical batch processes. Ph.D. Thesis, ETH Zurich (1995)"},{"key":"176_CR44","unstructured":"Sawaya, N.W.: Reformulations, relaxations and cutting planes for generalized disjunctive programming. Ph.D. Thesis, Carnegie Mellon University (2006)"},{"key":"176_CR45","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1016\/j.compchemeng.2006.08.002","volume":"31","author":"NW Sawaya","year":"2007","unstructured":"Sawaya, N.W., Grossmann, I.E.: Computational implementation of non-linear convex hull reformulation. Comput. Chem. Eng. 31, 856\u2013866 (2007)","journal-title":"Comput. Chem. Eng."},{"key":"176_CR46","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s101070050103","volume":"86","author":"R Stubbs","year":"1999","unstructured":"Stubbs, R., Mehrotra, S.: A branch-and-cut method for 0\u20131 mixed convex programming. Math. Program. 86, 515\u2013532 (1999)","journal-title":"Math. Program."},{"key":"176_CR47","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/ijoc.2015.0669","volume":"28","author":"F Trespalacios","year":"2016","unstructured":"Trespalacios, F., Grossmann, I.E.: Cutting plane algorithm for convex generalized disjunctive programs. INFORMS J. Comput. 28, 209\u2013222 (2016)","journal-title":"INFORMS J. Comput."},{"issue":"8","key":"176_CR48","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1016\/0098-1354(95)00219-7","volume":"20","author":"M Turkay","year":"1996","unstructured":"Turkay, M., Grossmann, I.E.: Logic-based MINLP algorithms for the optimal synthesis of process networks. Comput. Chem. Eng. 20(8), 959\u2013978 (1996)","journal-title":"Comput. Chem. Eng."},{"key":"176_CR49","unstructured":"Vecchietti, A.: LOGMIP 2.0 User Manual. http:\/\/www.logmip.ceride.gov.ar\/files\/pdfs\/newUserManual.pdf (2011)"},{"key":"176_CR50","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/S0098-1354(02)00220-X","volume":"27","author":"A Vecchietti","year":"2003","unstructured":"Vecchietti, A., Lee, S., Grossmann, I.E.: Modeling of discrete\/continuous optimization problems: characterization and formulation of disjunctions and their relaxations. Comput. Chem. Eng. 27, 433\u2013448 (2003)","journal-title":"Comput. Chem. Eng."},{"key":"176_CR51","volume-title":"Power Generation Operation and Control","author":"A Wood","year":"1996","unstructured":"Wood, A., Wollemberg, B.: Power Generation Operation and Control. Wiley, Hoboken (1996)"},{"key":"176_CR52","doi-asserted-by":"crossref","first-page":"9119","DOI":"10.1021\/ie9001074","volume":"48","author":"H Wu","year":"2009","unstructured":"Wu, H., Wen, H., Zhu, Y.: Branch-and-cut algorithmic framework for 0\u20131 mixed-integer convex nonlinear programs. Ind. Eng. Chem. Res. 48, 9119\u20139127 (2009)","journal-title":"Ind. Eng. Chem. Res."},{"issue":"1","key":"176_CR53","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1021\/ie0402719","volume":"45","author":"Y Zhu","year":"2006","unstructured":"Zhu, Y., Kuno, T.: A disjunctive cutting-plane based branch-and-cut algorithm for 0\u20131 mixed-integer convex nonlinear programs. Ind. Eng. Chem. Res. 45(1), 187\u2013196 (2006)","journal-title":"Ind. Eng. Chem. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00176-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-020-00176-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00176-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,12]],"date-time":"2021-03-12T00:53:56Z","timestamp":1615510436000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-020-00176-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,12]]},"references-count":53,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["176"],"URL":"https:\/\/doi.org\/10.1007\/s10589-020-00176-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,12]]},"assertion":[{"value":"22 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 March 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}