{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T02:41:55Z","timestamp":1770345715291,"version":"3.49.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,5,18]],"date-time":"2024-05-18T00:00:00Z","timestamp":1715990400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,18]],"date-time":"2024-05-18T00:00:00Z","timestamp":1715990400000},"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":["12071133"],"award-info":[{"award-number":["12071133"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s40314-024-02765-9","type":"journal-article","created":{"date-parts":[[2024,5,18]],"date-time":"2024-05-18T20:10:29Z","timestamp":1716063029000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation"],"prefix":"10.1007","volume":"43","author":[{"given":"Bingdi","family":"Huang","sequence":"first","affiliation":[]},{"given":"Peiping","family":"Shen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,18]]},"reference":[{"key":"2765_CR1","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1023\/A:1004657629105","volume":"104","author":"HP Benson","year":"2000","unstructured":"Benson HP, Boger GM (2000) Outcome-space cutting-plane algorithm for linear multiplicative programming. J Optim Theory Appl 104:301\u2013332","journal-title":"J Optim Theory Appl"},{"issue":"2","key":"2765_CR2","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s10203-020-00288-6","volume":"43","author":"R Cambini","year":"2020","unstructured":"Cambini R (2020) Underestimation functions for a rank-two partitioning method. Decis Econ Finan 43(2):465\u2013489","journal-title":"Decis Econ Finan"},{"issue":"2","key":"2765_CR3","first-page":"115","volume":"32","author":"R Cambini","year":"2021","unstructured":"Cambini R, Venturi I (2021) A new solution method for a class of large dimension rank-two nonconvex programs. IMA J Manag Math 32(2):115\u2013137","journal-title":"IMA J Manag Math"},{"key":"2765_CR4","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/s10287-023-00471-1","volume":"20","author":"R Cambini","year":"2023","unstructured":"Cambini R, Riccardi R, Scopelliti D (2023) Solving linear multiplicative programs via branch-and-bound: a computational experience. CMS 20:38. https:\/\/doi.org\/10.1007\/s10287-023-00471-1","journal-title":"CMS"},{"key":"2765_CR5","doi-asserted-by":"publisher","first-page":"2573","DOI":"10.1016\/j.cor.2008.11.002","volume":"36","author":"YQ Chen","year":"2009","unstructured":"Chen YQ, Jiao HW (2009) A nonisolated optimal solution of general linear multiplicative programming problems. Comput Oper Res 36:2573\u20132579","journal-title":"Comput Oper Res"},{"issue":"2","key":"2765_CR6","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1016\/j.amc.2005.11.111","volume":"179","author":"YL Gao","year":"2006","unstructured":"Gao YL, Xu CX, Yang YJ (2006) An outcome-space finite algorithm for solving linear multiplicative programming. Appl Math Comput 179(2):494\u2013505","journal-title":"Appl Math Comput"},{"issue":"4","key":"2765_CR7","doi-asserted-by":"publisher","first-page":"1206","DOI":"10.1016\/j.amc.2010.02.012","volume":"216","author":"YL Gao","year":"2010","unstructured":"Gao YL, Wu GR, Ma WM (2010) A new global optimization approach for convex multiplicative programming. Appl Math Comput 216(4):1206\u20131218","journal-title":"Appl Math Comput"},{"issue":"2","key":"2765_CR8","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s10107-009-0287-4","volume":"126","author":"V Goyal","year":"2011","unstructured":"Goyal V, Genc-Kaya L, Ravi R (2011) An FPTAS for minimizing the product of two nonnegative linear cost functions. Math Program 126(2):401\u2013405","journal-title":"Math Program"},{"key":"2765_CR9","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1007\/s11075-023-01523-y","volume":"94","author":"ZS Hou","year":"2023","unstructured":"Hou ZS, Liu SY (2023) An accelerating outer space algorithm for globally solving generalized linear multiplicative problems. Numer Algorithm 94:877\u2013904. https:\/\/doi.org\/10.1007\/s11075-023-01523-y","journal-title":"Numer Algorithm"},{"key":"2765_CR10","unstructured":"IBM ILOG CPLEX (2013) IBM ILOG CPLEX 12.6 user\u2019s manual for CPLEX, Version 12.10.0.0 Copyright (c), IBM Corp. http:\/\/www.cplex.com. Accessed 1 Mar 2023"},{"key":"2765_CR11","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/s12190-012-0576-6","volume":"40","author":"HW Jiao","year":"2012","unstructured":"Jiao HW, Liu SY, Chen YQ (2012) Global optimization algorithm of a generalized linear multiplicative programming. J Appl Math Comput 40:551\u2013568","journal-title":"J Appl Math Comput"},{"key":"2765_CR12","doi-asserted-by":"publisher","first-page":"80629","DOI":"10.1109\/ACCESS.2020.2990677","volume":"8","author":"HW Jiao","year":"2020","unstructured":"Jiao HW, Wang WJ, Chen RJ et al (2020) An efficient outer space algorithm for generalized linear multiplicative programming Problem. IEEE Access 8:80629\u201380637","journal-title":"IEEE Access"},{"issue":"3","key":"2765_CR13","doi-asserted-by":"publisher","first-page":"1533","DOI":"10.1051\/ro\/2022061","volume":"56","author":"HW Jiao","year":"2022","unstructured":"Jiao HW, Wang WJ, Yin JB, Shang YL (2022) Image space branch-reduction-bound algorithm for globally minimizing a class of multiplicative problems. RAIRO-Oper Res 56(3):1533\u20131552","journal-title":"RAIRO-Oper Res"},{"key":"2765_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2022.114784","volume":"419","author":"HW Jiao","year":"2023","unstructured":"Jiao HW, Wang WJ, Shang YL (2023) Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems. J Comput Appl Math 419:114784. https:\/\/doi.org\/10.1016\/j.cam.2022.114784","journal-title":"J Comput Appl Math"},{"key":"2765_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-023-01358-w","author":"HW Jiao","year":"2024","unstructured":"Jiao HW, Li BB, Yang WQ (2024) A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems. J Glob Optim. https:\/\/doi.org\/10.1007\/s10898-023-01358-w","journal-title":"J Glob Optim"},{"key":"2765_CR16","unstructured":"Konno H, Yajima Y (1990) Solving rank two bilinear programs by parametric simplex algorithms. Institute of Human and Social Sciences Working Paper IHSS 90-17, Tokyo Institute of Technology, Tokyo, Japan"},{"key":"2765_CR17","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1016\/j.cam.2015.11.009","volume":"296","author":"SY Liu","year":"2016","unstructured":"Liu SY, Zhao YF (2016) An efficient algorithm for globally solving generalized linear multiplicative programming. J Comput Appl Math 296:840\u2013847","journal-title":"J Comput Appl Math"},{"key":"2765_CR18","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s12532-018-0142-9","volume":"11","author":"HZ Luo","year":"2019","unstructured":"Luo HZ, Bai XD, Lim G et al (2019) New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation. Math Program Comput 11:119\u2013171","journal-title":"Math Program Comput"},{"issue":"2","key":"2765_CR19","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF00121658","volume":"9","author":"T Matsui","year":"1996","unstructured":"Matsui T (1996) NP-hardness of linear multiplicative programming and related problems. J Glob Optim 9(2):113\u2013119","journal-title":"J Glob Optim"},{"key":"2765_CR20","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"GP McCormick","year":"1976","unstructured":"McCormick GP (1976) Computability of global solutions to factorable nonconvex programs: Part I\u2014Convex underestimating problems. Math Program 10:147\u2013175","journal-title":"Math Program"},{"key":"2765_CR21","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10898-009-9460-9","volume":"47","author":"RM Oliveira","year":"2010","unstructured":"Oliveira RM, Ferreira AVP (2010) An outcome space approach for generalized convex multiplicative programs. J Glob Optim 47:107\u2013118","journal-title":"J Glob Optim"},{"key":"2765_CR22","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/s11590-018-1378-z","volume":"14","author":"PP Shen","year":"2020","unstructured":"Shen PP, Huang BD (2020) Global algorithm for solving linear multiplicative programming problems. Optim Lett 14:693\u2013710","journal-title":"Optim Lett"},{"key":"2765_CR23","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1186\/s13660-017-1342-y","volume":"2017","author":"PP Shen","year":"2017","unstructured":"Shen PP, Wang CF (2017) Linear decomposition approach for a class of nonconvex programming problems. J Inequal Appl 2017:74. https:\/\/doi.org\/10.1186\/s13660-017-1342-y","journal-title":"J Inequal Appl"},{"key":"2765_CR24","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s10898-020-00919-7","volume":"78","author":"PP Shen","year":"2020","unstructured":"Shen PP, Wang KM, Lu T (2020) Outer space branch and bound algorithm for solving linear multiplicative programming problems. J Glob Optim 78:453\u2013482","journal-title":"J Glob Optim"},{"issue":"6","key":"2765_CR25","doi-asserted-by":"publisher","first-page":"1421","DOI":"10.1080\/02331934.2020.1812603","volume":"71","author":"PP Shen","year":"2020","unstructured":"Shen PP, Wang KM, Lu T (2020) Global optimization algorithm for solving linear multiplicative programming problems. Optimization 71(6):1421\u20131441","journal-title":"Optimization"},{"key":"2765_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2023.115100","volume":"426","author":"PP Shen","year":"2023","unstructured":"Shen PP, Wu DX, Wang YF (2023) An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming. J Comput Appl Math 426:115100. https:\/\/doi.org\/10.1016\/j.cam.2023.115100","journal-title":"J Comput Appl Math"},{"key":"2765_CR27","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10898-023-01277-w","volume":"86","author":"PP Shen","year":"2023","unstructured":"Shen PP, Wu DX, Wang KM (2023) Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound. J Glob Optim 86:303\u2013321. https:\/\/doi.org\/10.1007\/s10898-023-01277-w","journal-title":"J Glob Optim"},{"key":"2765_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-023-01689-5","author":"PP Shen","year":"2023","unstructured":"Shen PP, Deng YP, Wu DX (2023) A criterion space algorithm for solving linear multiplicative programming problems. Numer Algorithm. https:\/\/doi.org\/10.1007\/s11075-023-01689-5","journal-title":"Numer Algorithm"},{"key":"2765_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2809-5","volume-title":"Convex analysis and global optimization","author":"H Tuy","year":"1998","unstructured":"Tuy H (1998) Convex analysis and global optimization. Kluwer Academic, Dordrecht"},{"key":"2765_CR30","doi-asserted-by":"publisher","first-page":"2446","DOI":"10.1016\/j.apm.2011.09.002","volume":"36","author":"CF Wang","year":"2012","unstructured":"Wang CF, Liu SY, Shen PP (2012) Global minimization of a generalized linear multiplicative programming. Appl Math Model 36:2446\u20132451","journal-title":"Appl Math Model"},{"issue":"3","key":"2765_CR31","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1080\/02331934.2016.1269765","volume":"66","author":"CF Wang","year":"2017","unstructured":"Wang CF, Bai YQ, Shen PP (2017) A practicable branch-and-bound algorithm for globally solving multiplicative programming. Optimization 66(3):397\u2013405","journal-title":"Optimization"},{"key":"2765_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2021.114080","author":"CF Wang","year":"2022","unstructured":"Wang CF, Deng YP, Shen PP (2022) A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems. J Comput Appl Math. https:\/\/doi.org\/10.1016\/j.cam.2021.114080","journal-title":"J Comput Appl Math"},{"key":"2765_CR33","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/641909","author":"LP Yang","year":"2014","unstructured":"Yang LP, Shen PP, Pei YG (2014) A global optimization approach for solving generalized nonlinear multiplicative programming problem. Abstr Appl Anal. https:\/\/doi.org\/10.1155\/2014\/641909","journal-title":"Abstr Appl Anal"},{"key":"2765_CR34","doi-asserted-by":"publisher","first-page":"162245","DOI":"10.1109\/ACCESS.2019.2951515","volume":"7","author":"JB Yin","year":"2019","unstructured":"Yin JB, Jiao HW, Shang YL (2019) Global algorithm for generalized affine multiplicative programming problem. IEEE Access 7:162245\u2013162253","journal-title":"IEEE Access"},{"key":"2765_CR35","doi-asserted-by":"publisher","first-page":"315","DOI":"10.3390\/math8030315","volume":"8","author":"B Zhang","year":"2020","unstructured":"Zhang B, Gao YL, Liu X et al (2020) Output-space branch-and-bound reduction algorithm for a class of linear multiplicative programs. Mathematics 8:315. https:\/\/doi.org\/10.3390\/math8030315","journal-title":"Mathematics"},{"issue":"1","key":"2765_CR36","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1186\/s40064-016-2984-9","volume":"5","author":"YF Zhao","year":"2016","unstructured":"Zhao YF, Liu SY (2016) An efficient method for generalized linear multiplicative programming problem with multiplicative constraints. Springerplus 5(1):1302","journal-title":"Springerplus"},{"key":"2765_CR37","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/9146309","author":"YF Zhao","year":"2018","unstructured":"Zhao YF, Zhao T (2018) Global optimization for generalized linear multiplicative programming using convex relaxation. Math Probl Eng. https:\/\/doi.org\/10.1155\/2018\/9146309","journal-title":"Math Probl Eng"},{"issue":"2","key":"2765_CR38","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10255-015-0456-6","volume":"31","author":"XG Zhou","year":"2015","unstructured":"Zhou XG, Cao BY, Wu K (2015) Global optimization method for linear multiplicative programming. Acta Math Appl Sin 31(2):325\u2013334","journal-title":"Acta Math Appl Sin"},{"key":"2765_CR39","doi-asserted-by":"publisher","DOI":"10.1155\/2022\/1565764","author":"HY Zhou","year":"2022","unstructured":"Zhou HY, Li GH, Gao XL, Hou ZS (2022) Image space accelerating algorithm for solving a class of multiplicative programming problems. Math Probl Eng. https:\/\/doi.org\/10.1155\/2022\/1565764","journal-title":"Math Probl Eng"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-02765-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-024-02765-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-02765-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T02:09:38Z","timestamp":1718071778000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-024-02765-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,18]]},"references-count":39,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["2765"],"URL":"https:\/\/doi.org\/10.1007\/s40314-024-02765-9","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,18]]},"assertion":[{"value":"5 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 April 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2024","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 have no conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"247"}}