{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T18:25:28Z","timestamp":1775931928060,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T00:00:00Z","timestamp":1629676800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T00:00:00Z","timestamp":1629676800000},"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":"crossref","award":["11602184"],"award-info":[{"award-number":["11602184"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61373174"],"award-info":[{"award-number":["61373174"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61877046"],"award-info":[{"award-number":["61877046"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s40314-021-01614-3","type":"journal-article","created":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T16:50:05Z","timestamp":1629737405000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["An outcome space algorithm for minimizing a class of linear ratio optimization problems"],"prefix":"10.1007","volume":"40","author":[{"given":"Sanyang","family":"Liu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2104-3379","authenticated-orcid":false,"given":"Li","family":"Ge","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,23]]},"reference":[{"key":"1614_CR1","first-page":"359","volume":"69","author":"Y Almogy","year":"1970","unstructured":"Almogy Y, Levin O (1970) Parametric analysis of a multi-stage stochastic shipping problem. Oper Res 69:359\u2013370","journal-title":"Oper Res"},{"key":"1614_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9174-4","volume-title":"Linear-fractional programming: theory, methods, applications, and software","author":"EB Bajalinov","year":"2003","unstructured":"Bajalinov EB (2003) Linear-fractional programming: theory, methods, applications, and software. Kluwer Academic Publishers, Dordrecht"},{"key":"1614_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/B:COAP.0000004976.52180.7f","volume":"27","author":"HP Benson","year":"2004","unstructured":"Benson HP (2004) On the construction of convex and concave envelope formulas for bilinear and fractional functions on quadrilaterals. Comput Optim Appl 27:5\u201322","journal-title":"Comput Optim Appl"},{"key":"1614_CR4","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/j.ejor.2006.08.036","volume":"182","author":"HP Benson","year":"2007","unstructured":"Benson HP (2007) A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem. Eur J Oper Res 182:597\u2013611","journal-title":"Eur J Oper Res"},{"key":"1614_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10957-010-9647-8","volume":"146","author":"HP Benson","year":"2010","unstructured":"Benson HP (2010) Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs. J Optim Theory Appl 146:1\u201318","journal-title":"J Optim Theory Appl"},{"key":"1614_CR6","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s10107-009-0309-2","volume":"128","author":"D Depetrini","year":"2011","unstructured":"Depetrini D, Locatelli M (2011) Approximation of linear fractional-multiplicative problems. Math Program 128:437\u2013443","journal-title":"Math Program"},{"key":"1614_CR7","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF01096535","volume":"4","author":"JE Falk","year":"1994","unstructured":"Falk JE, Palocsay SW (1994) Image space analysis of generalized fractional programs. J Glob Optim 4:63\u201388","journal-title":"J Glob Optim"},{"key":"1614_CR8","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1023\/A:1008316327038","volume":"19","author":"RW Freund","year":"1999","unstructured":"Freund RW, Jarre F (1999) Solving the sum-of-ratios problem by an interior-point method. J Glob Optim 19:83\u2013102","journal-title":"J Glob Optim"},{"key":"1614_CR9","first-page":"37","volume":"1","author":"JJ Jian","year":"1995","unstructured":"Jian JJ, Jian LF (1995) Polynomial time algorithms for linear fractional programming. J Guangxi Univ Natl 1:37\u201342","journal-title":"J Guangxi Univ Natl"},{"key":"1614_CR10","doi-asserted-by":"publisher","first-page":"1113","DOI":"10.1016\/j.na.2008.02.005","volume":"70","author":"HW Jiao","year":"2009","unstructured":"Jiao HW (2009) A branch and bound algorithm for globally solving a class of nonconvex programming problems. Nonlinear Anal 70:1113\u20131123","journal-title":"Nonlinear Anal"},{"key":"1614_CR11","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1016\/j.ejor.2015.01.039","volume":"243","author":"HW Jiao","year":"2015","unstructured":"Jiao HW, Liu SY (2015) A practicable branch and bound algorithm for sum of linear ratios problem. Eur J Oper Res 243:723\u2013730","journal-title":"Eur J Oper Res"},{"key":"1614_CR12","doi-asserted-by":"publisher","first-page":"1426","DOI":"10.1080\/01630563.2017.1327869","volume":"38","author":"HW Jiao","year":"2017","unstructured":"Jiao HW, Liu SY (2017a) An efficient algorithm for quadratic sum-of-ratios fractional programs problem. Numer Funct Anal Optim 38:1426\u20131445","journal-title":"Numer Funct Anal Optim"},{"key":"1614_CR13","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s40314-015-0224-5","volume":"36","author":"HW Jiao","year":"2017","unstructured":"Jiao HW, Liu SY (2017b) Range division and compression algorithm for quadratically constrained sum of quadratic ratios. Comput Appl Math 36:225\u2013247","journal-title":"Comput Appl Math"},{"key":"1614_CR14","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.apm.2012.02.023","volume":"37","author":"HW Jiao","year":"2013","unstructured":"Jiao HW, Wang ZK, Chen YQ (2013) Global optimization algorithm for sum of generalized polynomial ratios problem. Appl Math Model 37:187\u2013197","journal-title":"Appl Math Model"},{"key":"1614_CR15","doi-asserted-by":"publisher","first-page":"7568","DOI":"10.1016\/j.apm.2015.03.025","volume":"39","author":"HW Jiao","year":"2015","unstructured":"Jiao HW, Liu SY, Zhao YF (2015) Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints. Appl Math Model 39:7568\u20137582","journal-title":"Appl Math Model"},{"key":"1614_CR16","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1515\/math-2016-0058","volume":"14","author":"HW Jiao","year":"2016","unstructured":"Jiao HW, Liu SY, Yin JB, Zhao YF (2016) Outcome space range reduction method for global optimization of sum of affine ratios problem. Open Math 14:736\u2013746","journal-title":"Open Math"},{"key":"1614_CR17","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 (1999) Minimizing sums and products of linear fractional functions over a polytope. Nav Res Logist 46:583\u2013596","journal-title":"Nav Res Logist"},{"key":"1614_CR18","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1023\/A:1013807129844","volume":"22","author":"T Kuno","year":"2002","unstructured":"Kuno T (2002) A branch-and-bound algorithm for maximizing the sum of several linear ratios. J Glob Optim 22:155\u2013174","journal-title":"J Glob Optim"},{"key":"1614_CR19","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF00121658","volume":"9","author":"T Matsui","year":"1996","unstructured":"Matsui T (1996) NP-hardness of linear multiplicative programming and related problems. J Glob Optim 9:113\u2013119","journal-title":"J Glob Optim"},{"key":"1614_CR20","first-page":"177","volume":"69","author":"YE Nesterov","year":"1995","unstructured":"Nesterov YE, Nemirovskii AS (1995) An interior-point method for generalized linear-fractional programming. Math Program 69:177\u2013204","journal-title":"Math Program"},{"key":"1614_CR21","first-page":"219","volume":"176","author":"PP Shen","year":"2006","unstructured":"Shen PP, Wang CF (2006) Global optimization for sum of linear ratios problem with coefficients. Appl Math Comput 176:219\u2013229","journal-title":"Appl Math Comput"},{"key":"1614_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cam.2007.01.022","volume":"214","author":"PP Shen","year":"2008","unstructured":"Shen PP, Wang CF (2008) Global optimization for sum of generalized fractional functions. J Comput Appl Math 214:1\u201312","journal-title":"J Comput Appl Math"},{"key":"1614_CR23","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/j.cam.2018.10.038","volume":"350","author":"PP Shen","year":"2019","unstructured":"Shen PP, Huang BD, Wang LF (2019) Range division and linearization algorithm for a class of linear ratios optimization problems. J Comput Appl Math 350:324\u2013342","journal-title":"J Comput Appl Math"},{"key":"1614_CR24","first-page":"281","volume":"204","author":"CF Wang","year":"2008","unstructured":"Wang CF, Shen PP (2008) A global optimization algorithm for linear fractional programming. Appl Math Comput 204:281\u2013287","journal-title":"Appl Math Comput"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-021-01614-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-021-01614-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-021-01614-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,24]],"date-time":"2021-09-24T17:38:29Z","timestamp":1632505109000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-021-01614-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,23]]},"references-count":24,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["1614"],"URL":"https:\/\/doi.org\/10.1007\/s40314-021-01614-3","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,23]]},"assertion":[{"value":"5 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 August 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 August 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"225"}}