{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,29]],"date-time":"2026-07-29T14:45:26Z","timestamp":1785336326725,"version":"3.55.0"},"reference-count":46,"publisher":"Institute for Operations Research and the Management Sciences (INFORMS)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["INFORMS Journal on Computing"],"published-print":{"date-parts":[[2026,5]]},"abstract":"<jats:p>Decision-making processes involving fixed charges arise in various real-world applications and can often be modeled as mixed-integer nonlinear programs (MINLPs) with semicontinuous variables. Perspective reformulation, a technique leveraging perspective functions, offers tight formulations for such MINLPs. In this article, we address the challenge of solving such reformulations by introducing perspective Benders cuts, a family of generalized Benders optimality cuts, and compare them with the classic generalized Benders cuts and the perspective cuts. We focus on their applications to two fixed-charge nonlinear resource allocation problems: a generalized sensor placement problem and a generalized uncapacitated facility location problem. The original quadratic allocation cost functions in these problems are extended to a class of reducible convex functions. By leveraging the reducible property of nonlinear resource allocation problems, we develop an ad-hoc procedure of solving the reduced quadratic subproblems to efficiently separate perspective Benders cuts. These features contribute to a highly efficient branch-and-Benders-cut approach, as demonstrated through extensive computational experiments on various sets of benchmark instances.<\/jats:p>\n                  <jats:p>History: Accepted by Antonio Frangioni, Area Editor for Design &amp; Analysis of Algorithms\u2013Continuous.<\/jats:p>\n                  <jats:p>Funding: K. Yang acknowledges financial support from China Scholarship Council [Grant 202406110031]. This work was also supported by the National Science Fund for Outstanding Young Scholars [Grant 62122093], the National Natural Science Foundation of China [Grants 72101264, 72431011, and 72421002], the Science and Technology Innovation Program of Hunan Province [Grant 2023RC3008], Open Project of Xiangjiang Laboratory [Grant 22XJ02003], and the University Fundamental Research Fund [Grant 23-ZZCX-JDZ-28]. H. Yang\u2019s work is funded by National Natural Science Foundation of China [Grant 72201232 and 72231008], Guangdong Provincial Key Laboratory of Mathematical Foundations for Artificial Intelligence [Grant 2023B1212010001], and Shenzhen Key Laboratory of Crowd Intelligence Empowered Low-Carbon Energy Network [Grant ZDSYS20220606100601002].<\/jats:p>\n                  <jats:p>Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https:\/\/pubsonline.informs.org\/doi\/suppl\/10.1287\/ijoc.2024.0984 ) as well as from the IJOC GitHub software repository ( https:\/\/github.com\/INFORMSJoC\/2024.0984 ). The complete IJOC Software and Data Repository is available at https:\/\/informsjoc.github.io\/ .<\/jats:p>","DOI":"10.1287\/ijoc.2024.0984","type":"journal-article","created":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T09:34:58Z","timestamp":1751967298000},"page":"783-801","source":"Crossref","is-referenced-by-count":2,"title":["Perspective Benders Decomposition with Applications to Fixed-Charge Nonlinear Resource Allocation"],"prefix":"10.1287","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-0081-9395","authenticated-orcid":false,"given":"Kang","family":"Yang","sequence":"first","affiliation":[{"name":"College of Systems Engineering, National University of Defense Technology, Changsha 410073, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6182-5178","authenticated-orcid":false,"given":"Guopeng","family":"Song","sequence":"additional","affiliation":[{"name":"College of Systems Engineering, National University of Defense Technology, Changsha 410073, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9048-2979","authenticated-orcid":false,"given":"Rui","family":"Wang","sequence":"additional","affiliation":[{"name":"College of Systems Engineering, National University of Defense Technology, Changsha 410073, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5291-9834","authenticated-orcid":false,"given":"Haoxiang","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Data Science, The Chinese University of Hong Kong, Shenzhen (CUHK-Shenzhen), Shenzhen 518172, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9215-3914","authenticated-orcid":false,"given":"Roel","family":"Leus","sequence":"additional","affiliation":[{"name":"ORSTAT, Faculty of Economics and Business, KU Leuven, Leuven 3000, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"109","reference":[{"key":"B1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1090.0373"},{"key":"B2","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0398-y"},{"key":"B3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2008.02.013"},{"key":"B4","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2008.12.009"},{"key":"B5","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0339-5"},{"key":"B6","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.26.1.86"},{"key":"B7","doi-asserted-by":"publisher","DOI":"10.1002\/net.20137"},{"key":"B8","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386316"},{"key":"B9","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(88)90159-2"},{"key":"B10","doi-asserted-by":"crossref","unstructured":"Bragalli C, D\u2019Ambrosio C, Lee J, Lodi A, Toth P (2006) An MINLP solution method for a water network problem. Technical Report RC23893 (W0602-210), Research Division, IBM, Yorktown Heights, NY.","DOI":"10.1007\/11841036_62"},{"key":"B11","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1110.0965"},{"key":"B12","doi-asserted-by":"publisher","DOI":"10.1287\/moor.19.1.94"},{"key":"B13","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.26.5.495"},{"key":"B14","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2360143"},{"key":"B15","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2.4.393"},{"key":"B16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.07.002"},{"key":"B17","doi-asserted-by":"crossref","unstructured":"Duguet A, Ngueveu SU (2022) Piecewise linearization of bivariate nonlinear functions: Minimizing the number of pieces under a bounded approximation error.\n                      Internat. Sympos. Combinatorial Optim.\n                      (Springer, Cham, Switzerland), 117\u2013129.","DOI":"10.1007\/978-3-031-18530-4_9"},{"key":"B18","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592064"},{"key":"B19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.03.002"},{"key":"B20","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2016.2461"},{"key":"B21","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581153"},{"key":"B22","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-005-0594-3"},{"key":"B23","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2009.02.003"},{"key":"B24","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-015-9787-8"},{"key":"B25","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2017.08.001"},{"key":"B26","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2008.2004744"},{"key":"B27","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1110.0930"},{"key":"B28","unstructured":"Fujishige S (2005)\n                      Submodular Functions and Optimization\n                      , Annals of Discrete Mathematics, vol. 58, 2nd ed. (Elsevier, Amsterdam)."},{"key":"B29","doi-asserted-by":"publisher","DOI":"10.1007\/BF00934810"},{"key":"B30","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00504-0"},{"key":"B31","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0360-z"},{"key":"B32","unstructured":"G\u00fcnl\u00fck O, Lee J, Weismantel R (2007) MINLP strengthening for separable convex quadratic transportation-cost UFL. Technical Report RC24213 (W703-042), Research Division, IBM, Yorktown Heights, NY."},{"key":"B33","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1120.0545"},{"key":"B34","volume-title":"Grundlehren Der Mathematischen Wissenschaften","volume":"305","author":"Hiriart-Urruty JB","year":"1996"},{"key":"B35","unstructured":"IBM CPLEX Optimizer (2022) CPLEX user\u2019s manual. https:\/\/www.ibm.com\/docs\/en\/icos\/22.1.0?topic=optimizers-users-manual-cplex."},{"key":"B36","doi-asserted-by":"publisher","DOI":"10.1137\/0108053"},{"key":"B37","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0050-z"},{"key":"B38","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-007-9317-7"},{"key":"B39","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(89)90189-6"},{"key":"B40","doi-asserted-by":"publisher","DOI":"10.1051\/ro:2001107"},{"key":"B41","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-022-02144-6"},{"key":"B42","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.10.020"},{"key":"B43","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2015.01.029"},{"key":"B44","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2021.1104"},{"key":"B45","doi-asserted-by":"publisher","DOI":"10.1137\/140978296"},{"key":"B46","doi-asserted-by":"crossref","unstructured":"Yang K, Song G, Wang R, Yang H, Leus R (2025) Perspective Benders decomposition with applications to fixed-charge nonlinear resource allocation. http:\/\/dx.doi.org\/10.1287\/ijoc.2024.0984.cd, https:\/\/github.com\/INFORMSJoC\/2024.0984.","DOI":"10.1287\/ijoc.2024.0984.cd"}],"container-title":["INFORMS Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/pubsonline.informs.org\/doi\/pdf\/10.1287\/ijoc.2024.0984","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T08:54:22Z","timestamp":1781513662000},"score":1,"resource":{"primary":{"URL":"https:\/\/pubsonline.informs.org\/doi\/10.1287\/ijoc.2024.0984"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["10.1287\/ijoc.2024.0984"],"URL":"https:\/\/doi.org\/10.1287\/ijoc.2024.0984","relation":{},"ISSN":["1091-9856","1526-5528"],"issn-type":[{"value":"1091-9856","type":"print"},{"value":"1526-5528","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5]]}}}