{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,13]],"date-time":"2025-09-13T16:43:02Z","timestamp":1757781782931,"version":"3.37.3"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T00:00:00Z","timestamp":1681948800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T00:00:00Z","timestamp":1681948800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Key Scientific and Technological Project of Henan Province","award":["202102210385"],"award-info":[{"award-number":["202102210385"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61877046"],"award-info":[{"award-number":["61877046"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s11075-023-01523-y","type":"journal-article","created":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T08:22:31Z","timestamp":1681978951000},"page":"877-904","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["An accelerating outer space algorithm for globally solving generalized linear multiplicative problems"],"prefix":"10.1007","volume":"94","author":[{"given":"Zhisong","family":"Hou","sequence":"first","affiliation":[]},{"given":"Sanyang","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,20]]},"reference":[{"key":"1523_CR1","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s10203-020-00288-6","volume":"43","author":"R Cambini","year":"2020","unstructured":"Cambini, R.: Underestimation functions for a rank-two partitioning method. Decisions in Economics and Finance 43, 465\u2013489 (2020)","journal-title":"Decisions in Economics and Finance"},{"key":"1523_CR2","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1093\/imaman\/dpaa001","volume":"32","author":"R Cambini","year":"2020","unstructured":"Cambini, R., Venturi, I.: A new solution method for a class of large dimension rank-two nonconvex programs. IMA Journal of Management Mathematics 32, 115\u2013137 (2020)","journal-title":"IMA Journal of Management Mathematics"},{"key":"1523_CR3","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s11081-007-9001-7","volume":"8","author":"S Boyd","year":"2007","unstructured":"Boyd, S., Kim, S.-J., Vandenberghe, L., Hassibi, A.: A tutorial on geometric programming. Optimization and Engineering 8, 67\u2013127 (2007)","journal-title":"Optimization and Engineering"},{"issue":"2","key":"1523_CR4","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. International Journal of Computer Mathematics 99(2), 309\u2013331 (2022)","journal-title":"International Journal of Computer Mathematics"},{"issue":"2","key":"1523_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. Operations Research 43(2), 264\u2013281 (1995)","journal-title":"Operations Research"},{"issue":"1","key":"1523_CR6","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.ejor.2010.03.047","volume":"207","author":"R Cambini","year":"2010","unstructured":"Cambini, R., Sodini, C.: A unifying approach to solve some classes of rank-three multiplicative and fractional programs involving linear functions. European Journal of Operational Research 207(1), 25\u201329 (2010)","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"1523_CR7","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1080\/02331934.2013.852548","volume":"63","author":"R Cambini","year":"2014","unstructured":"Cambini, R., Sodini, C.: On the minimization of a class of generalized linear functions on a flow polytope. Optimization 63(10), 1449\u20131464 (2014)","journal-title":"Optimization"},{"issue":"2","key":"1523_CR8","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1080\/03052159508941259","volume":"25","author":"M Domeich","year":"1995","unstructured":"Domeich, M., Sahinidis, N.: Global optimization algorithms for chip design and compaction. Engineering Optimization 25(2), 131\u2013154 (1995)","journal-title":"Engineering Optimization"},{"key":"1523_CR9","doi-asserted-by":"crossref","unstructured":"Maling, K., Heller, W., Mueller, S.: On finding most optimal rectangular package plans. In: 19th Design Automation Conference, pp. 663\u2013670, IEEE, 1982","DOI":"10.1109\/DAC.1982.1585567"},{"key":"1523_CR10","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF01299449","volume":"2","author":"KP Bennett","year":"1993","unstructured":"Bennett, K.P., Mangasarian, O.L.: Bilinear separation of two sets in $$n$$-space. Computational Optimization and Applications 2, 207\u2013227 (1993)","journal-title":"Computational Optimization and Applications"},{"key":"1523_CR11","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-540-76386-4_2","volume-title":"Computer Vision \u2013 ACCV 2007","author":"R Hartley","year":"2007","unstructured":"Hartley, R., Kahl, F.: Optimal algorithms in multiview geometry. In: Yagi, S.B., Kang, Y., Kweon, I.S., Zha, H. (eds.) Computer Vision \u2013 ACCV 2007, pp. 13\u201334. Springer, Berlin (2007)"},{"issue":"1","key":"1523_CR12","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s10589-012-9488-5","volume":"54","author":"T Kuno","year":"2013","unstructured":"Kuno, T., Masaki, T.: A practical but rigorous approach to sum-of-ratios optimization in geometric applications. Computational Optimization and Applications 54(1), 93\u2013109 (2013)","journal-title":"Computational Optimization and Applications"},{"issue":"1","key":"1523_CR13","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF01096534","volume":"4","author":"H Konno","year":"1994","unstructured":"Konno, H., Kuno, T., Yajima, Y.: Global minimization of a generalized convex multiplicative function. Journal of Global Optimization 4(1), 47\u201362 (1994)","journal-title":"Journal of Global Optimization"},{"issue":"4","key":"1523_CR14","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF00130830","volume":"1","author":"N Van Thoai","year":"1991","unstructured":"Van Thoai, N.: A global optimization approach for solving the convex multiplicative programming problem. Journal of Global Optimization 1(4), 341\u2013357 (1991)","journal-title":"Journal of Global Optimization"},{"issue":"1","key":"1523_CR15","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. Journal of Optimization Theory and Applications 126(1), 41\u201361 (2005)","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"1","key":"1523_CR16","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF01096535","volume":"4","author":"JE Falk","year":"1994","unstructured":"Falk, J.E., Palocsay, S.W.: Image space analysis of generalized fractional programs. Journal of Global Optimization 4(1), 63\u201388 (1994)","journal-title":"Journal of Global Optimization"},{"issue":"2","key":"1523_CR17","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. Journal of Optimization Theory and Applications 104(2), 301\u2013322 (2000)","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"4","key":"1523_CR18","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1023\/A:1024700901538","volume":"26","author":"H-S Ryoo","year":"2003","unstructured":"Ryoo, H.-S., Sahinidis, N.V.: Global optimization of multiplicative programs. Journal of Global Optimization 26(4), 387\u2013418 (2003)","journal-title":"Journal of Global Optimization"},{"key":"1523_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2022.114784","volume":"419","author":"H Jiao","year":"2023","unstructured":"Jiao, H., Wang, W., Shang, Y.: Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems. Journal of Computational and Applied Mathematics 419, 114784 (2023)","journal-title":"Journal of Computational and Applied Mathematics"},{"issue":"2","key":"1523_CR20","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1023\/A:1011250901810","volume":"20","author":"T Kuno","year":"2001","unstructured":"Kuno, T.: A finite branch-and-bound algorithm for linear multiplicative programming. Computational Optimization and Applications 20(2), 119\u2013135 (2001)","journal-title":"Computational Optimization and Applications"},{"issue":"3","key":"1523_CR21","doi-asserted-by":"publisher","first-page":"1533","DOI":"10.1051\/ro\/2022061","volume":"56","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-Operations Research 56(3), 1533\u20131552 (2022)","journal-title":"RAIRO-Operations Research"},{"key":"1523_CR22","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1016\/j.amc.2006.05.102","volume":"183","author":"H Jiao","year":"2006","unstructured":"Jiao, H., Guo, Y., Shen, P.: Global optimization of generalized linear fractional programming with nonlinear constraints. Applied Mathematics and Computation 183, 717\u2013728 (2006)","journal-title":"Applied Mathematics and Computation"},{"key":"1523_CR23","doi-asserted-by":"crossref","unstructured":"Hou, Z., Liu, S.: Global algorithm for a class of multiplicative programs using piecewise linear approximation technique. Numerical Algorithms, May (2022)","DOI":"10.1007\/s11075-022-01330-x"},{"key":"1523_CR24","doi-asserted-by":"crossref","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(3), (2020)","DOI":"10.3390\/math8030315"},{"key":"1523_CR25","first-page":"1565764","volume":"2022","author":"H Zhou","year":"2022","unstructured":"Zhou, H., Li, G., Gao, X., Hou, Z.: Image space accelerating algorithm for solving a class of multiplicative programming problems. Mathematical Problems in Engineering 2022, 1565764 (2022)","journal-title":"Mathematical Problems in Engineering"},{"key":"1523_CR26","doi-asserted-by":"crossref","unstructured":"Shen, P., Wu, D., Wang, Y.: An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming. Journal of Computational and Applied Mathematics, 115100 (2023)","DOI":"10.1016\/j.cam.2023.115100"},{"issue":"4","key":"1523_CR27","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/s10898-008-9283-0","volume":"41","author":"P Shen","year":"2008","unstructured":"Shen, P., Ma, Y., Chen, Y.: A robust algorithm for generalized geometric programming. Journal of Global Optimization 41(4), 593\u2013612 (2008)","journal-title":"Journal of Global Optimization"},{"issue":"2","key":"1523_CR28","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1287\/ijoc.2018.0850","volume":"31","author":"H-C Lu","year":"2019","unstructured":"Lu, H.-C., Yao, L.: Efficient convexification strategy for generalized geometric programming problems. INFORMS Journal on Computing 31(2), 226\u2013234 (2019)","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"1523_CR29","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1016\/j.amc.2006.05.137","volume":"183","author":"P Shen","year":"2006","unstructured":"Shen, P., Jiao, H.: A new rectangle branch-and-pruning approach for generalized geometric programming. Applied Mathematics and Computation 183(2), 1027\u20131038 (2006)","journal-title":"Applied Mathematics and Computation"},{"issue":"11","key":"1523_CR30","doi-asserted-by":"publisher","first-page":"1426","DOI":"10.1080\/01630563.2017.1327869","volume":"38","author":"H Jiao","year":"2017","unstructured":"Jiao, H., Liu, S.: An efficient algorithm for quadratic sum-of-ratios fractional programs problem. Numerical Functional Analysis and Optimization 38(11), 1426\u20131445 (2017)","journal-title":"Numerical Functional Analysis and Optimization"},{"key":"1523_CR31","doi-asserted-by":"publisher","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"},{"key":"1523_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2022.112701","volume":"164","author":"H Jiao","year":"2022","unstructured":"Jiao, H., Ma, J.: An efficient algorithm and complexity result for solving the sum of general affine ratios problem. Chaos, Solitons & Fractals 164, 112701 (2022)","journal-title":"Chaos, Solitons & Fractals"},{"key":"1523_CR33","unstructured":"Jiao, H., Ma, J., Shen, P., Qiu, Y.: Effective algorithm and computational complexity for solving sum of linear ratios problem. Journal of Industrial and Management Optimization (2022)"},{"key":"1523_CR34","doi-asserted-by":"crossref","unstructured":"Jiao, H.-W., Shang, Y.-L.: Two-level linear relaxation method for generalized linear fractional programming. Journal of the Operations Research Society of China, pp.\u00a01\u201326 (2022)","DOI":"10.1007\/s40305-021-00375-4"},{"issue":"1","key":"1523_CR35","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.amc.2004.08.016","volume":"168","author":"W Yanjun","year":"2005","unstructured":"Yanjun, W., Peiping, S., Zhian, L.: A branch-and-bound algorithm to globally solve the sum of several linear ratios. Applied Mathematics and Computation 168(1), 89\u2013101 (2005)","journal-title":"Applied Mathematics and Computation"},{"issue":"2","key":"1523_CR36","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/j.ejor.2006.08.036","volume":"182","author":"HP Benson","year":"2007","unstructured":"Benson, H.P.: A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem. European journal of operational research 182(2), 597\u2013611 (2007)","journal-title":"European journal of operational research"},{"issue":"1","key":"1523_CR37","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s40314-015-0224-5","volume":"36","author":"H Jiao","year":"2017","unstructured":"Jiao, H., Liu, S.: Range division and compression algorithm for quadratically constrained sum of quadratic ratios. Computational and Applied Mathematics 36(1), 225\u2013247 (2017)","journal-title":"Computational and Applied Mathematics"},{"issue":"2","key":"1523_CR38","doi-asserted-by":"publisher","first-page":"1113","DOI":"10.1016\/j.na.2008.02.005","volume":"70","author":"H Jiao","year":"2009","unstructured":"Jiao, H.: A branch and bound algorithm for globally solving a class of nonconvex programming problems. Nonlinear Analysis: Theory, Methods and Applications 70(2), 1113\u20131123 (2009)","journal-title":"Nonlinear Analysis: Theory, Methods and Applications"},{"issue":"1","key":"1523_CR39","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"},{"key":"1523_CR40","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. Journal of Computational and Applied Mathematics 350, 324\u2013342 (2019)","journal-title":"Journal of Computational and Applied Mathematics"},{"issue":"23\u201324","key":"1523_CR41","doi-asserted-by":"publisher","first-page":"7568","DOI":"10.1016\/j.apm.2015.03.025","volume":"39","author":"HW Jiao","year":"2015","unstructured":"Jiao, H.W., Liu, S.Y., Zhao, Y.F.: Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints. Applied Mathematical Modelling 39(23\u201324), 7568\u20137582 (2015)","journal-title":"Applied Mathematical Modelling"},{"issue":"1","key":"1523_CR42","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s12190-012-0602-8","volume":"41","author":"Y Pei","year":"2013","unstructured":"Pei, Y., Zhu, D.: Global optimization method for maximizing the sum of difference of convex functions ratios over nonconvex region. Journal of Applied Mathematics and Computing 41(1), 153\u2013169 (2013)","journal-title":"Journal of Applied Mathematics and Computing"},{"issue":"1","key":"1523_CR43","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/j.amc.2008.06.045","volume":"204","author":"C-F Wang","year":"2008","unstructured":"Wang, C.-F., Shen, P.-P.: A global optimization algorithm for linear fractional programming. Applied Mathematics and Computation 204(1), 281\u2013287 (2008)","journal-title":"Applied Mathematics and Computation"},{"issue":"9","key":"1523_CR44","doi-asserted-by":"publisher","first-page":"2573","DOI":"10.1016\/j.cor.2008.11.002","volume":"36","author":"Y Chen","year":"2009","unstructured":"Chen, Y., Jiao, H.: A nonisolated optimal solution of general linear multiplicative programming problems. Computers and Operations Research 36(9), 2573\u20132579 (2009)","journal-title":"Computers and Operations Research"},{"issue":"6","key":"1523_CR45","doi-asserted-by":"publisher","first-page":"2446","DOI":"10.1016\/j.apm.2011.09.002","volume":"36","author":"C-F Wang","year":"2012","unstructured":"Wang, C.-F., Liu, S.-Y., Shen, P.-P.: Global minimization of a generalized linear multiplicative programming. Applied Mathematical Modelling 36(6), 2446\u20132451 (2012)","journal-title":"Applied Mathematical Modelling"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-023-01523-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-023-01523-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-023-01523-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,5]],"date-time":"2023-09-05T09:16:08Z","timestamp":1693905368000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-023-01523-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,20]]},"references-count":45,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["1523"],"URL":"https:\/\/doi.org\/10.1007\/s11075-023-01523-y","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2023,4,20]]},"assertion":[{"value":"6 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 February 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 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":"Not Applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"The authors declare that they have no conflict of interest.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}]}}