{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:44:00Z","timestamp":1775018640931,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,7,28]],"date-time":"2023-07-28T00:00:00Z","timestamp":1690502400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,28]],"date-time":"2023-07-28T00:00:00Z","timestamp":1690502400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"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"]}]},{"name":"Basic discipline research projects supported by Nanjing Securities","award":["NJZQJCXK202201"],"award-info":[{"award-number":["NJZQJCXK202201"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1007\/s11075-023-01591-0","type":"journal-article","created":{"date-parts":[[2023,7,28]],"date-time":"2023-07-28T10:02:38Z","timestamp":1690538558000},"page":"839-858","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Interval division and linearization algorithm for minimax linear fractional program"],"prefix":"10.1007","volume":"95","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":[[2023,7,28]]},"reference":[{"issue":"2","key":"1591_CR1","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(2), 307\u2013317 (2011)","journal-title":"Optim. Lett."},{"key":"1591_CR2","volume-title":"Generalized concavity","author":"M Avriel","year":"1998","unstructured":"Avriel, M., Diewert, W.E., Schaible, S., Zang, I.: Generalized concavity. Concepts and Methods in Science and Engineering. Plenum Press, New York (1998)"},{"issue":"1","key":"1591_CR3","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1002\/nav.3800100123","volume":"10","author":"A Charnes","year":"1963","unstructured":"Charnes, A., Cooper, W.W.: Programming with linear fractional functionals. Nav. Res. Log. 10(1), 273\u2013274 (1963)","journal-title":"Nav. Res. Log."},{"issue":"7","key":"1591_CR4","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(7), 492\u2013498 (1967)","journal-title":"Manage. Sci."},{"issue":"3","key":"1591_CR5","doi-asserted-by":"publisher","first-page":"106234","DOI":"10.1016\/j.cie.2019.106234","volume":"140","author":"B Ozkok","year":"2020","unstructured":"Ozkok, B.: An iterative algorithm to solve a linear fractional programming problem. Comput. Ind. Eng. 140(3), 106234\u201311062347 (2020)","journal-title":"Comput. Ind. Eng."},{"issue":"4","key":"1591_CR6","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(4), 325\u2013338 (1983)","journal-title":"Eur. J. Oper. Res."},{"issue":"8","key":"1591_CR7","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":"1591_CR8","doi-asserted-by":"publisher","first-page":"806","DOI":"10.4028\/www.scientific.net\/KEM.460-461.806","volume":"460","author":"QG 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 Engin. Mater. 460, 806\u2013809 (2011). https:\/\/doi.org\/10.4028\/www.scientific.net\/KEM.460-461.806","journal-title":"Key Engin. Mater."},{"issue":"12","key":"1591_CR9","doi-asserted-by":"publisher","first-page":"5511","DOI":"10.1016\/j.jfranklin.2014.10.001","volume":"351","author":"X Lu","year":"2014","unstructured":"Lu, X., Shi, W., Zhou, W.: Decomposition based least squares iterative estimation algorithm for two-input single-output output error systems. J. Franklin I. 351(12), 5511\u20135522 (2014)","journal-title":"J. Franklin I."},{"issue":"10","key":"1591_CR10","doi-asserted-by":"publisher","first-page":"2001","DOI":"10.1080\/00207160.2010.537329","volume":"88","author":"P Balasubramaniam","year":"2011","unstructured":"Balasubramaniam, P., Lakshmanan, S.: Delay-interval-dependent robust-stability criteria for neutral stochastic neural networks with polytopic and linear fractional uncertainties. Int. J. Comput. Math. 88(10), 2001\u20132015 (2011)","journal-title":"Int. J. Comput. Math."},{"issue":"7","key":"1591_CR11","doi-asserted-by":"publisher","first-page":"4798","DOI":"10.1016\/j.apm.2012.10.014","volume":"37","author":"F Ding","year":"2013","unstructured":"Ding, F.: Two-stage least squares based iterative estimation algorithm for CARARMA system modeling. Appl. Math. Model. 37(7), 4798\u20134808 (2013)","journal-title":"Appl. Math. Model."},{"issue":"4","key":"1591_CR12","doi-asserted-by":"publisher","first-page":"1694","DOI":"10.1016\/j.apm.2012.04.039","volume":"37","author":"F Ding","year":"2012","unstructured":"Ding, F., Ding, J.: Hierarchical multi-innovation stochastic gradient algorithm for Hammerstein nonlinear system modeling. Appl. Math. Model. 37(4), 1694\u20131704 (2012)","journal-title":"Appl. Math. Model."},{"issue":"2","key":"1591_CR13","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1049\/iet-cta.2012.0313","volume":"7","author":"F Ding","year":"2013","unstructured":"Ding, F., Liu, X., Chu, J.: Gradient-based and least-squares-based iterative algorithms for Hammerstein systems using the hierarchical identification principle. IET Control Theory Appl. 7(2), 176\u2013184 (2013)","journal-title":"IET Control Theory Appl."},{"issue":"16","key":"1591_CR14","doi-asserted-by":"publisher","first-page":"3458","DOI":"10.1080\/00207160.2011.598514","volume":"88","author":"W Wang","year":"2011","unstructured":"Wang, W., Li, J., Ding, R.: Maximum likelihood parameter algorithm for controlled autoregressive autoregressive models. Int. J. Comput. Math. 88(16), 3458\u20133467 (2011)","journal-title":"Int. J. Comput. Math."},{"issue":"1","key":"1591_CR15","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF00941314","volume":"47","author":"JP Crouzeix","year":"1985","unstructured":"Crouzeix, J.P., Ferland, J.A., Schaible, S.: An algorithm for generalized fractional programs. J. Optim. Theory Appl. 47(1), 35\u201349 (1985)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"1591_CR16","first-page":"101","volume":"32","author":"Y Benadada","year":"1988","unstructured":"Benadada, Y., Ferland, J.A.: Partial linearization for generalized fractional programming. Z. Oper. Res. 32(2), 101\u2013106 (1988)","journal-title":"Z. Oper. Res."},{"issue":"3","key":"1591_CR17","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(3), 229\u2013259 (2003)","journal-title":"J. Global Optim."},{"issue":"1","key":"1591_CR18","first-page":"125","volume":"85","author":"RW Freund","year":"1995","unstructured":"Freund, R.W., Jarre, F.: An interior-point method for fractional programs with convex constraints. Math. Program. 85(1), 125\u2013161 (1995)","journal-title":"Math. Program."},{"issue":"1","key":"1591_CR19","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BF02192043","volume":"87","author":"AI Barros","year":"1995","unstructured":"Barros, A.I., Frenk, H.: Generalized fractional programming and cutting plane algorithms. J. Optim. Theory Appl. 87(1), 103\u2013120 (1995)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1591_CR20","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1023\/A:1004660917684","volume":"107","author":"A Roubi","year":"2000","unstructured":"Roubi, A.: Method of centers for generalized fractional programming. J. Optim. Theory Appl. 107(1), 123\u2013143 (2000)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1591_CR21","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF01258607","volume":"31","author":"J Borde","year":"1987","unstructured":"Borde, J., Crouzeix, J.P.: Convergence of a Dinkelbach-type algorithm in generalized fractional programming. Math. Method. Oper. Res. 31(1), 31\u201354 (1987)","journal-title":"Math. Method. Oper. Res."},{"issue":"2","key":"1591_CR22","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s10957-005-4717-z","volume":"126","author":"JY Lin","year":"2005","unstructured":"Lin, J.Y., Sheu, R.L.: Modified Dinkelbach-type algorithm for generalized fractional programs with infinitely many ratios. J. Optim. Theory Appl. 126(2), 323\u2013343 (2005)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1591_CR23","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1023\/A:1021759318653","volume":"99","author":"M Gugat","year":"1998","unstructured":"Gugat, M.: Prox-regularization methods for generalized fractional programming. J. Optim. Theory Appl. 99(3), 691\u2013722 (1998)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"1591_CR24","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. Intern. J. Comput. Intel. Sys. 4(2), 134\u2013141 (2011)","journal-title":"Intern. J. Comput. Intel. Sys."},{"issue":"1","key":"1591_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2022.112682","volume":"164","author":"HW Jiao","year":"2022","unstructured":"Jiao, H.W., Liu, B.B.: Solving min-max linear fractional programs based on image space branch-and-bound scheme. Chaos Soliton. Fract. 164(1), 112682 (2022)","journal-title":"Chaos Soliton. Fract."},{"issue":"8","key":"1591_CR26","doi-asserted-by":"publisher","first-page":"1730","DOI":"10.1080\/00207160.2013.860449","volume":"91","author":"HW Jiao","year":"2014","unstructured":"Jiao, H.W., Liu, S.Y.: A new linearization technique for minimax linear fractional programming. Intern. J. Comp. Math. 91(8), 1730\u20131743 (2014)","journal-title":"Intern. J. Comp. Math."},{"issue":"1","key":"1591_CR27","first-page":"113","volume":"38","author":"CF Wang","year":"2018","unstructured":"Wang, C.F., Jiang, Y., Shen, P.P.: A new branch-and-bound algorithm for solving minimax linear fractional programming. J. Math. 38(1), 113\u2013123 (2018)","journal-title":"J. Math."},{"issue":"X1","key":"1591_CR28","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1515\/math-2017-0072","volume":"15","author":"Y Zhao","year":"2017","unstructured":"Zhao, Y., Liu, S., Jiao, H.: A new branch and bound algorithm for minimax ratios problems. Open Math. 15(X1), 840\u2013851 (2017)","journal-title":"Open Math."},{"issue":"4","key":"1591_CR29","doi-asserted-by":"publisher","first-page":"840","DOI":"10.3934\/jimo.2018128","volume":"15","author":"H Boualam","year":"2019","unstructured":"Boualam, H., Roubi, A.: Dual algorithms based on the proximal bundle method for solving convex minimax fractional programs. J. Ind. Manag. Optim. 15(4), 840\u2013851 (2019)","journal-title":"J. Ind. Manag. Optim."},{"issue":"1","key":"1591_CR30","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s10957-008-9499-7","volume":"141","author":"H Chen","year":"2009","unstructured":"Chen, H., Schaible, S., Sheu, R.: Generic algorithm for generalized fractional programming. J. Optim. Theory Appl. 141(1), 93\u2013105 (2009)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"1591_CR31","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10898-017-0523-z","volume":"69","author":"H Boualam","year":"2017","unstructured":"Boualam, H., Roubi, A.: Dual method of centers for solving generalized fractional programs. J. Global Optim. 69(2), 387\u2013426 (2017)","journal-title":"J. Global Optim."},{"issue":"4","key":"1591_CR32","first-page":"1","volume":"2020","author":"A Ghazi","year":"2020","unstructured":"Ghazi, A., Roubi, A.: A DC approach for minimax fractional optimization programs with ratios of convex functions. Optim. Methods Softw. 2020(4), 1\u201319 (2020)","journal-title":"Optim. Methods Softw."},{"key":"1591_CR33","doi-asserted-by":"publisher","first-page":"878","DOI":"10.1016\/j.cam.2013.06.044","volume":"255","author":"S Gupta","year":"2014","unstructured":"Gupta, S., Dangar, D.: On second-order duality for nondifferentiable minimax fractional programming. J. Comput. Appl. Math. 255, 878\u2013886 (2014). https:\/\/doi.org\/10.1016\/j.cam.2013.06.044","journal-title":"J. Comput. Appl. Math."},{"key":"1591_CR34","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1016\/j.amc.2013.10.050","volume":"227","author":"T Antczak","year":"2014","unstructured":"Antczak, T., Zalmai, G.: Second order $$\\Phi,\\rho -V$$-invexity and duality for semi-infinite minimax fractional programming. Appl. Math. Comput. 227, 831\u2013856 (2014). https:\/\/doi.org\/10.1016\/j.amc.2013.10.050","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"1591_CR35","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"N Sahinidis","year":"1996","unstructured":"Sahinidis, N.: BARON: a general purpose global optimization software package. J. Global Optim. 8(2), 201\u2013205 (1996)","journal-title":"J. Global Optim."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-023-01591-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-023-01591-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-023-01591-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T08:12:13Z","timestamp":1705479133000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-023-01591-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,28]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["1591"],"URL":"https:\/\/doi.org\/10.1007\/s11075-023-01591-0","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,28]]},"assertion":[{"value":"4 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 July 2023","order":3,"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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}