{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,8]],"date-time":"2025-06-08T04:03:23Z","timestamp":1749355403858,"version":"3.41.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T00:00:00Z","timestamp":1723420800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T00:00:00Z","timestamp":1723420800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"PFCT","award":["UIDB\/05037\/2020"],"award-info":[{"award-number":["UIDB\/05037\/2020"]}]},{"DOI":"10.13039\/501100005727","name":"Universidade de Coimbra","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100005727","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2025,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Multiobjective linear fractional programming is useful to model multiobjective problems where all or some of the objective functions are a ratio or proportion of one linear\/affine function to another linear\/affine function. In practice, many of such problems include integer variables. If the weighted-sum scalarization is used to compute efficient solutions to the multiobjective problem, then the scalar problem to be solved for each weight vector turns out to be a weighted sum-of-ratios. There are several algorithms reported in the literature to optimize weighted sum-of-ratios, but almost all of them cannot deal with integer variables. In this paper we propose a Branch &amp; Cut algorithm to optimize weighted-sums of the objective functions in multiobjective mixed integer fractional programming (MOMIFP). Several theoretical properties that support the algorithm are presented and proved. Computational experiments with randomly generated general problems are presented and discussed, which show that the algorithm is able to deal with practical MOMIFP problems.<\/jats:p>","DOI":"10.1007\/s00291-024-00782-y","type":"journal-article","created":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T20:06:00Z","timestamp":1723493160000},"page":"667-695","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A branch and cut algorithm to optimize a weighted sum-of-ratios in multiobjective mixed-integer fractional programming"],"prefix":"10.1007","volume":"47","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5204-3916","authenticated-orcid":false,"given":"Jo\u00e3o Paulo","family":"Costa","sequence":"first","affiliation":[]},{"given":"Maria Jo\u00e3o","family":"Alves","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,12]]},"reference":[{"issue":"103\u2013104","key":"782_CR1","first-page":"15","volume":"32","author":"M Abbas","year":"2002","unstructured":"Abbas M, Moulai M (2002) Integer linear fractional programming with multiple objective. J Italian Oper Res Soc 32(103\u2013104):15\u201338","journal-title":"J Italian Oper Res Soc"},{"key":"782_CR2","first-page":"596","volume":"268","author":"A Ashtiani","year":"2015","unstructured":"Ashtiani A, Ferreira P (2015) A branch-and-cut algorithm for a class of sum-of-ratios problems. Appl Math Comput 268:596\u2013608","journal-title":"Appl Math Comput"},{"key":"782_CR3","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/j.ejor.2006.08.036","volume":"182","author":"H Benson","year":"2007","unstructured":"Benson H (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":"782_CR4","first-page":"53","volume":"1","author":"S Bhatt","year":"1981","unstructured":"Bhatt S (1981) Linearization technique for linear fractional and pseudo-monotonic programs revisited. Cah CERO 1:53\u201356","journal-title":"Cah CERO"},{"key":"782_CR5","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF01415516","volume":"33","author":"S Bhatt","year":"1989","unstructured":"Bhatt S (1989) Equivalence of various linearization algorithms for linear fractional programming. Z F\u00fcr Oper Res - Methods Model Oper Res 33:39\u201343","journal-title":"Z F\u00fcr Oper Res - Methods Model Oper Res"},{"key":"782_CR6","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1287\/opre.24.4.675","volume":"24","author":"G Bitran","year":"1976","unstructured":"Bitran G, Noaves A (1976) Linear programming with a fractional objective function. Oper Res 24:675\u2013699","journal-title":"Oper Res"},{"key":"782_CR7","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10898-016-0487-4","volume":"69","author":"JS Borrero","year":"2017","unstructured":"Borrero JS, Gillen C, Prokopyev OA (2017) Fractional 0\u20131 programming: applications and algorithms. J Glob Optim 69:255\u2013282","journal-title":"J Glob Optim"},{"key":"782_CR8","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/nav.3800090303","volume":"9","author":"A Charnes","year":"1962","unstructured":"Charnes A, Cooper W (1962) Programming with linear fractional functionals. Naval Res Logist Q 9:181\u2013186","journal-title":"Naval Res Logist Q"},{"key":"782_CR9","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1155\/2008\/760191","volume":"2008","author":"ME-A Chergui","year":"2008","unstructured":"Chergui ME-A, Moul\u00e4i M (2008) An exact method for a discrete multiobjective linear fractional optimization. J Appl Math Decis Sci 2008:12","journal-title":"J Appl Math Decis Sci"},{"key":"782_CR10","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/s00291-004-0191-5","volume":"27","author":"J Costa","year":"2005","unstructured":"Costa J (2005) An interactive method for multiple objective linear fractional programming problems. Or Spectr 27:633\u2013652","journal-title":"Or Spectr"},{"key":"782_CR11","doi-asserted-by":"publisher","first-page":"1464","DOI":"10.1016\/j.ejor.2005.11.051","volume":"181","author":"J Costa","year":"2007","unstructured":"Costa J (2007) Computing non-dominated solution in MOLFP. Eur J Oper Res 181:1464\u20131475","journal-title":"Eur J Oper Res"},{"issue":"1","key":"782_CR12","first-page":"21","volume":"6","author":"J Costa","year":"2010","unstructured":"Costa J (2010) A Branch & Cut technique to solve a weighted-sum of linear ratios. Pac J Optim 6(1):21\u201338","journal-title":"Pac J Optim"},{"key":"782_CR13","doi-asserted-by":"publisher","unstructured":"Ghildyal V, Sahinidis NV (2001) Solving global optimization problems with baron. In: Migdalas A, Pardalos PM, V\u00e4rbrand P (eds), From local to global optimization, Nonconvex optimization and its applications. vol 53. Springer, Boston, MA, https:\/\/doi.org\/10.1007\/978-1-4757-5284-7_10","DOI":"10.1007\/978-1-4757-5284-7_10"},{"issue":"4","key":"782_CR14","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1080\/02331939508844157","volume":"35","author":"R Gupta","year":"1995","unstructured":"Gupta R, Malhotra R (1995) Multi-criteria integer linear fractional programming problem. Optim 35(4):373\u2013389","journal-title":"Optim"},{"key":"782_CR15","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1002\/nav.3800030108","volume":"3","author":"J Isbell","year":"1956","unstructured":"Isbell J, Marlow W (1956) Attrition games. Naval Res Logist Q 3:71\u201393","journal-title":"Naval Res Logist Q"},{"key":"782_CR16","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1016\/j.ejor.2015.01.039","volume":"243","author":"H-W Jiao","year":"2015","unstructured":"Jiao H-W, Liu S-Y (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"},{"issue":"3","key":"782_CR17","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.ejor.2013.08.001","volume":"232","author":"G Kirlik","year":"2014","unstructured":"Kirlik G, Sayin S (2014) A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems. Eur J Oper Res 232(3):479\u2013488","journal-title":"Eur J Oper Res"},{"issue":"2","key":"782_CR18","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10898-012-9955-7","volume":"57","author":"B Lokman","year":"2013","unstructured":"Lokman B, K\u00f6ksalan M (2013) Finding all nondominated points of multiobjective integer programs. J Global Optim 57(2):347\u2013365","journal-title":"J Global Optim"},{"key":"782_CR19","first-page":"1","volume":"12","author":"O Mangasarian","year":"1969","unstructured":"Mangasarian O (1969) Non-linear fractional programming. J Oper Res Jpn 12:1\u201310","journal-title":"J Oper Res Jpn"},{"key":"782_CR20","first-page":"7","volume":"2014","author":"MA Mehdi","year":"2014","unstructured":"Mehdi MA, Chergui ME-A, Abbas M (2014) An Improved method for solving multiobjective integer linear fractional programming problem. Adv Decis Sci 2014:7","journal-title":"Adv Decis Sci"},{"key":"782_CR21","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10898-019-00817-7","volume":"75","author":"E Mehmanchi","year":"2019","unstructured":"Mehmanchi E, G\u00f3mez A, Prokopyev O (2019) Fractional 0\u20131 programs: links between mixed-integer linear and conic quadratic formulations. J Glob Optim 75:273\u2013339","journal-title":"J Glob Optim"},{"key":"782_CR22","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s10107-005-0585-4","volume":"103","author":"A Neumaier","year":"2005","unstructured":"Neumaier A, Shcherbina O, Huyer W et al (2005) A comparison of complete global optimization solvers. Math Program 103:335\u2013356. https:\/\/doi.org\/10.1007\/s10107-005-0585-4","journal-title":"Math Program"},{"issue":"12","key":"782_CR23","doi-asserted-by":"publisher","first-page":"2302","DOI":"10.1287\/mnsc.1100.1248","volume":"56","author":"\u00d6 \u00d6zpeynirci","year":"2010","unstructured":"\u00d6zpeynirci \u00d6, K\u00f6ksalan M (2010) An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs. Manage Sci 56(12):2302\u20132315","journal-title":"Manage Sci"},{"issue":"3","key":"782_CR24","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.disopt.2010.03.005","volume":"7","author":"A Przybylski","year":"2010","unstructured":"Przybylski A, Gandibleux X, Ehrgott M (2010) A two phase method for multi- objective integer programming and its application to the assignment problem with three objectives. Discret Optim 7(3):149\u2013165","journal-title":"Discret Optim"},{"key":"782_CR25","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-Ratios Case. Optim Method Softw 18:219\u2013229","journal-title":"Optim Method Softw"},{"issue":"2","key":"782_CR26","first-page":"1","volume":"4","author":"S Sharma","year":"2011","unstructured":"Sharma S, Bansal A (2011) An integer solution of fractional programming problem. General Math Note 4(2):1\u20139","journal-title":"General Math Note"},{"key":"782_CR27","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/j.cam.2018.10.038","volume":"350","author":"P-P Shen","year":"2019","unstructured":"Shen P-P, Huang B, Wang L (2019a) 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":"782_CR28","first-page":"1","volume":"63","author":"P Shen","year":"2018","unstructured":"Shen P, Lu T (2018) Regional division and reduction algorithm for minimizing the sum of linear fractional functions. J Inequal Appl 63:1\u201319","journal-title":"J Inequal Appl"},{"issue":"1","key":"782_CR29","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.ejor.2019.03.014","volume":"278","author":"P-P Shen","year":"2019","unstructured":"Shen P-P, Zhu Z, Chen X (2019b) A practicable contraction approach for the sum of the generalized polynomial ratios problem. Eur J Oper Res 278(1):36\u201348","journal-title":"Eur J Oper Res"},{"key":"782_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-0035-6","volume-title":"Fractional programming: theory, methods and applications","author":"I Stancu-Minasian","year":"1997","unstructured":"Stancu-Minasian I (1997) Fractional programming: theory, methods and applications. Kluwer Academic Publishers, Dordrecht, The Netherlands"},{"issue":"2","key":"782_CR31","first-page":"309","volume":"15","author":"I Stancu-Minasian","year":"2013","unstructured":"Stancu-Minasian I (2013) A seventh bibliography of fractional programming. Adv Model Optim 15(2):309\u2013386","journal-title":"Adv Model Optim"},{"issue":"3","key":"782_CR32","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1080\/02331934.2016.1276179","volume":"66","author":"I Stancu-Minasian","year":"2017","unstructured":"Stancu-Minasian I (2017) A eight bibliography of fractional programming. Optimization 66(3):439\u2013470","journal-title":"Optimization"},{"issue":"11","key":"782_CR33","doi-asserted-by":"publisher","first-page":"2123","DOI":"10.1080\/02331934.2019.1632250","volume":"68","author":"I Stancu-Minasian","year":"2019","unstructured":"Stancu-Minasian I (2019) A ninth bibliography of fractional programming. Optimization 68(11):2123\u20132167","journal-title":"Optimization"},{"key":"782_CR34","volume-title":"Multiple criteria optimization: theory, computation and application","author":"R Steuer","year":"1986","unstructured":"Steuer R (1986) Multiple criteria optimization: theory, computation and application. Wiley, New York"},{"issue":"1","key":"782_CR35","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/S0377-2217(03)00255-8","volume":"158","author":"J Sylva","year":"2004","unstructured":"Sylva J, Crema A (2004) A method for finding the set of non-dominated vectors for multiple objective integer linear programs. Eur J Oper Res 158(1):46\u201355","journal-title":"Eur J Oper Res"},{"issue":"1","key":"782_CR36","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/S0377-2217(96)00258-5","volume":"101","author":"T-H Wu","year":"1997","unstructured":"Wu T-H (1997) A note on a global approach for general 0\u20131 fractional. Eur J Oper Res 101(1):220\u2013223","journal-title":"Eur J Oper Res"},{"issue":"50","key":"782_CR37","first-page":"2451","volume":"5","author":"O Zerdani","year":"2011","unstructured":"Zerdani O, Moulai M (2011) Optimization over an integer efficient set of a multiple objective linear fractional problem. Appl Math Sci 5(50):2451\u20132466","journal-title":"Appl Math Sci"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-024-00782-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00291-024-00782-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-024-00782-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T19:18:15Z","timestamp":1749323895000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00291-024-00782-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,12]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["782"],"URL":"https:\/\/doi.org\/10.1007\/s00291-024-00782-y","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"type":"print","value":"0171-6468"},{"type":"electronic","value":"1436-6304"}],"subject":[],"published":{"date-parts":[[2024,8,12]]},"assertion":[{"value":"4 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}