{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T05:07:21Z","timestamp":1778821641472,"version":"3.51.4"},"reference-count":33,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12301401"],"award-info":[{"award-number":["12301401"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012490","name":"North Minzu University","doi-asserted-by":"publisher","award":["2024QNPY16"],"award-info":[{"award-number":["2024QNPY16"]}],"id":[{"id":"10.13039\/501100012490","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational and Applied Mathematics"],"published-print":{"date-parts":[[2026,11]]},"DOI":"10.1016\/j.cam.2026.117688","type":"journal-article","created":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T08:25:08Z","timestamp":1775895908000},"page":"117688","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A global optimization approach utilizing nonlinear relaxation for sum-of-linear-ratios problems"],"prefix":"10.1016","volume":"486","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0604-5918","authenticated-orcid":false,"given":"Bo","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Qiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuelin","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.cam.2026.117688_bib0001","doi-asserted-by":"crossref","DOI":"10.1142\/S0217595922500105","article-title":"An output-space based branch-and-bound algorithm for sum-of-linear-ratios problem","volume":"40","author":"Zhang","year":"2023","journal-title":"Asia-Pac. J. Oper. Res."},{"issue":"6","key":"10.1016\/j.cam.2026.117688_bib0002","doi-asserted-by":"crossref","first-page":"1485","DOI":"10.1080\/02331934.2022.2027940","article-title":"A new deterministic global computing algorithm for solving a kind of linear fractional programming","volume":"72","author":"Zhang","year":"2023","journal-title":"Optimization"},{"key":"10.1016\/j.cam.2026.117688_bib0003","series-title":"Fractional Programming","author":"Schaible","year":"1995"},{"issue":"3","key":"10.1016\/j.cam.2026.117688_bib0004","first-page":"295","article-title":"Bond portfolio optimization problems and their applications to index tracking: a partial optimization approach","volume":"39","author":"Konno","year":"2017","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"10.1016\/j.cam.2026.117688_bib0005","series-title":"Operations Research Proceedings 2011","first-page":"191","article-title":"Downside risk approach for multi-objective portfolio optimization","author":"Sawik","year":"2012"},{"issue":"1","key":"10.1016\/j.cam.2026.117688_bib0006","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2014.02.039","article-title":"Network data envelopment analysis: a review","volume":"239","author":"Kao","year":"2014","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cam.2026.117688_bib0007","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/s10589-012-9488-5","article-title":"A practical but rigorous approach to sum-of-ratios optimization in geometric applications","volume":"54","author":"Kuno","year":"2013","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/j.cam.2026.117688_bib0008","series-title":"NP-Hardness of Linear Multiplicative Programming and Related Problems","volume":"9","author":"Matsui","year":"1996"},{"issue":"Feb","key":"10.1016\/j.cam.2026.117688_bib0009","first-page":"106234.1","article-title":"An iterative algorithm to solve a linear fractional programming problem","volume":"140","author":"Ozkok","year":"2020","journal-title":"Comput. Industr. Eng."},{"issue":"3\u20134","key":"10.1016\/j.cam.2026.117688_bib0010","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/nav.3800090303","article-title":"Programming with linear fractional functionals","volume":"9","author":"Charnes","year":"1962","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/j.cam.2026.117688_bib0011","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF00120666","article-title":"Parametric simplex algorithms for solving a special class of nonconvex minimization problems","volume":"1","author":"Konno","year":"1991","journal-title":"J. Global Optim."},{"issue":"2","key":"10.1016\/j.cam.2026.117688_bib0012","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s10898-019-00870-2","article-title":"Globally minimizing the sum of a convex-concave fraction and a convex function based on wave-curve bounds","volume":"77","author":"Xia","year":"2020","journal-title":"J. Global Optim."},{"key":"10.1016\/j.cam.2026.117688_bib0013","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01585557","article-title":"An interior-point method for generalized linear-fractional programming","volume":"69","author":"Nesterov","year":"2003","journal-title":"Math. Program."},{"key":"10.1016\/j.cam.2026.117688_bib0014","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1023\/A:1008376731013","article-title":"Minimization of the sum of three linear fractional functions","volume":"15","author":"Konno","year":"1999","journal-title":"J. Global Optim."},{"issue":"1","key":"10.1016\/j.cam.2026.117688_bib0015","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1023\/B:JOTA.0000026129.07165.5a","article-title":"On the global optimization of sums of linear fractional functions over a convex set","volume":"121","author":"Benson","year":"2004","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/j.cam.2026.117688_bib0016","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1016\/j.cam.2018.10.038","article-title":"Range division and linearization algorithm for a class of linear ratios optimization problems","volume":"350","author":"Shen","year":"2019","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"10.1016\/j.cam.2026.117688_bib0017","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01096535","article-title":"Image space analysis of generalized fractional programs","volume":"4","author":"Falk","year":"1994","journal-title":"J. Global Optim."},{"issue":"3","key":"10.1016\/j.cam.2026.117688_bib0018","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1023\/A:1023274721632","article-title":"A unified monotonic approach to generalized linear fractional programming","volume":"26","author":"Phuong","year":"2003","journal-title":"J. Global Optim."},{"issue":"5","key":"10.1016\/j.cam.2026.117688_bib0019","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1002\/(SICI)1520-6750(199908)46:5<583::AID-NAV8>3.0.CO;2-5","article-title":"Minimizing sums and products of linear fractional functions over a polytope","volume":"46","author":"Konno","year":"1999","journal-title":"Naval Res. Logist. (NRL)"},{"issue":"2","key":"10.1016\/j.cam.2026.117688_bib0020","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/j.ejor.2006.08.036","article-title":"A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem","volume":"182","author":"Benson","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cam.2026.117688_bib0021","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10957-010-9647-8","article-title":"Branch-and-bound outer approximation algorithm for sum-of- ratios fractional programs","volume":"146","author":"Benson","year":"2010","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"10.1016\/j.cam.2026.117688_bib0022","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/j.orl.2013.04.005","article-title":"A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension","volume":"41","author":"Carlsson","year":"2013","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.cam.2026.117688_bib0023","first-page":"596","article-title":"A branch-and-cut algorithm for a class of sum-of-ratios problems","volume":"268","author":"Ashtiani","year":"2015","journal-title":"Appl. Math. Comput."},{"issue":"3","key":"10.1016\/j.cam.2026.117688_bib0024","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1016\/j.ejor.2015.01.039","article-title":"A practicable branch and bound algorithm for sum of linear ratios problem","volume":"243","author":"Jiao","year":"2015","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cam.2026.117688_bib0025","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s40314-021-01614-3","article-title":"An outcome space algorithm for minimizing a class of linear ratio optimization problems","volume":"40","author":"Liu","year":"2021","journal-title":"Comput. Appl. Math."},{"issue":"9","key":"10.1016\/j.cam.2026.117688_bib0026","doi-asserted-by":"crossref","first-page":"867","DOI":"10.3390\/math7090867","article-title":"A new global optimization algorithm for a class of linear fractional programming","volume":"7","author":"Liu","year":"2019","journal-title":"Mathematics"},{"issue":"9","key":"10.1016\/j.cam.2026.117688_bib0027","article-title":"An efficient algorithm and complexity result for solving the sum of general affine ratios problem","volume":"164","author":"Jiao","year":"2022","journal-title":"Chaos Solitons Fractals"},{"key":"10.1016\/j.cam.2026.117688_bib0028","doi-asserted-by":"crossref","first-page":"1373","DOI":"10.1007\/s11075-022-01471-z","article-title":"A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem","volume":"93","author":"Shen","year":"2023","journal-title":"Numer. Algorithms"},{"issue":"9","key":"10.1016\/j.cam.2026.117688_bib0029","doi-asserted-by":"crossref","first-page":"25396","DOI":"10.3934\/math.20241240","article-title":"A nonlinear relaxation-strategy-based algorithm for solving sum-of-linear-ratios problems","volume":"9","author":"Zhang","year":"2024","journal-title":"AIMS Math."},{"issue":"11","key":"10.1016\/j.cam.2026.117688_bib0030","doi-asserted-by":"crossref","first-page":"2125","DOI":"10.1080\/02331934.2019.1632250","article-title":"A ninth bibliography of fractional programming","volume":"68","author":"Stancu-Minasian","year":"2019","journal-title":"Optimization"},{"issue":"3","key":"10.1016\/j.cam.2026.117688_bib0031","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/s12532-018-0138-5","article-title":"A hybrid LP\/NLP paradigm for global optimization relaxations","volume":"10","author":"Khajavirad","year":"2018","journal-title":"Math. Prog. Comput."},{"issue":"1","key":"10.1016\/j.cam.2026.117688_bib0032","article-title":"A one-dimensional branching rule based branch-and-bound algorithm for minimax linear fractional programming","volume":"448","author":"Shen","year":"2024","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/j.cam.2026.117688_bib0033","unstructured":"I.ILOG, CPLEX: IBM ILOG CPLEX 22.1.1 User\u2019s manual for CPLEX 89, 2011."}],"container-title":["Journal of Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042726003304?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042726003304?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T04:14:07Z","timestamp":1778818447000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377042726003304"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":33,"alternative-id":["S0377042726003304"],"URL":"https:\/\/doi.org\/10.1016\/j.cam.2026.117688","relation":{},"ISSN":["0377-0427"],"issn-type":[{"value":"0377-0427","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A global optimization approach utilizing nonlinear relaxation for sum-of-linear-ratios problems","name":"articletitle","label":"Article Title"},{"value":"Journal of Computational and Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cam.2026.117688","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"117688"}}