{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T08:54:51Z","timestamp":1772614491634,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T00:00:00Z","timestamp":1692576000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T00:00:00Z","timestamp":1692576000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Zuse-Institut Berlin"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2023,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The benefits of cutting planes based on the perspective function are well known for many specific classes of mixed-integer nonlinear programs with on\/off structures. However, we are not aware of any empirical studies that evaluate their applicability and computational impact over large, heterogeneous test sets in general-purpose solvers. This paper provides a detailed computational study of perspective cuts within a linear programming based branch-and-cut solver for general mixed-integer nonlinear programs. Within this study, we extend the applicability of perspective cuts from convex to nonconvex nonlinearities. This generalization is achieved by applying a perspective strengthening to valid linear inequalities which separate solutions of linear relaxations. The resulting method can be applied to any constraint where all variables appearing in nonlinear terms are semi-continuous and depend on at least one common indicator variable. Our computational experiments show that adding perspective cuts for convex constraints yields a consistent improvement of performance, and adding perspective cuts for nonconvex constraints reduces branch-and-bound tree sizes and strengthens the root node relaxation, but has no significant impact on the overall mean time.\n<\/jats:p>","DOI":"10.1007\/s12532-023-00246-4","type":"journal-article","created":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T10:01:55Z","timestamp":1692612115000},"page":"703-731","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A computational study of perspective cuts"],"prefix":"10.1007","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7018-7099","authenticated-orcid":false,"given":"Ksenia","family":"Bestuzheva","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0391-5903","authenticated-orcid":false,"given":"Ambros","family":"Gleixner","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0001-2262-0601","authenticated-orcid":false,"given":"Stefan","family":"Vigerske","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,21]]},"reference":[{"issue":"3","key":"246_CR1","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.orl.2008.12.009","volume":"37","author":"MS Akt\u00fcrk","year":"2009","unstructured":"Akt\u00fcrk, M.S., Atamt\u00fcrk, A., G\u00fcrel, S.: A strong conic quadratic reformulation for machine-job assignment with controllable processing times. Oper. Res. Lett. 37(3), 187\u2013191 (2009). https:\/\/doi.org\/10.1016\/j.orl.2008.12.009","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"246_CR2","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10107-018-1301-5","volume":"170","author":"A Atamt\u00fcrk","year":"2018","unstructured":"Atamt\u00fcrk, A., G\u00f3mez, A.: Strong formulations for quadratic optimization with M-matrices and indicator variables. Math. Program. 170(1), 141\u2013176 (2018). https:\/\/doi.org\/10.1007\/s10107-018-1301-5","journal-title":"Math. Program."},{"key":"246_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E Balas","year":"1979","unstructured":"Balas, E.: Disjunctive programming. Ann. Discrete Math. 5, 3\u201351 (1979)","journal-title":"Ann. Discrete Math."},{"issue":"3","key":"246_CR4","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. Algebr. Discrete Methods 6(3), 466\u2013486 (1985)","journal-title":"SIAM J. Algebr. Discrete Methods"},{"issue":"2","key":"246_CR5","first-page":"107","volume":"38","author":"R Barbaro","year":"1986","unstructured":"Barbaro, R., Ramani, R.: Generalized multiperiod MIP model for production scheduling and processing facilities selection and location. Min. Eng. 38(2), 107\u2013114 (1986)","journal-title":"Min. Eng."},{"key":"246_CR6","doi-asserted-by":"publisher","unstructured":"Bestuzheva, K.: KBestuzheva\/SCIP-perspective-cuts: implementation of perspective cuts in SCIP (2023). https:\/\/doi.org\/10.5281\/zenodo.8134526","DOI":"10.5281\/zenodo.8134526"},{"key":"246_CR7","doi-asserted-by":"publisher","DOI":"10.1145\/3585516","author":"K Bestuzheva","year":"2023","unstructured":"Bestuzheva, K., Besan\u00e7on, M., Chen, W.K., Chmiela, A., Donkiewicz, T., van Doornmalen, J., Eifler, L., Gaul, O., Gamrath, G., Gleixner, A., Gottwald, L., Graczyk, C., Halbig, K., Hoen, A., Hojny, C., van der Hulst, R., Koch, T., L\u00fcbbecke, M., Maher, S., Matter, F., M\u00fchmer, E., M\u00fcller, B., Pfetsch, M., Rehfeldt, D., Schlein, S., Schl\u00f6sser, F., Serrano, F., Shinano, Y., Sofranac, B., Turner, M., Vigerske, S., Wegscheider, F., Wellner, P., Weninger, D., Witzig, J.: Enabling research through the SCIP optimization Suite 8.0. ACM Trans. Math. Softw. (2023). https:\/\/doi.org\/10.1145\/3585516","journal-title":"ACM Trans. Math. Softw."},{"issue":"3","key":"246_CR8","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1287\/ijoc.2019.0900","volume":"32","author":"K Bestuzheva","year":"2020","unstructured":"Bestuzheva, K., Hijazi, H., Coffrin, C.: Convex relaxations for quadratic on\/off constraints and applications to optimal transmission switching. INFORMS J. Comput. 32(3), 682\u2013696 (2020)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"246_CR9","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1287\/ijoc.15.1.114.15159","volume":"15","author":"MR Bussieck","year":"2003","unstructured":"Bussieck, M.R., Drud, A.S., Meeraus, A.: MINLPLib: a collection of test models for mixed-integer nonlinear programming. INFORMS J. Comput. 15(1), 114\u2013119 (2003). https:\/\/doi.org\/10.1287\/ijoc.15.1.114.15159","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"246_CR10","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). https:\/\/doi.org\/10.1007\/s101070050106","journal-title":"Math. Program."},{"issue":"2","key":"246_CR11","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002). https:\/\/doi.org\/10.1007\/s101070100263","journal-title":"Math. Program."},{"issue":"3","key":"246_CR12","doi-asserted-by":"publisher","first-page":"1346","DOI":"10.1109\/TPWRS.2008.922256","volume":"23","author":"EB Fisher","year":"2008","unstructured":"Fisher, E.B., O\u2019Neill, R.P., Ferris, M.C.: Optimal transmission switching. IEEE Trans. Power Syst. 23(3), 1346\u20131355 (2008). https:\/\/doi.org\/10.1109\/TPWRS.2008.922256","journal-title":"IEEE Trans. Power Syst."},{"issue":"3","key":"246_CR13","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1007\/s10589-015-9787-8","volume":"63","author":"A Frangioni","year":"2016","unstructured":"Frangioni, A., Furini, F., Gentile, C.: Approximated perspective relaxations: a project and lift approach. Comput. Optim. Appl. 63(3), 705\u2013735 (2016). https:\/\/doi.org\/10.1007\/s10589-015-9787-8","journal-title":"Comput. Optim. Appl."},{"issue":"5","key":"246_CR14","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1016\/j.orl.2017.08.001","volume":"45","author":"A Frangioni","year":"2017","unstructured":"Frangioni, A., Furini, F., Gentile, C.: Improving the approximated projected perspective reformulation by dual information. Oper. Res. Lett. 45(5), 519\u2013524 (2017)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"246_CR15","doi-asserted-by":"publisher","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(2), 225\u2013236 (2006). https:\/\/doi.org\/10.1007\/s10107-005-0594-3","journal-title":"Math. Program."},{"issue":"2","key":"246_CR16","doi-asserted-by":"publisher","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":"246_CR17","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1016\/j.orl.2009.02.003","journal-title":"Oper. Res. Lett."},{"issue":"5","key":"246_CR18","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1287\/opre.1110.0930","journal-title":"Oper. Res."},{"issue":"1","key":"246_CR19","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1287\/moor.2018.0969","volume":"45","author":"A Frangioni","year":"2020","unstructured":"Frangioni, A., Gentile, C., Hungerford, J.: Decompositions of semidefinite matrices and the perspective reformulation of nonseparable quadratic programs. Math. Oper. Res. 45(1), 15\u201333 (2020)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"246_CR20","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s12532-018-0147-4","volume":"11","author":"F Furini","year":"2019","unstructured":"Furini, F., Traversi, E., Belotti, P., Frangioni, A., Gleixner, A., Gould, N., Liberti, L., Lodi, A., Misener, R., Mittelmann, H., et al.: QPLIB: a library of quadratic programming instances. Math. Program. Comput. 11(2), 237\u2013265 (2019)","journal-title":"Math. Program. Comput."},{"issue":"2","key":"246_CR21","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s10589-020-00176-0","volume":"76","author":"KC Furman","year":"2020","unstructured":"Furman, K.C., Sawaya, N.W., Grossmann, I.E.: A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function. Comput. Optim. Appl. 76(2), 589\u2013614 (2020)","journal-title":"Comput. Optim. Appl."},{"key":"246_CR22","unstructured":"Gamrath, G., Anderson, D., Bestuzheva, K., Chen, W.K., Eifler, L., Gasse, M., Gemander, P., Gleixner, A., Gottwald, L., Halbig, K., et\u00a0al.: The SCIP Optimization Suite 7.0. ZIB-Report 20-10, Zuse Institute Berlin (2020)"},{"issue":"1","key":"246_CR23","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s10107-020-01508-y","volume":"188","author":"A G\u00f3mez","year":"2021","unstructured":"G\u00f3mez, A.: Strong formulations for conic quadratic optimization with indicator variables. Math. Program. 188(1), 193\u2013226 (2021)","journal-title":"Math. Program."},{"issue":"1","key":"246_CR24","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1023\/A:1025154322278","volume":"26","author":"IE Grossmann","year":"2003","unstructured":"Grossmann, I.E., Lee, S.: Generalized convex disjunctive programming: Nonlinear convex hull relaxation. Comput. Optim. Appl. 26(1), 83\u2013100 (2003). https:\/\/doi.org\/10.1023\/A:1025154322278","journal-title":"Comput. Optim. Appl."},{"issue":"1\u20132","key":"246_CR25","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10107-010-0360-z","volume":"124","author":"O G\u00fcnl\u00fck","year":"2010","unstructured":"G\u00fcnl\u00fck, O., Linderoth, J.: Perspective reformulations of mixed integer nonlinear programs with indicator variables. Math. Program. 124(1\u20132), 183\u2013205 (2010). https:\/\/doi.org\/10.1007\/s10107-010-0360-z","journal-title":"Math. Program."},{"key":"246_CR26","doi-asserted-by":"publisher","unstructured":"G\u00fcnl\u00fck, O., Linderoth, J.: Perspective reformulation and applications. In: J.\u00a0Lee, S.\u00a0Leyffer (eds.) Mixed Integer Nonlinear Programming, pp. 61\u201389. Springer, New York, NY (2012). https:\/\/doi.org\/10.1007\/978-1-4614-1927-3_3","DOI":"10.1007\/978-1-4614-1927-3_3"},{"key":"246_CR27","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1016\/j.endm.2010.05.146","volume":"36","author":"H Hijazi","year":"2010","unstructured":"Hijazi, H., Bonami, P., Cornu\u00e9jols, G., Ouorou, A.: Mixed integer nonlinear programs featuring \u201con\/off\u2019\u2019 constraints: convex analysis and applications. Electron. Notes Discrete Math. 36, 1153\u20131160 (2010)","journal-title":"Electron. Notes Discrete Math."},{"issue":"2","key":"246_CR28","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s10589-011-9424-0","volume":"52","author":"H Hijazi","year":"2012","unstructured":"Hijazi, H., Bonami, P., Cornu\u00e9jols, G., Ouorou, A.: Mixed-integer nonlinear programs featuring \u201con\/off\u2019\u2019 constraints. Comput. Optim. Appl. 52(2), 537\u2013558 (2012)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"246_CR29","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1137\/0108053","volume":"8","author":"JE Kelley Jr","year":"1960","unstructured":"Kelley, J.E., Jr.: The cutting-plane method for solving convex programs. J. Soc. Ind. Appl. Math. 8(4), 703\u2013712 (1960). https:\/\/doi.org\/10.1137\/0108053","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"1\u20132","key":"246_CR30","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10107-011-0496-5","volume":"137","author":"A Khajavirad","year":"2013","unstructured":"Khajavirad, A., Sahinidis, N.V.: Convex envelopes generated from finitely many compact convex sets. Math. Program. 137(1\u20132), 371\u2013408 (2013)","journal-title":"Math. Program."},{"key":"246_CR31","doi-asserted-by":"publisher","unstructured":"Lodi, A., Tramontani, A.: Performance variability in mixed-integer programming. In: Theory Driven by Influential Applications, pp. 1\u201312. INFORMS (2013). https:\/\/doi.org\/10.1287\/educ.2013.0112","DOI":"10.1287\/educ.2013.0112"},{"key":"246_CR32","unstructured":"Rockafellar, R.T.: Convex analysis. Princeton University Press (2015)"},{"key":"246_CR33","doi-asserted-by":"crossref","unstructured":"Salgado, E., Gentile, C., Liberti, L.: Perspective cuts for the ACOPF with generators. In: New Trends in Emerging Complex Real Life Problems, pp. 451\u2013461. Springer (2018)","DOI":"10.1007\/978-3-030-00473-6_48"},{"key":"246_CR34","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-319-96151-4_31","volume-title":"Combinatorial Optimization","author":"E Salgado","year":"2018","unstructured":"Salgado, E., Scozzari, A., Tardella, F., Liberti, L.: Alternating current optimal power flow with generator selection. In: Lee, J., Rinaldi, G., Mahjoub, A.R. (eds.) Combinatorial Optimization, pp. 364\u2013375. Springer International Publishing, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96151-4_31"},{"issue":"3","key":"246_CR35","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(3), 515\u2013532 (1999). https:\/\/doi.org\/10.1007\/s101070050103","journal-title":"Math. Program."},{"issue":"1\u20132","key":"246_CR36","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s10107-010-0374-6","volume":"124","author":"M Tawarmalani","year":"2010","unstructured":"Tawarmalani, M., Richard, J.P.P., Chung, K.: Strong valid inequalities for orthogonal disjunctions and bilinear covering sets. Math. Program. 124(1\u20132), 481\u2013512 (2010)","journal-title":"Math. Program."},{"issue":"2","key":"246_CR37","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10107-002-0308-z","volume":"93","author":"M Tawarmalani","year":"2002","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Convex extensions and envelopes of lower semi-continuous functions. Math. Program. 93(2), 247\u2013263 (2002). https:\/\/doi.org\/10.1007\/s10107-002-0308-z","journal-title":"Math. Program."},{"issue":"1","key":"246_CR38","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). https:\/\/doi.org\/10.1007\/s10107-004-0559-y","journal-title":"Math. Program."},{"issue":"1","key":"246_CR39","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF01588974","volume":"14","author":"HP Williams","year":"1978","unstructured":"Williams, H.P.: The reformulation of two mixed integer programming problems. Math. Program. 14(1), 325\u2013331 (1978). https:\/\/doi.org\/10.1007\/BF01588974","journal-title":"Math. Program."},{"issue":"4","key":"246_CR40","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1287\/ijoc.2014.0592","volume":"26","author":"X Zheng","year":"2014","unstructured":"Zheng, X., Sun, X., Li, D.: Improving the performance of MIQP solvers for quadratic programs with cardinality and minimum threshold constraints: A semidefinite program approach. INFORMS J. Comput. 26(4), 690\u2013703 (2014)","journal-title":"INFORMS J. Comput."}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-023-00246-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12532-023-00246-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-023-00246-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,14]],"date-time":"2023-10-14T14:11:49Z","timestamp":1697292709000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12532-023-00246-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,21]]},"references-count":40,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["246"],"URL":"https:\/\/doi.org\/10.1007\/s12532-023-00246-4","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,21]]},"assertion":[{"value":"4 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The code is publicly available at .","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}