{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:17:26Z","timestamp":1740107846118,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,9,28]],"date-time":"2018-09-28T00:00:00Z","timestamp":1538092800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","award":["SB\/EMEQ - 049\/2014"],"award-info":[{"award-number":["SB\/EMEQ - 049\/2014"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s00500-018-3547-5","type":"journal-article","created":{"date-parts":[[2018,9,28]],"date-time":"2018-09-28T21:56:27Z","timestamp":1538171787000},"page":"197-210","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Duality-based branch\u2013bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem"],"prefix":"10.1007","volume":"23","author":[{"name":"Fellow\u00a0of\u00a0IEEE and\u00a0Fellow\u00a0of\u00a0SCS","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deepika","family":"Agarwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pitam","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deepak","family":"Bhati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saru","family":"Kumari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad S.","family":"Obaidat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,28]]},"reference":[{"key":"3547_CR1","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1006\/jmaa.2001.7650","volume":"263","author":"HP Benson","year":"2001","unstructured":"Benson HP (2001) Global optimization algorithm for the non-linear sum of ratios problem. J Math Anal Appl 263:301\u2013315","journal-title":"J Math Anal Appl"},{"issue":"1","key":"3547_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1013072027218","volume":"112","author":"HP Benson","year":"2002","unstructured":"Benson HP (2002) Global optimization algorithm for the non-linear sum of ratios problem. J Optim Theory Appl 112(1):1\u201329","journal-title":"J Optim Theory Appl"},{"key":"3547_CR3","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 (2007a) A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratio problem. Eur J Oper Res 182:597\u2013611","journal-title":"Eur J Oper Res"},{"key":"3547_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10957-007-9199-8","volume":"135","author":"HP Benson","year":"2007","unstructured":"Benson HP (2007b) Solving sum of ratios fractional programs via concave minimization. J Optim Theory Appl 135:1\u201317","journal-title":"J Optim Theory Appl"},{"key":"3547_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 algorithms for sum-of-ratios fractional programs. J Optim Theory Appl 146:1\u201318","journal-title":"J Optim Theory Appl"},{"key":"3547_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-016-2243-6","author":"D Bhati","year":"2016","unstructured":"Bhati D, Singh P (2016) Branch and bound computational method for multi-objective linear fractional optimization problem. Neural Comput Appl. https:\/\/doi.org\/10.1007\/s00521-016-2243-6","journal-title":"Neural Comput Appl"},{"key":"3547_CR7","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s10957-008-9499-7","volume":"141","author":"HJ Chen","year":"2009","unstructured":"Chen HJ (2009) Generic algorithm for generalized fractional programming. J Optim Theory Appl 141:93\u2013105","journal-title":"J Optim Theory Appl"},{"key":"3547_CR8","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1023\/A:1008316327038","volume":"19","author":"RW Freund","year":"2001","unstructured":"Freund RW, Jarre F (2001) Solving the sum-of-ratios problem by an interior-point method. J Glob Optim 19:83\u2013102","journal-title":"J Glob Optim"},{"key":"3547_CR9","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/276245","author":"Y Gao","year":"2013","unstructured":"Gao Y, Jin S (2013) A global optimization algorithm for sum of linear ratios problem. J Appl Math. https:\/\/doi.org\/10.1155\/2013\/276245","journal-title":"J Appl Math"},{"key":"3547_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03199-5","volume-title":"Global optimization: deterministic approaches","author":"R Horst","year":"1996","unstructured":"Horst R, Tuy H (1996) Global optimization: deterministic approaches. Springer, Berlin"},{"key":"3547_CR11","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1016\/j.cam.2010.01.013","volume":"234","author":"M Jaberipour","year":"2010","unstructured":"Jaberipour M, Khorram E (2010) Solving the sum-of-ratios problem by a harmony search algorithm. J Comput Appl Math 234:733\u2013742","journal-title":"J Comput Appl Math"},{"key":"3547_CR12","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":"3547_CR13","doi-asserted-by":"crossref","first-page":"1812","DOI":"10.1016\/j.amc.2006.11.047","volume":"188","author":"H Jiao","year":"2007","unstructured":"Jiao H, Shen P (2007) A note on the paper global optimization of non-linear sum of ratios. Appl Math Comput 188:1812\u20131815","journal-title":"Appl Math Comput"},{"key":"3547_CR14","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/103569","author":"L Jin","year":"2014","unstructured":"Jin L, Hou XP (2014) Global optimization for a class non-linear sum of ratios problems. Probl Eng. https:\/\/doi.org\/10.1155\/2014\/103569","journal-title":"Probl Eng"},{"key":"3547_CR15","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s10957-007-9284-z","volume":"135","author":"H Kanno","year":"2007","unstructured":"Kanno H, Tsuchiya K, Yamamoto R (2007) Minimization of ratio of function defined as sum of the absolute values. J Optim Theory Appl 135:399\u2013410","journal-title":"J Optim Theory Appl"},{"key":"3547_CR16","doi-asserted-by":"crossref","first-page":"1624","DOI":"10.1016\/j.amc.2006.12.034","volume":"189","author":"SJ Qu","year":"2007","unstructured":"Qu SJ, Zhang KC, Zhao JK (2007) An efficient algorithm for globally minimizing sum of quadratics ratios problem with non-convex quadratics constraints. Appl Math Comput 189:1624\u20131636","journal-title":"Appl Math Comput"},{"key":"3547_CR17","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800240416","volume":"24","author":"S Schaible","year":"1977","unstructured":"Schaible S (1977) A note on the sum of a linear and linear fractional functions. Naval Res Logist Q 24:61\u2013963","journal-title":"Naval Res Logist Q"},{"issue":"2","key":"3547_CR18","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1080\/1055678031000105242","volume":"18","author":"S Schaible","year":"2003","unstructured":"Schaible S, Shi J (2003) Fractional programming: the sum-of-ratio case. Optim Method Softw 18(2):219\u2013229","journal-title":"Optim Method Softw"},{"issue":"1","key":"3547_CR19","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1023\/A:1022693032053","volume":"98","author":"CH Scott","year":"1998","unstructured":"Scott CH, Jefferson TR (1998) Duality of non-convex sum of ratios. J Optim Theory Appl 98(1):151\u2013159","journal-title":"J Optim Theory Appl"},{"key":"3547_CR20","doi-asserted-by":"publisher","first-page":"2396","DOI":"10.1016\/j.apm.2009.11.006","volume":"34","author":"PP Shen","year":"2010","unstructured":"Shen PP, Jin L (2010) Using canonical partition to globally maximizing the non-linear sum of ratios. Appl Math Model 34:2396\u20132413","journal-title":"Appl Math Model"},{"key":"3547_CR21","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/j.amc.2005.09.047","volume":"176","author":"PP Shen","year":"2006","unstructured":"Shen PP, Wang CF (2006) Global optimization for sum of ratios problem with coefficient. Appl Math Comput 176:219\u2013229","journal-title":"Appl Math Comput"},{"key":"3547_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 generalization fractional functions. J Comput Appl Math 214:1\u201312","journal-title":"J Comput Appl Math"},{"key":"3547_CR23","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/j.amc.2009.02.024","volume":"212","author":"PP Shen","year":"2009","unstructured":"Shen PP, Chen Y, Yuan M (2009a) Solving sum of quadratic ratios fractional programs via monotonic function. Appl Math Comput 212:234\u2013244","journal-title":"Appl Math Comput"},{"key":"3547_CR24","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.cam.2008.01.003","volume":"223","author":"PP Shen","year":"2009","unstructured":"Shen PP, Duan YP, Pei YG (2009b) A simplicial branch and duality bound algorithm for the sum of convex\u2013convex ratios problem. J Comput Appl Math 223:145\u2013158","journal-title":"J Comput Appl Math"},{"key":"3547_CR25","doi-asserted-by":"publisher","first-page":"2301","DOI":"10.1016\/j.cor.2013.03.012","volume":"40","author":"PP Shen","year":"2013","unstructured":"Shen PP, Li W, Bai X (2013) Maximizing for the sum of ratios of two convex functions over a convex set. Comput Oper Res 40:2301\u20132307","journal-title":"Comput Oper Res"},{"issue":"3","key":"3547_CR26","first-page":"289","volume":"12","author":"P Singh","year":"2012","unstructured":"Singh P, Dutta D (2012) Sum of ratios multi-objective programming problem: a fuzzy goal programming approach. Nonlinear Dyn Syst Theory 12(3):289\u2013302","journal-title":"Nonlinear Dyn Syst Theory"},{"unstructured":"Singh S, Gupta P (2010) On multiparametric analysis in sum-of-ratios programming. In: Proceeding of the international multiconference of engineers and computer scientist, IMECS-2010, Hong Kong, 17\u201319 Mar 2010","key":"3547_CR27"},{"key":"3547_CR28","first-page":"319","volume":"158","author":"YJ Wang","year":"2004","unstructured":"Wang YJ, Zhang KC (2004) Global optimization of non-linear sum of ratios problem. Appl Math Appl 158:319\u2013330","journal-title":"Appl Math Appl"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-018-3547-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3547-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3547-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,2]],"date-time":"2022-09-02T23:34:09Z","timestamp":1662161649000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-018-3547-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,28]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["3547"],"URL":"https:\/\/doi.org\/10.1007\/s00500-018-3547-5","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2018,9,28]]},"assertion":[{"value":"28 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"All the authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}