{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T18:53:48Z","timestamp":1768503228360,"version":"3.49.0"},"reference-count":48,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12461053"],"award-info":[{"award-number":["12461053"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004772","name":"Ningxia Natural Science Foundation","doi-asserted-by":"crossref","award":["2023AAC03287"],"award-info":[{"award-number":["2023AAC03287"]}],"id":[{"id":"10.13039\/501100004772","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Construction Project of First-Class Subjects in Ningxia Higher Education","award":["NXYLXK2017B09"],"award-info":[{"award-number":["NXYLXK2017B09"]}]},{"name":"Major Proprietary Funded Project of North Minzu University","award":["ZDZX201901"],"award-info":[{"award-number":["ZDZX201901"]}]},{"name":"Basic Discipline Research","award":["NJZQJCXK202201"],"award-info":[{"award-number":["NJZQJCXK202201"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Asia Pac. J. Oper. Res."],"published-print":{"date-parts":[[2026,2]]},"abstract":"<jats:p>This paper introduces a branch-relaxation-bound algorithm (BRBA) designed to minimize a class of sum of affine ratios programming (SARP) problems. By leveraging the structural characteristics of SARP, we present a novel relaxation technique that facilitates the construction of a sequence of affine relaxation problems. To optimize computational efficiency, the branching operation is conducted in the output space whose dimension is equal to the number of denominators. By integrating the branch-and-bound framework with affine relaxation problems, a branch-relaxation-bound algorithm is developed. Subsequently, we demonstrate the convergence of the algorithm and discuss its computational complexity. Finally, numerical experiments confirm the feasibility and effectiveness of the proposed algorithm.<\/jats:p>","DOI":"10.1142\/s0217595925500113","type":"journal-article","created":{"date-parts":[[2025,4,20]],"date-time":"2025-04-20T22:50:07Z","timestamp":1745189407000},"source":"Crossref","is-referenced-by-count":0,"title":["Branch-Relaxation-Bound Algorithm for Minimizing a Class of Sum of Affine Ratios Programming Problems"],"prefix":"10.1142","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2833-3523","authenticated-orcid":false,"given":"Xiaoli","family":"Huang","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, Ningxia University, Yinchuan, Ningxia 750021, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohua","family":"Ma","sequence":"additional","affiliation":[{"name":"Ningxia Collaborative Innovation Center for Scientific Computing and Intelligent Information Processing, North Minzu University, Yinchuan, Ningxia 750021, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2021-2097","authenticated-orcid":false,"given":"Yuelin","family":"Gao","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Ningxia University, Yinchuan, Ningxia 750021, P. R. China"},{"name":"Ningxia Collaborative Innovation Center for Scientific Computing and Intelligent Information Processing, North Minzu University, Yinchuan, Ningxia 750021, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7903-3304","authenticated-orcid":false,"given":"Xia","family":"Liu","sequence":"additional","affiliation":[{"name":"Ningxia Collaborative Innovation Center for Scientific Computing and Intelligent Information Processing, North Minzu University, Yinchuan, Ningxia 750021, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2025,4,21]]},"reference":[{"key":"S0217595925500113BIB001","first-page":"359","volume":"69","author":"Almogy Y","year":"1970","journal-title":"Operational Research"},{"key":"S0217595925500113BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2015.06.089"},{"key":"S0217595925500113BIB003","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOTA.0000026129.07165.5a"},{"key":"S0217595925500113BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.08.036"},{"key":"S0217595925500113BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-010-9647-8"},{"key":"S0217595925500113BIB006","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-016-2243-6"},{"key":"S0217595925500113BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.03.025"},{"key":"S0217595925500113BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2013.04.005"},{"key":"S0217595925500113BIB009","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800090303"},{"key":"S0217595925500113BIB010","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-005-5485-2"},{"key":"S0217595925500113BIB011","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008316327038"},{"key":"S0217595925500113BIB012","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/276245"},{"key":"S0217595925500113BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2024.114757"},{"key":"S0217595925500113BIB014","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2010.01.013"},{"key":"S0217595925500113BIB015","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/3584494"},{"key":"S0217595925500113BIB016","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2015.01.039"},{"key":"S0217595925500113BIB017","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2022.112701"},{"key":"S0217595925500113BIB018","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008376731013"},{"key":"S0217595925500113BIB019","doi-asserted-by":"publisher","DOI":"10.15807\/jorsj.39.295"},{"key":"S0217595925500113BIB020","doi-asserted-by":"publisher","DOI":"10.1007\/BF00120666"},{"key":"S0217595925500113BIB021","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1520-6750(199908)46:5<583::AID-NAV8>3.0.CO;2-5"},{"key":"S0217595925500113BIB022","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013807129844"},{"key":"S0217595925500113BIB023","doi-asserted-by":"publisher","DOI":"10.1007\/s40314-021-01614-3"},{"key":"S0217595925500113BIB024","doi-asserted-by":"publisher","DOI":"10.3390\/math7090867"},{"key":"S0217595925500113BIB025","doi-asserted-by":"publisher","DOI":"10.1137\/1037046"},{"key":"S0217595925500113BIB026","doi-asserted-by":"publisher","DOI":"10.1007\/BF00121658"},{"key":"S0217595925500113BIB027","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2020.1730834"},{"key":"S0217595925500113BIB028","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.106234"},{"key":"S0217595925500113BIB029","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2018.10.038"},{"key":"S0217595925500113BIB030","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2005.09.047"},{"key":"S0217595925500113BIB031","doi-asserted-by":"publisher","DOI":"10.4236\/ojop.2017.61001"},{"key":"S0217595925500113BIB032","volume-title":"Mathematical Programming with Type-I Functions","author":"Stancu AM","year":"2013"},{"key":"S0217595925500113BIB033","first-page":"159","volume":"40","author":"Stancu-Minasian I","year":"1980","journal-title":"Operations Research-Verfahren"},{"key":"S0217595925500113BIB034","first-page":"415","volume":"25","author":"Stancu-Minasian I","year":"1981","journal-title":"Bulletin math\u00e9matique de la Soci\u00e9t\u00e9 des Sciences Math\u00e9matiques de la R\u00e9publique Socialiste de Roumanie"},{"key":"S0217595925500113BIB035","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-0035-6"},{"key":"S0217595925500113BIB036","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2019.1632250"},{"key":"S0217595925500113BIB037","volume-title":"Programarea frac\u0163ionar\u0103 cu mai multe func\u0163ii-obiectiv","author":"Stancu-Minasian I","year":"2011"},{"key":"S0217595925500113BIB038","doi-asserted-by":"publisher","DOI":"10.1023\/A:1023274721632"},{"key":"S0217595925500113BIB039","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2008.06.045"},{"key":"S0217595925500113BIB040","first-page":"6174352","volume":"2020","author":"Wang Z","year":"2020","journal-title":"Mathematical Problems in Engineering"},{"key":"S0217595925500113BIB041","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2017.11.010"},{"key":"S0217595925500113BIB042","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.05.013"},{"key":"S0217595925500113BIB043","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.2990176"},{"key":"S0217595925500113BIB044","doi-asserted-by":"publisher","DOI":"10.1002\/aic.14185"},{"key":"S0217595925500113BIB045","doi-asserted-by":"publisher","DOI":"10.1142\/S0217595922500105"},{"key":"S0217595925500113BIB046","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2022.2027940"},{"key":"S0217595925500113BIB047","first-page":"352","volume":"28","author":"Zhang Y","year":"2020","journal-title":"Engineering Letters"},{"key":"S0217595925500113BIB048","doi-asserted-by":"publisher","DOI":"10.1515\/math-2018-0049"}],"container-title":["Asia-Pacific Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0217595925500113","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T04:27:45Z","timestamp":1768451265000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0217595925500113"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,21]]},"references-count":48,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["10.1142\/S0217595925500113"],"URL":"https:\/\/doi.org\/10.1142\/s0217595925500113","relation":{},"ISSN":["0217-5959","1793-7019"],"issn-type":[{"value":"0217-5959","type":"print"},{"value":"1793-7019","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,21]]},"article-number":"2550011"}}