{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:44:01Z","timestamp":1775018641684,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"S2","license":[{"start":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T00:00:00Z","timestamp":1756252800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T00:00:00Z","timestamp":1756252800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1007\/s12190-025-02609-7","type":"journal-article","created":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T11:19:32Z","timestamp":1756293572000},"page":"1965-1985","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Globally addressing minmax linear fractional problem"],"prefix":"10.1007","volume":"71","author":[{"given":"Kun","family":"Hou","sequence":"first","affiliation":[]},{"given":"Yan","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Chenglin","family":"He","sequence":"additional","affiliation":[]},{"given":"Hongwei","family":"Jiao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,27]]},"reference":[{"key":"2609_CR1","doi-asserted-by":"crossref","unstructured":"Schaible, S.: Fractional programming. Handb. Global Optim. 495\u2013608 (1995)","DOI":"10.1007\/978-1-4615-2025-2_10"},{"issue":"8-9","key":"2609_CR2","doi-asserted-by":"publisher","first-page":"1405","DOI":"10.1016\/S0165-1889(97)00032-8","volume":"21","author":"C. Maranas","year":"1997","unstructured":"Maranas, C., Androulakis, I., Floudas, C., Berger, A., Mulvey, J.: Solving long-term financial planning problems via global optimization. Journal of Economic Dynamics and Control 21(8-9), 1405\u20131425 (1997)","journal-title":"Journal of Economic Dynamics and Control"},{"issue":"5","key":"2609_CR3","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1016\/j.sigpro.2012.12.013","volume":"93","author":"F. Ding","year":"2013","unstructured":"Ding, F.: Decomposition based fast least squares algorithm for output error systems. Signal Process. 93(5), 1235\u20131242 (2013)","journal-title":"Signal Process."},{"issue":"8","key":"2609_CR4","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1057\/palgrave.jors.2600597","volume":"49","author":"C. Tofallis","year":"1998","unstructured":"Tofallis, C.: Fractional programming: Theory, methods and applications. J Oper Res Soc 49(8), 895\u2013895 (1998)","journal-title":"J Oper Res Soc"},{"key":"2609_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9174-4","volume-title":"Linear-fractional Programming Theory, Methods, Applications and Software.","author":"E.B. Bajalinov","year":"2003","unstructured":"Bajalinov, E.B.: Linear-fractional Programming Theory, Methods, Applications and Software.. Kluwer, Dordrecht (2003)"},{"key":"2609_CR6","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/BF01582229","volume":"67","author":"R.W. Freund","year":"1994","unstructured":"Freund, R.W., Jarre, F.: An interior-point method for fractional programs with convex constraints. Math. Program. 67, 407\u2013440 (1994)","journal-title":"Math. Program."},{"issue":"3","key":"2609_CR7","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.: A eighth bibliography of fractional programming. Optimization. 66(3), 439\u2013470 (2017)","journal-title":"Optimization."},{"key":"2609_CR8","doi-asserted-by":"publisher","first-page":"806","DOI":"10.4028\/www.scientific.net\/KEM.460-461.806","volume":"460","author":"Q.G. Feng","year":"2011","unstructured":"Feng, Q.G., Mao, H.P., Jiao: H.W.: A feasible method for a class of mathematical problems in manufacturing system. Key Eng. Mater. 460, 806\u2013809 (2011)","journal-title":"Key Eng. Mater."},{"issue":"8","key":"2609_CR9","doi-asserted-by":"publisher","first-page":"1730","DOI":"10.1080\/00207160.2013.860449","volume":"91","author":"H. Jiao","year":"2014","unstructured":"Jiao, H., Liu, S.: A new linearization technique for minimax linear fractional programming. Int J Comput Math 91(8), 1730\u20131743 (2014)","journal-title":"Int J Comput Math"},{"key":"2609_CR10","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BF02192043","volume":"87","author":"A. Barros","year":"1995","unstructured":"Barros, A., Frenk, J.B.G.: Generalized fractional programming and cutting plane algorithms. J Optim Theory Appl 87, 103\u2013120 (1995)","journal-title":"J Optim Theory Appl"},{"key":"2609_CR11","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1023\/A:1023274721632","volume":"26","author":"N. Thi Hoai Phuong","year":"2003","unstructured":"Thi Hoai 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."},{"issue":"2","key":"2609_CR12","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF03398807","volume":"45","author":"J.-P. Crouzeix","year":"2008","unstructured":"Crouzeix, J.-P., Ferland, J.A., Van Nguyen, H.: Revisiting dinkelbach-type algorithms for generalized fractional programs. Opsearch 45(2), 97\u2013110 (2008)","journal-title":"Opsearch"},{"key":"2609_CR13","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10957-020-01738-2","volume":"187","author":"K. Boufi","year":"2020","unstructured":"Boufi, K., El Haffari, M., Roubi, A.: Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions. J Optim Theory Appl 187, 105\u2013132 (2020)","journal-title":"J Optim Theory Appl"},{"issue":"9","key":"2609_CR14","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1080\/02331934.2017.1338698","volume":"66","author":"S. Addoune","year":"2017","unstructured":"Addoune, S., El Haffari, M., Roubi, A.: A proximal point algorithm for generalized fractional programs. Optimization 66(9), 1495\u20131517 (2017)","journal-title":"Optimization"},{"issue":"2","key":"2609_CR15","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1007\/s11075-023-01591-0","volume":"95","author":"B. Zhang","year":"2024","unstructured":"Zhang, B., Gao, Y., Liu, X., Huang, X.: Interval division and linearization algorithm for minimax linear fractional program. Numer. Algorithms. 95(2), 839\u2013858 (2024)","journal-title":"Numer. Algorithms."},{"issue":"2","key":"2609_CR16","first-page":"134","volume":"4","author":"Q. Feng","year":"2011","unstructured":"Feng, Q., Jiao, H., Mao, H., Chen, Y.: A deterministic algorithm for min-max and max-min linear fractional programming problems. Int. J. Comput. Int. Sys. 4(2), 134\u2013141 (2011)","journal-title":"Int. J. Comput. Int. Sys."},{"key":"2609_CR17","doi-asserted-by":"publisher","first-page":"115900","DOI":"10.1016\/j.cam.2024.115900","volume":"448","author":"P. Shen","year":"2024","unstructured":"Shen, P., Deng, Y., Wang, Y.: A one-dimensional branching rule based branch-and-bound algorithm for minimax linear fractional programming. J. Comput. Appl. Math. 448, 115900 (2024)","journal-title":"J. Comput. Appl. Math."},{"key":"2609_CR18","doi-asserted-by":"publisher","first-page":"112682","DOI":"10.1016\/j.chaos.2022.112682","volume":"164","author":"H. Jiao","year":"2022","unstructured":"Jiao, H., Li, B.: Solving min-max linear fractional programs based on image space branch-and-bound scheme. Chaos, Solitons Fractals 164, 112682 (2022)","journal-title":"Chaos, Solitons Fractals"},{"issue":"3","key":"2609_CR19","doi-asserted-by":"publisher","first-page":"1523","DOI":"10.1051\/ro\/2023075","volume":"57","author":"H. Jiao","year":"2023","unstructured":"Jiao, H., Wang, W., Ge, L., Shen, P., Shang, Y.: Efficient algorithm for globally computing the min\u2013max linear fractional programming problem. RAIRO-Operations Res. 57(3), 1523\u20131537 (2023)","journal-title":"RAIRO-Operations Res."},{"issue":"1","key":"2609_CR20","first-page":"195","volume":"18","author":"H. Jiao","year":"2022","unstructured":"Jiao, H., Ma, J., Shang, Y.: Image space branch-and-bound algorithm for globally solving minimax linear fractional programming problem. Pac. J. Optim. 18(1), 195\u2013212 (2022)","journal-title":"Pac. J. Optim."},{"key":"2609_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10957-023-02368-0","volume":"201","author":"H. Jiao","year":"2024","unstructured":"Jiao, H., Li, B., Shang, Y.: An outer space approach to tackle generalized affine fractional program problems. J Optim Theory Appl 201, 1\u201335 (2024)","journal-title":"J Optim Theory Appl"},{"key":"2609_CR22","doi-asserted-by":"publisher","first-page":"1787","DOI":"10.1007\/s12190-024-02027-1","volume":"70","author":"H. Jiao","year":"2024","unstructured":"Jiao, H., Sun, Y., Wang, W., Shang, Y.: Global algorithm for effectively solving min-max affine fractional programs. J. Appl. Math. Comput. 70, 1787\u2013181 (2024)","journal-title":"J. Appl. Math. Comput."},{"issue":"1","key":"2609_CR23","doi-asserted-by":"publisher","first-page":"1959","DOI":"10.3934\/math.2023101","volume":"8","author":"J. Ma","year":"2023","unstructured":"Ma, J., Jiao, H., Yin, J., Shang, Y.: Outer space branching search method for solving generalized affine fractional optimization problem. AIMS Mathematics 8(1), 1959\u20131974 (2023)","journal-title":"AIMS Mathematics"},{"issue":"2","key":"2609_CR24","doi-asserted-by":"publisher","first-page":"1578","DOI":"10.1137\/18M1199708","volume":"29","author":"K. Boufi","year":"2019","unstructured":"Boufi, K., Roubi, A.: Duality results and dual bundle methods based on the dual method of centers for minimax fractional programs. SIAM J. Optim. 29(2), 1578\u20131602 (2019)","journal-title":"SIAM J. Optim."},{"key":"2609_CR25","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10898-017-0523-z","volume":"69","author":"K. Boufi","year":"2017","unstructured":"Boufi, K., Roubi, A.: Dual method of centers for solving generalized fractional programs. J. Global Optim. 69, 387\u2013426 (2017)","journal-title":"J. Global Optim."},{"issue":"1","key":"2609_CR26","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/s10957-018-1342-1","volume":"179","author":"S. Addoune","year":"2018","unstructured":"Addoune, S., Boufi, K., Roubi, A.: Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs. J Optim Theory Appl 179(1), 212\u2013239 (2018)","journal-title":"J Optim Theory Appl"},{"key":"2609_CR27","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10898-007-9270-x","volume":"42","author":"J.-J. Strodiot","year":"2008","unstructured":"Strodiot, J.-J., Crouzeix, J.-P., Ferland, J.A., Nguyen, V.H.: An inexact proximal point method for solving generalized fractional programs. J. Global Optim. 42, 121\u2013138 (2008)","journal-title":"J. Global Optim."},{"issue":"2","key":"2609_CR28","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1080\/10556788.2020.1818234","volume":"37","author":"A. Ghazi","year":"2022","unstructured":"Ghazi, A., Roubi, A.: A dc approach for minimax fractional optimization programs with ratios of convex functions. Optim Methods Softw 37(2), 639\u2013657 (2022)","journal-title":"Optim Methods Softw"},{"issue":"4","key":"2609_CR29","doi-asserted-by":"publisher","first-page":"1991","DOI":"10.3934\/jimo.2017028","volume":"13","author":"M. El Haffari","year":"2017","unstructured":"El Haffari, M., Roubi, A.: Prox-dual regularization algorithm for generalized fractional programs. Journal of Industrial and Management Optimization 13(4), 1991\u20132013 (2017)","journal-title":"Journal of Industrial and Management Optimization"},{"issue":"1","key":"2609_CR30","first-page":"113","volume":"38","author":"C. Wang","year":"2018","unstructured":"Wang, C., Jiang, Y., Shen, P.: A new branch-and-bound algorithm for solving minimax linear fractional programming. Pac. J. Math. (PRC) 38(1), 113\u2013123 (2018)","journal-title":"J. Math. (PRC)"},{"key":"2609_CR31","doi-asserted-by":"crossref","unstructured":"Li, B., Gao, Y.: Optimizing the minimax affine fractional problem in reduced space. J. Appl. Math. Comput. 1\u201329 (2025)","DOI":"10.1007\/s12190-025-02427-x"},{"issue":"4","key":"2609_CR32","first-page":"388","volume":"39","author":"H.-M. Wang","year":"2024","unstructured":"Wang, H.-M., Shen, P.-P., Liang, Y.-X.: Branch and bound algorithm for globally solving minimax linear fractional programming. Chin. Q. J. Math. 39(4), 388\u2013398 (2024)","journal-title":"Chin. Q. J. Math."},{"issue":"4","key":"2609_CR33","doi-asserted-by":"publisher","first-page":"3119","DOI":"10.1051\/ro\/2024097","volume":"58","author":"K. Boufi","year":"2024","unstructured":"Boufi, K., Fadil, A., Roubi, A.: Successive upper approximation methods for generalized fractional programs. RAIRO-Operations Res. 58(4), 3119\u20133142 (2024)","journal-title":"RAIRO-Operations Res."},{"issue":"5","key":"2609_CR34","doi-asserted-by":"publisher","first-page":"4221","DOI":"10.1051\/ro\/2024166","volume":"58","author":"J. Yuan","year":"2024","unstructured":"Yuan, J., Li, X.: (g, v)-invexity nondifferentiable generalized minimax fractional programming. RAIRO-Operations Res. 58(5), 4221\u20134234 (2024)","journal-title":"RAIRO-Operations Res."},{"issue":"5","key":"2609_CR35","doi-asserted-by":"publisher","first-page":"2350036","DOI":"10.1142\/S0217595923500367","volume":"41","author":"H. Jiao","year":"2024","unstructured":"Jiao, H., Li, B., Shang, Y.: A novel affine relaxation-based algorithm for minimax affine fractional program. Asia-Pac. J. Oper. Res. 41(5), 2350036 (2024)","journal-title":"Asia-Pac. J. Oper. Res."},{"issue":"2","key":"2609_CR36","first-page":"56","volume":"51","author":"P. Shen","year":"2023","unstructured":"Shen, P., Wang, Y., Wu, D.: Iterative a geometric programming method for solving a class of minimax fractional optimization problems. J. Appl. Psychol. Henan Normal University (Natural Science Edition) 51(2), 56\u201362 (2023)","journal-title":"J. Henan Normal University (Natural Science Edition)"},{"issue":"3","key":"2609_CR37","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s12532-018-0138-5","volume":"10","author":"A. Khajavirad","year":"2018","unstructured":"Khajavirad, A., Sahinidis: N.V.: A hybrid lp\/nlp paradigm for global optimization relaxations. Math. Program. Computation 10(3), 383\u2013421 (2018)","journal-title":"Math. Program. Computation"}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-025-02609-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-025-02609-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-025-02609-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T22:36:09Z","timestamp":1761690969000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-025-02609-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,27]]},"references-count":37,"journal-issue":{"issue":"S2","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["2609"],"URL":"https:\/\/doi.org\/10.1007\/s12190-025-02609-7","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,27]]},"assertion":[{"value":"11 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}