{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T09:00:09Z","timestamp":1776416409105,"version":"3.51.2"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T00:00:00Z","timestamp":1750809600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T00:00:00Z","timestamp":1750809600000},"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":["12301401"],"award-info":[{"award-number":["12301401"]}],"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":"Construction Project of first-class subjects in Ningxia higher Education","award":["NXYLXK2017B09"],"award-info":[{"award-number":["NXYLXK2017B09"]}]},{"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":[[2026,5]]},"DOI":"10.1007\/s11075-025-02137-2","type":"journal-article","created":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T05:25:49Z","timestamp":1750829149000},"page":"467-504","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Output-space branch-and-bound algorithm adopting an adaptive branching rule for solving general linear fractional-multiplicative programs"],"prefix":"10.1007","volume":"102","author":[{"given":"Suxia","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuelin","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,25]]},"reference":[{"issue":"2","key":"2137_CR1","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1080\/03052159508941259","volume":"25","author":"MC Dorneich","year":"1995","unstructured":"Dorneich, M.C., Sahinidis, N.V.: Global optimization algorithms for chip layout and compaction. Eng. Optimiz. 25(2), 131\u2013154 (1995)","journal-title":"Eng. Optimiz."},{"issue":"5","key":"2137_CR2","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0167-6377(93)90052-I","volume":"13","author":"T Kuno","year":"1993","unstructured":"Kuno, T.: Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set. Oper. Res. Lett. 13(5), 295\u2013303 (1993)","journal-title":"Oper. Res. Lett."},{"issue":"186","key":"2137_CR3","doi-asserted-by":"publisher","first-page":"211","DOI":"10.2307\/2553245","volume":"47","author":"N Rau","year":"1980","unstructured":"Rau, N., Layard, P., Walters, A.: Microeconomic theory. Economica 47(186), 211 (1980)","journal-title":"Economica"},{"key":"2137_CR4","first-page":"116","volume":"242","author":"P Shen","year":"2014","unstructured":"Shen, P., Yang, L., Liang, Y.: Range division and contraction algorithm for a class of global optimization problems. Appl. Math. Comput. 242, 116\u2013126 (2014)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"2137_CR5","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1287\/opre.43.2.264","volume":"43","author":"JM Mulvey","year":"1995","unstructured":"Mulvey, J.M., Vanderbei, R.J., Zenios, S.A.: Robust optimization of large-scale systems. Oper. Res. 43(2), 264\u2013281 (1995)","journal-title":"Oper. Res."},{"issue":"8\u20139","key":"2137_CR6","doi-asserted-by":"publisher","first-page":"1405","DOI":"10.1016\/S0165-1889(97)00032-8","volume":"21","author":"CD Maranas","year":"1997","unstructured":"Maranas, C.D., Androulakis, I.P., Floudas, C.A.: Solving long-term financial planning problems via global optimization. J. Econ. Dyn. Control 21(8\u20139), 1405\u20131425 (1997)","journal-title":"J. Econ. Dyn. Control"},{"issue":"3","key":"2137_CR7","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1007\/s10898-012-9933-0","volume":"56","author":"P Shen","year":"2013","unstructured":"Shen, P., Li, X.: Branch-reduction-bound algorithm for generalized geometric programming. J. Global Optim. 56(3), 1123\u20131142 (2013)","journal-title":"J. Global Optim."},{"key":"2137_CR8","first-page":"156","volume":"26","author":"KP Bennett","year":"1994","unstructured":"Bennett, K.P.: Global tree optimization: A non-greedy decision tree algorithm. Comput. Sci. Stat. 26, 156\u2013160 (1994)","journal-title":"Comput. Sci. Stat."},{"issue":"2","key":"2137_CR9","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BF00933245","volume":"28","author":"HP Benson","year":"1979","unstructured":"Benson, H.P.: Vector maximization with two objective functions. J. Optim. Theory Appl. 28(2), 253\u2013257 (1979)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"2137_CR10","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1093\/forestscience\/44.3.421","volume":"44","author":"DF Dennis","year":"1998","unstructured":"Dennis, D.F.: Analyzing public inputs to multiple objective decisions on national forests using conjoint analysis. Forest Sci. 44(3), 421\u2013429 (1998)","journal-title":"Forest Sci."},{"issue":"2","key":"2137_CR11","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF00121658","volume":"9","author":"T Matsui","year":"1996","unstructured":"Matsui, T.: Np-hardness of linear multiplicative programming and related problems. J. Global Optim. 9(2), 113\u2013119 (1996)","journal-title":"J. Global Optim."},{"issue":"1","key":"2137_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10957-005-2655-4","volume":"126","author":"HP Benson","year":"2005","unstructured":"Benson, H.P.: Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints. J. Optim. Theory Appl. 126(1), 41\u201361 (2005)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"2137_CR13","first-page":"1206","volume":"216","author":"Y Gao","year":"2010","unstructured":"Gao, Y., Wu, G., Ma, W.: A new global optimization approach for convex multiplicative programming. Appl. Math. Comput. 216(4), 1206\u20131218 (2010)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"2137_CR14","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1080\/02331934.2015.1051534","volume":"65","author":"L Shao","year":"2016","unstructured":"Shao, L., Ehrgott, M.: Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes. Optimization 65(2), 415\u2013431 (2016)","journal-title":"Optimization"},{"key":"2137_CR15","doi-asserted-by":"publisher","first-page":"315","DOI":"10.3390\/math8030315","volume":"8","author":"B Zhang","year":"2020","unstructured":"Zhang, B., Gao, Y., Liu, X., Huang, X.: Output-space branch-and-bound reduction algorithm for a class of linear multiplicative programs. Mathematics 8, 315 (2020)","journal-title":"Mathematics"},{"issue":"2","key":"2137_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.105178","volume":"128","author":"V Mahmoodian","year":"2021","unstructured":"Mahmoodian, V., Charkhgard, H., Zhang, Y.: Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs. Comput. Oper. Res. 128(2), 105178 (2021)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"2137_CR17","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1007\/s10957-021-01992-y","volume":"192","author":"B Zhang","year":"2022","unstructured":"Zhang, B., Gao, Y., Liu, X., Huang, X.: An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems. J. Optim. Theory Appl. 192(3), 830\u2013855 (2022)","journal-title":"J. Optim. Theory Appl."},{"issue":"6","key":"2137_CR18","doi-asserted-by":"publisher","first-page":"1421","DOI":"10.1080\/02331934.2020.1812603","volume":"71","author":"P Shen","year":"2022","unstructured":"Shen, P., Wang, K., Lu, T.: Global optimization algorithm for solving linear multiplicative programming problems. Optimization 71(6), 1421\u20131441 (2022)","journal-title":"Optimization"},{"key":"2137_CR19","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s10898-020-00919-7","volume":"78","author":"P Shen","year":"2020","unstructured":"Shen, P., Wang, K., Lu, T.: Outer space branch and bound algorithm for solving linear multiplicative programming problems. J. Global Optim. 78, 453\u2013482 (2020)","journal-title":"J. Global Optim."},{"key":"2137_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2023.115100","volume":"426","author":"P Shen","year":"2023","unstructured":"Shen, P., Wang, K., Lu, T.: An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming. J. Comput. Appl. Math. 426, 115100 (2023)","journal-title":"J. Comput. Appl. Math."},{"key":"2137_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2021.114080","volume":"407","author":"C Wang","year":"2022","unstructured":"Wang, C., Deng, Y., Shen, P.: A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems. J. Comput. Appl. Math. 407, 114080 (2022)","journal-title":"J. Comput. Appl. Math."},{"issue":"11","key":"2137_CR22","doi-asserted-by":"publisher","first-page":"26045","DOI":"10.3934\/math.20231327","volume":"8","author":"X Huang","year":"2023","unstructured":"Huang, X., Gao, Y.: An efficient outer space branch-and-bound algorithm for globally minimizing linear multiplicative problems. AIMS Math. 8(11), 26045\u201326069 (2023)","journal-title":"AIMS Math."},{"issue":"6","key":"2137_CR23","doi-asserted-by":"publisher","first-page":"5917","DOI":"10.1007\/s12190-024-02202-4","volume":"70","author":"S Ma","year":"2024","unstructured":"Ma, S., Gao, Y., Zhang, B.: Output-space branch-and-bound reduction algorithm for solving generalized linear multiplicative programming programs. J. Appl. Math. Comput. 70(6), 5917\u20135947 (2024)","journal-title":"J. Appl. Math. Comput."},{"key":"2137_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2023.113924","volume":"175","author":"Y Gao","year":"2023","unstructured":"Gao, Y., Zhang, B.: Output-space branch-and-bound reduction algorithm for generalized linear fractional-multiplicative programming problem. Chaos Soliton. Fract. 175, 113924 (2023)","journal-title":"Chaos Soliton. Fract."},{"issue":"1","key":"2137_CR25","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. Optimiz. Theory App. 201(1), 1\u201335 (2024)","journal-title":"J. Optimiz. Theory App."},{"issue":"2","key":"2137_CR26","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1023\/A:1004657629105","volume":"104","author":"HP Benson","year":"2000","unstructured":"Benson, H.P., Boger, G.M.: Outcome-space cutting-plane algorithm for linear multiplicative programming. J. Optim. Theory Appl. 104(2), 301\u2013332 (2000)","journal-title":"J. Optim. Theory Appl."},{"key":"2137_CR27","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1016\/j.cam.2015.11.009","volume":"296","author":"S Liu","year":"2016","unstructured":"Liu, S., Zhao, Y.: An efficient algorithm for globally solving generalized linear multiplicative programming. J. Comput. Appl. Math. 296, 840\u2013847 (2016)","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"2137_CR28","first-page":"1412","volume":"167","author":"EA Youness","year":"2005","unstructured":"Youness, E.A.: Level set algorithm for solving convex multiplicative programming problems. Appl. Math. Comput. 167(2), 1412\u20131417 (2005)","journal-title":"Appl. Math. Comput."},{"issue":"3","key":"2137_CR29","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF01096774","volume":"3","author":"T Kuno","year":"1993","unstructured":"Kuno, T., Yajima, Y., Konno, H.: An outer approximation method for minimizing the product of several convex functions on a convex set. J. Global Optim. 3(3), 325\u2013335 (1993)","journal-title":"J. Global Optim."},{"issue":"2","key":"2137_CR30","first-page":"494","volume":"179","author":"Y Gao","year":"2006","unstructured":"Gao, Y., Xu, C., Yang, Y.: An outcome-space finite algorithm for solving linear multiplicative programming. Appl. Math. Comput. 179(2), 494\u2013505 (2006)","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"2137_CR31","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00120666","volume":"1","author":"H Konno","year":"1991","unstructured":"Konno, H., Yajima, Y., Matsui, T.: Parametric simplex algorithms for solving a special class of nonconvex minimization problems. J. Global Optim. 1(1), 65\u201381 (1991)","journal-title":"J. Global Optim."},{"issue":"2","key":"2137_CR32","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1023\/A:1022600232285","volume":"94","author":"HP Benson","year":"1997","unstructured":"Benson, H.P., Boger, G.M.: Multiplicative programming problems: analysis and efficient point search heuristic. J. Optim. Theory Appl. 94(2), 487\u2013510 (1997)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"2137_CR33","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1023\/A:1008308913266","volume":"15","author":"XJ Liu","year":"1999","unstructured":"Liu, X.J., Umegaki, T., Yamamoto, Y.: Heuristic methods for linear multiplicative programming. J. Global Optim. 15(4), 433\u2013447 (1999)","journal-title":"J. Global Optim."},{"issue":"2","key":"2137_CR34","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1007\/s11075-022-01330-x","volume":"92","author":"Z Hou","year":"2023","unstructured":"Hou, Z., Li, S.: A nonisolated optimal solution of general linear multiplicative programming problems. Numer. Algorithms 92(2), 1063\u20131082 (2023)","journal-title":"Numer. Algorithms"},{"issue":"1","key":"2137_CR35","first-page":"149","volume":"22","author":"X Liu","year":"2021","unstructured":"Liu, X., Gao, Y., Zhang, B., Huang, X.: A branch and bound algorithm for solving a class of generalized linear multiplicative programming problems. J Nonlinear Convex A. 22(1), 149\u2013162 (2021)","journal-title":"J Nonlinear Convex A."},{"issue":"2","key":"2137_CR36","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1080\/00207160.2021.1909727","volume":"99","author":"H Jiao","year":"2022","unstructured":"Jiao, H., Shang, Y., Wang, W.: Solving generalized polynomial problem by using new affine relaxed technique. Int. J. Comput. Math. 99(2), 309\u2013331 (2022)","journal-title":"Int. J. Comput. Math."},{"issue":"3","key":"2137_CR37","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s10898-023-01358-w","volume":"89","author":"H Jiao","year":"2024","unstructured":"Jiao, H., Li, B., Yang, W.: A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems. J. Global Optim. 89(3), 597\u2013632 (2024)","journal-title":"J. Global Optim."},{"key":"2137_CR38","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/j.cam.2018.10.038","volume":"350","author":"P Shen","year":"2019","unstructured":"Shen, P., Huang, B., Wang, L.: Range division and linearization algorithm for a class of linear ratios optimization problems. J. Comput. Appl. Math. 350, 324\u2013342 (2019)","journal-title":"J. Comput. Appl. Math."},{"key":"2137_CR39","doi-asserted-by":"publisher","first-page":"1533","DOI":"10.1051\/ro\/2022061","volume":"55","author":"H Jiao","year":"2022","unstructured":"Jiao, H., Wang, W., Yin, J., Shang, Y.: Image space branch-reduction-bound algorithm for globally minimizing a class of multiplicative problems. RAIRO-Oper. Res. 55, 1533\u20131552 (2022)","journal-title":"RAIRO-Oper. Res."},{"issue":"3","key":"2137_CR40","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. Prog. Comput. 10(3), 383\u2013421 (2018)","journal-title":"Math. Prog. Comput."},{"issue":"7","key":"2137_CR41","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1016\/j.cor.2010.10.016","volume":"38","author":"C Wang","year":"2011","unstructured":"Wang, C., Liu, S.: A new linearization method for generalized linear multiplicative programming. Comput. Oper. Res. 38(7), 1008\u20131013 (2011)","journal-title":"Comput. Oper. Res."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-025-02137-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-025-02137-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-025-02137-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T08:02:01Z","timestamp":1776412921000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-025-02137-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,25]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["2137"],"URL":"https:\/\/doi.org\/10.1007\/s11075-025-02137-2","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,25]]},"assertion":[{"value":"5 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 June 2025","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":"Competing Interests"}}]}}