{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T17:44:02Z","timestamp":1773251042567,"version":"3.50.1"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,2,8]],"date-time":"2022-02-08T00:00:00Z","timestamp":1644278400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,8]],"date-time":"2022-02-08T00:00:00Z","timestamp":1644278400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11961001"],"award-info":[{"award-number":["11961001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"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"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s10957-021-01992-y","type":"journal-article","created":{"date-parts":[[2022,2,8]],"date-time":"2022-02-08T16:51:28Z","timestamp":1644339088000},"page":"830-855","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["An Outcome-Space-Based Branch-and-Bound Algorithm for a Class of Sum-of-Fractions Problems"],"prefix":"10.1007","volume":"192","author":[{"given":"Bo","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2021-2097","authenticated-orcid":false,"given":"YueLin","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xia","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"XiaoLi","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,8]]},"reference":[{"key":"1992_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-7600-2","volume-title":"Generalized Concavity","author":"M Avriel","year":"1988","unstructured":"Avriel, M., Diewert, W.E., Schaible, S., Zang, I.: Generalized Concavity. Plenum Publishing Corporation, New York (1988)"},{"key":"1992_CR2","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1023\/B:JOTA.0000026129.07165.5a","volume":"121","author":"HP Benson","year":"2004","unstructured":"Benson, H.P.: On the global optimization of sums of linear fractional functions over a convex set. J. Optim. Theory Appl. 121, 19\u201339 (2004)","journal-title":"J. Optim. Theory Appl."},{"key":"1992_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10107-011-0462-2","volume":"129","author":"X Bao","year":"2011","unstructured":"Bao, X., Sahinidis, N.V., Tawarmalani, M.: Semidefinite relaxations for quadratically constrained quadratic programming: a review and comparisons. Math. Program. 129, 129\u2013157 (2011)","journal-title":"Math. Program."},{"key":"1992_CR4","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1023\/A:1013869015288","volume":"22","author":"HP Benson","year":"2002","unstructured":"Benson, H.P.: Using concave envelopes to globally solve the nonlinear sum of ratios problem. J. Global Optim. 22, 343\u2013364 (2002)","journal-title":"J. Global Optim."},{"key":"1992_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/B:COAP.0000004976.52180.7f","volume":"27","author":"HP Benson","year":"2004","unstructured":"Benson, H.P.: On the construction of convex and concave envelope formulas for bilinear and fractional functions on quadrilaterals. Comput. Optim. Appl. 27, 5\u201322 (2004)","journal-title":"Comput. Optim. Appl."},{"key":"1992_CR6","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01582148","volume":"61","author":"PH Calamai","year":"1993","unstructured":"Calamai, P.H., Vicente, L.N., J\u00fadice, J.J.: A new technique for generating quadratic programming test problems. Math. Program. 61, 215\u2013231 (1993)","journal-title":"Math. Program."},{"key":"1992_CR7","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/j.orl.2013.04.005","volume":"41","author":"JG Carlsson","year":"2013","unstructured":"Carlsson, J.G., Shi, J.: A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension. Ope. Res. Lett. 41, 381\u2013389 (2013)","journal-title":"Ope. Res. Lett."},{"key":"1992_CR8","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/nav.3800090303","volume":"9","author":"A Charnes","year":"2010","unstructured":"Charnes, A., Cooper, W.W.: Programming with linear fractional functionals. Nav. Res. Log. 9, 181\u2013186 (2010)","journal-title":"Nav. Res. Log."},{"key":"1992_CR9","first-page":"467","volume":"44","author":"CS Colantoni","year":"1969","unstructured":"Colantoni, C.S., Manes, R.P., Whinston, A.: Programming, profit rates and pricing decisions. Account. Rev. 44, 467\u2013481 (1969)","journal-title":"Account. Rev."},{"key":"1992_CR10","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1287\/mnsc.13.7.492","volume":"13","author":"W Dinkelbach","year":"1967","unstructured":"Dinkelbach, W.: On nonlinear fractional programming. Manage. Sci. 13, 492\u2013498 (1967)","journal-title":"Manage. Sci."},{"key":"1992_CR11","doi-asserted-by":"crossref","unstructured":"Falk, J.E., Palocsay, S.W.: Optimizing the sum of linear fractional functions. In: Floudas, C.A., Pardalos, P.M. (eds.) Recent Advances in Global Optimization, pp. 221\u2013258. Princeton, Princeton University Press (1992)","DOI":"10.1515\/9781400862528.221"},{"key":"1992_CR12","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF01096535","volume":"4","author":"JE Falk","year":"1994","unstructured":"Falk, J.E., Palocsay, S.W.: Image space analysis of generalized fractional programs. J. Global Optim. 4, 63\u201388 (1994)","journal-title":"J. Global Optim."},{"key":"1992_CR13","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10898-008-9378-7","volume":"45","author":"S-C Fang","year":"2009","unstructured":"Fang, S.-C., Gao, D.Y., Sheu, R.-L., Xing, W.X.: Global optimization for a class of fractional programming problems. J. Global Optim. 45, 337\u2013353 (2009)","journal-title":"J. Global Optim."},{"key":"1992_CR14","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1023\/A:1008316327038","volume":"19","author":"RW Freund","year":"2001","unstructured":"Freund, R.W., Jarre, F.: Solving the sum-of-ratios problem by an interior-point method. J. Global Optim. 19, 83\u2013102 (2001)","journal-title":"J. Global Optim."},{"key":"1992_CR15","first-page":"596","volume":"268","author":"AM Freund","year":"2015","unstructured":"Freund, A.M., Freund, P.A.V.: A branch-and-cut algorithm for a class of sum-of-ratios problems. Appl. Math. Comput. 268, 596\u2013608 (2015)","journal-title":"Appl. Math. Comput."},{"key":"1992_CR16","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0377-2217(94)00034-A","volume":"82","author":"MH Goedhart","year":"1995","unstructured":"Goedhart, M.H., Spronk, J.: Financial planning with fractional goals. Eur. J. Oper. Res. 82, 111\u2013124 (1995)","journal-title":"Eur. J. Oper. Res."},{"key":"1992_CR17","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s11590-010-0232-8","volume":"6","author":"LB Gao","year":"2012","unstructured":"Gao, L.B., Mishra, S.K., Shi, J.M.: An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem. Optim. Lett. 6, 221\u2013230 (2012)","journal-title":"Optim. Lett."},{"key":"1992_CR18","unstructured":"Grant, M., Boyd, S.: CVX: Matlab software for disciplined convex programming. http:\/\/cvxr.com\/cvx\/download, v2.2 (2021)"},{"key":"1992_CR19","unstructured":"Gleixner, A., Eifler, L., Gally, T., Gamrath, G., Gemander, P., Gottwald, R.L., Hendel, G., Hojny, C., Koch, T., Miltenberger, M., M\u00fcller, B., Pfetsch, M-E., Puchert, C., Rehfeldt, D., Schl\u00f6sser, F., Serrano, F., Shinano, Y., Viernickel, J.M., Vigerske, S., Weninger, D., Witt, J-T., Witzig, J.: The SCIP Optimization Suite. https:\/\/www.scipopt.org\/index.php\/download, v5.0.1 (2017)"},{"key":"1992_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0015-5","volume-title":"Introduction to Global Optimization","author":"R Horst","year":"2000","unstructured":"Horst, R., Pardalos, P.M., Thoai, N.V.: Introduction to Global Optimization. Kluwer Academic Publishers, Netherlands (2000)"},{"key":"1992_CR21","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1016\/j.ejor.2015.01.039","volume":"243","author":"HW Jiao","year":"2015","unstructured":"Jiao, H.W., Liu, S.Y.: A practicable branch and bound algorithm for sum of linear ratios problem. Eur. J. Oper. Res. 243, 723\u2013730 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"1992_CR22","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1515\/math-2016-0058","volume":"14","author":"HW Jiao","year":"2016","unstructured":"Jiao, H.W., Liu, S.Y., Yin, J.B., Zhao, Y.F.: Outcome space range reduction method for global optimization of sum of affine ratios problem. Open Math. 14, 736\u2013746 (2016)","journal-title":"Open Math."},{"key":"1992_CR23","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s40314-015-0224-5","volume":"36","author":"HW Jiao","year":"2015","unstructured":"Jiao, H.W., Liu, S.Y.: Range division and compression algorithm for quadratically constrained sum of quadratic ratios. Comput. Appl. Math. 36, 225\u2013247 (2015)","journal-title":"Comput. Appl. Math."},{"key":"1992_CR24","doi-asserted-by":"publisher","first-page":"1426","DOI":"10.1080\/01630563.2017.1327869","volume":"38","author":"HW Jiao","year":"2017","unstructured":"Jiao, H.W., Liu, S.Y.: An efficient algorithm for quadratic sum-of-ratios fractional programs problem. Numer. Func. Anal. Opt. 38, 1426\u20131445 (2017)","journal-title":"Numer. Func. Anal. Opt."},{"key":"1992_CR25","first-page":"295","volume":"39","author":"H Konno","year":"2017","unstructured":"Konno, H., Watanabe, H.: Bond portfolio optimization problems and their applications to index tracking: a partial optimization approach. J. Oper. Res. Soc. Jpn. 39, 295\u2013306 (2017)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"1992_CR26","first-page":"143","volume":"32","author":"H Konno","year":"2017","unstructured":"Konno, H., Inori, M.: Bond portfolio optimization by bilinear fractional programming. J. Oper. Res. Soc. Jpn. 32, 143\u2013158 (2017)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"1992_CR27","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1023\/A:1008376731013","volume":"15","author":"H Konno","year":"1999","unstructured":"Konno, H., Abe, N.: Minimization of the sum of three linear fractional functions. J. Global Optim. 15, 419\u2013432 (1999)","journal-title":"J. Global Optim."},{"key":"1992_CR28","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1002\/(SICI)1520-6750(199908)46:5<583::AID-NAV8>3.0.CO;2-5","volume":"46","author":"H Konno","year":"1999","unstructured":"Konno, H., Yamashita, H.: Minimizing sums and products of linear fractional functions over a polytope. Nav. Res. Log. 46, 583\u2013596 (1999)","journal-title":"Nav. Res. Log."},{"key":"1992_CR29","doi-asserted-by":"crossref","unstructured":"Liu, X., Gao, Y.L., Zhang, B., Tian, F.P.: A new global optimization algorithm for a class of linear fractional programming. Mathematics 7, article number: 867 (2019)","DOI":"10.3390\/math7090867"},{"key":"1992_CR30","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s10898-016-0436-2","volume":"67","author":"C Lu","year":"2017","unstructured":"Lu, C., Deng, Z.B., Jin, Q.W.: An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints. J. Global Optim. 67, 475\u2013493 (2017)","journal-title":"J. Global Optim."},{"key":"1992_CR31","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF00121658","volume":"9","author":"T Matsui","year":"1996","unstructured":"Matsui, T.: NP-hardness of linear multiplicative programming and related problems. J. Global Optim. 9, 113\u2013119 (1996)","journal-title":"J. Global Optim."},{"key":"1992_CR32","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01585557","volume":"69","author":"YE Nesterov","year":"1995","unstructured":"Nesterov, Y.E., Nemirovskii, A.S.: An interior-point method for generalized linear-fractional programming. Math. Program. 69, 177\u2013204 (1995)","journal-title":"Math. Program."},{"key":"1992_CR33","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1023\/A:1023274721632","volume":"26","author":"N Phuong","year":"2003","unstructured":"Phuong, N., Tuy, H.: A unified monotonic approach to generalized linear fractional programming. J. Global Optim. 26, 229\u2013259 (2003)","journal-title":"J. Global Optim."},{"key":"1992_CR34","doi-asserted-by":"publisher","first-page":"2125","DOI":"10.1080\/02331934.2019.1632250","volume":"68","author":"IM Stancu-Minasian","year":"2019","unstructured":"Stancu-Minasian, I.M.: A ninth bibliography of fractional programming. Optimization 68, 2125\u20132169 (2019)","journal-title":"Optimization"},{"key":"1992_CR35","doi-asserted-by":"crossref","unstructured":"Schaible, S.: Fractional programming. In: Horst, R., Pardalos, P.M. (eds.) Handbook of Global Optimization, pp. 495\u2013608. Springer, Boston (1995)","DOI":"10.1007\/978-1-4615-2025-2_10"},{"key":"1992_CR36","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0377-2217(83)90153-4","volume":"12","author":"S Schaible","year":"1983","unstructured":"Schaible, S., Ibaraki, T.: Fractional programming. Eur. J. Oper. Res. 12, 325\u2013338 (1983)","journal-title":"Eur. J. Oper. Res."},{"key":"1992_CR37","first-page":"191","volume":"2011","author":"B Sawik","year":"2012","unstructured":"Sawik, B.: Downside risk approach for multi-objective portfolio optimization. Oper. Res. Proc. 2011, 191\u2013196 (2012)","journal-title":"Oper. Res. Proc."},{"key":"1992_CR38","doi-asserted-by":"crossref","unstructured":"Shen, P.P., Lu, T.: Regional division and reduction algorithm for minimizing the sum of linear fractional functions. J. Inequal. Appl. 2018, article number: 63 (2018)","DOI":"10.1186\/s13660-018-1651-9"},{"key":"1992_CR39","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/j.cam.2018.10.038","volume":"350","author":"PP Shen","year":"2019","unstructured":"Shen, P.P., Huang, B.D., Wang, L.F.: Range division and linearization algorithm for a class of linear ratios optimization problems. J. Comput. Appl. Math. 350, 324\u2013342 (2019)","journal-title":"J. Comput. Appl. Math."},{"key":"1992_CR40","first-page":"234","volume":"212","author":"PP Shen","year":"2009","unstructured":"Shen, P.P., Chen, Y.Q., Ma, Y.: Solving sum of quadratic ratios fractional programs via monotonic function. Appl. Math. Comput. 212, 234\u2013244 (2009)","journal-title":"Appl. Math. Comput."},{"key":"1992_CR41","doi-asserted-by":"publisher","first-page":"2396","DOI":"10.1016\/j.apm.2009.11.006","volume":"34","author":"PP Shen","year":"2010","unstructured":"Shen, P.P., Jin, L.: Using conical partition to globally maximizing the nonlinear sum of ratios. Appl. Math. Model. 34, 2396\u20132413 (2010)","journal-title":"Appl. Math. Model."},{"key":"1992_CR42","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s10898-020-00919-7","volume":"78","author":"PP Shen","year":"2020","unstructured":"Shen, P.P., Wang, K.M., Lu, T.: Outer space branch and bound algorithm for solving linear multiplicative programming problems. J. Global Optim. 78, 453\u2013482 (2020)","journal-title":"J. Global Optim."},{"key":"1992_CR43","first-page":"319","volume":"158","author":"YJ Wang","year":"2004","unstructured":"Wang, Y.J., Zhang, K.C.: Global optimization of nonlinear sum of ratios Problem. Appl. Math. Comput. 158, 319\u2013330 (2004)","journal-title":"Appl. Math. Comput."},{"key":"1992_CR44","doi-asserted-by":"publisher","first-page":"1844","DOI":"10.1137\/18M1164639","volume":"29","author":"LF Wang","year":"2019","unstructured":"Wang, L.F., Xia, Y.: A linear-time algorithm for globally maximizing the sum of a generalized rayleigh quotient and a quadratic form on the unit sphere. SIAM J. Optim. 29, 1844\u20131869 (2019)","journal-title":"SIAM J. Optim."},{"key":"1992_CR45","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s11590-010-0210-1","volume":"5","author":"C Xu","year":"2011","unstructured":"Xu, C., Xu, X.M., Wang, H.F.: The fractional minimal cost flow problem on network. Optim. Lett. 5, 307\u2013317 (2011)","journal-title":"Optim. Lett."},{"key":"1992_CR46","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.orl.2017.11.010","volume":"46","author":"Y Xia","year":"2018","unstructured":"Xia, Y., Wang, L.F., Wang, S.: Minimizing the sum of linear fractional functions over the cone of positive semidefinite matrices: approximation and applications. Ope. Res. Lett. 46, 76\u201380 (2018)","journal-title":"Ope. Res. Lett."},{"key":"1992_CR47","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10589-012-9479-6","volume":"54","author":"LH Zhang","year":"2013","unstructured":"Zhang, L.H.: On optimizing the sum of the Rayleigh quotient and the generalized Rayleigh quotient on the unit sphere. Comput. Optim. Appl. 54, 111\u2013139 (2013)","journal-title":"Comput. Optim. Appl."},{"key":"1992_CR48","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.cam.2013.08.005","volume":"257","author":"LH Zhang","year":"2014","unstructured":"Zhang, L.H.: On a self-consistent-field-like iteration for maximizing the sum of the Rayleigh quotients. J. Comput. Appl. Math. 257, 14\u201328 (2014)","journal-title":"J. Comput. Appl. Math."},{"key":"1992_CR49","doi-asserted-by":"crossref","unstructured":"Zhang, B., Gao, Y.L., Liu, X., Huang, X.L.: Output-space branch-and-bound reduction algorithm for a class of linear multiplicative programs. Mathematics 8, article number: 315 (2020)","DOI":"10.3390\/math8030315"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-021-01992-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-021-01992-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-021-01992-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,24]],"date-time":"2022-10-24T02:11:56Z","timestamp":1666577516000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-021-01992-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,8]]},"references-count":49,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["1992"],"URL":"https:\/\/doi.org\/10.1007\/s10957-021-01992-y","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,8]]},"assertion":[{"value":"5 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 December 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}