{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T06:03:17Z","timestamp":1780293797791,"version":"3.54.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T00:00:00Z","timestamp":1768521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T00:00:00Z","timestamp":1768521600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012481","name":"Graduate Innovation Project of North Minzu University","doi-asserted-by":"publisher","award":["YCX24252"],"award-info":[{"award-number":["YCX24252"]}],"id":[{"id":"10.13039\/501100012481","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"The National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12461053"],"award-info":[{"award-number":["12461053"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s40314-025-03606-z","type":"journal-article","created":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T08:28:44Z","timestamp":1768552124000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An adaptive optimization algorithm to solve a class of linear multiplicative problems"],"prefix":"10.1007","volume":"45","author":[{"given":"Binbin","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0330-5304","authenticated-orcid":false,"given":"Yuelin","family":"Gao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,1,16]]},"reference":[{"key":"3606_CR1","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1023\/A:1004657629105","volume":"104","author":"H Benson","year":"2000","unstructured":"Benson H, Boger G (2000) Outcome-space cutting-plane algorithm for linear multiplicative programming. J Optim Theory Appl 104:301\u2013332","journal-title":"J Optim Theory Appl"},{"key":"3606_CR2","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BF00933245","volume":"28","author":"H Benson","year":"1979","unstructured":"Benson H (1979) Vector maximization with two objective functions. J Optim Theory Appl 28:253\u2013257","journal-title":"J Optim Theory Appl"},{"key":"3606_CR3","first-page":"156","volume":"26","author":"K Bennett","year":"1994","unstructured":"Bennett K (1994) Global tree optimization: A non-greedy decision tree algorithm. Comput Sci Stat 26:156","journal-title":"Comput Sci Stat"},{"key":"3606_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.cor.2017.07.015","volume":"89","author":"H Charkhgard","year":"2018","unstructured":"Charkhgard H, Savelsbergh M, Talebian M (2018) A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints. Comput Oper Res 89:17\u201330","journal-title":"Comput Oper Res"},{"key":"3606_CR5","first-page":"421","volume":"44","author":"D Dennis","year":"1998","unstructured":"Dennis D (1998) Analyzing public inputs to multiple objective decisions on national forests using conjoint analysis. For Sci 44:421\u2013429","journal-title":"For Sci"},{"key":"3606_CR6","doi-asserted-by":"crossref","unstructured":"Deng Y, Shen P (2025) A new branch-and-bound algorithm for generalized affine multiplicative programming. J. Global. Optim. 1\u201326","DOI":"10.1007\/s10898-025-01519-z"},{"key":"3606_CR7","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1080\/03052159508941259","volume":"25","author":"M Dorneich","year":"1995","unstructured":"Dorneich M, Sahinidis N (1995) Global optimization algorithms for chip layout and compaction. Eng Optim 25:131\u2013154","journal-title":"Eng Optim"},{"key":"3606_CR8","unstructured":"Grotschel M, Lovasz L, Schrijver A (2012) Geometric algorithms and combinatorial optimization. Springer Science & Business Media"},{"key":"3606_CR9","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1016\/j.amc.2005.11.111","volume":"179","author":"Y Gao","year":"2006","unstructured":"Gao Y, Xu C, Yang Y (2006) An outcome-space finite algorithm for solving linear multiplicative programming. Appl Math Comput 179:494\u2013505","journal-title":"Appl Math Comput"},{"key":"3606_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2023.113924","volume":"175","author":"Y Gao","year":"2023","unstructured":"Gao Y, Zhang B (2023) Output-space branch-and-bound reduction algorithm for generalized linear fractional-multiplicative programming problem. Chaos Soliton Fract 175:113924","journal-title":"Chaos Soliton Fract"},{"issue":"2","key":"3606_CR11","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1007\/s11075-022-01330-x","volume":"92","author":"Z Hou","year":"2023","unstructured":"Hou Z, Liu S (2023) Global algorithm for a class of multiplicative programs using piecewise linear approximation technique. Numer Algorithms 92(2):1063\u20131082","journal-title":"Numer Algorithms"},{"key":"3606_CR12","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 (2009) A branch and bound algorithm for globally solving a class of nonconvex programming problems. Nonlinear Anal Theory Methods Appl 70:1113\u20131123","journal-title":"Nonlinear Anal Theory Methods Appl"},{"issue":"3","key":"3606_CR13","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 (2024) A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems. J Global Optim 89(3):597\u2013632","journal-title":"J Global Optim"},{"key":"3606_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2022.114784","volume":"49","author":"H Jiao","year":"2023","unstructured":"Jiao H, Wang W, Shang Y (2023) Outer space branch reduction bound algorithm for solving generalized affine multiplicatioe problems. J Comput Appl Mathe 49:114784","journal-title":"J Comput Appl Mathe"},{"key":"3606_CR15","first-page":"97","volume":"19","author":"H Jiao","year":"2023","unstructured":"Jiao H, Wang W, Shen P (2023) Piecewise linear relaxation method for globally solving a class of multiplicative problems. Pac J Optim 19:97\u2013118","journal-title":"Pac J Optim"},{"issue":"3","key":"3606_CR16","doi-asserted-by":"publisher","first-page":"1522","DOI":"10.1051\/ro\/2022061","volume":"56","author":"H Jiao","year":"2022","unstructured":"Jiao H, Wang W, Yin J, Shang Y (2022) Image space branch-reduction-bound algorithm for globally minimizing a class of multiplicative problems. Rairo-Oper Res 56(3):1522\u20131552","journal-title":"Rairo-Oper Res"},{"key":"3606_CR17","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 (1994) Global minimization of a generalized convex multiplicative function. J Global Optim 4:47\u201362","journal-title":"J Global Optim"},{"key":"3606_CR18","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF02282050","volume":"45","author":"H Konno","year":"1993","unstructured":"Konno H, Shirakawa H, Yamazaki H (1993) A mean-absolute deviation-skewness portfolio optimization model. Ann Oper Res 45:205\u2013220","journal-title":"Ann Oper Res"},{"key":"3606_CR19","first-page":"119","volume":"20","author":"K Kuno","year":"2001","unstructured":"Kuno K (2001) A finite branch-and-bound algorithm for linear multiplicative programming. Appl Math Comput 20:119\u2013135","journal-title":"Appl Math Comput"},{"key":"3606_CR20","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1023\/A:1008308913266","volume":"15","author":"J Liu","year":"1999","unstructured":"Liu J, Umegaki T, Yamamoto Y (1999) Heuristic methods for linear multiplicative programming. J Global Optim 15:433\u2013447","journal-title":"J Global Optim"},{"key":"3606_CR21","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 (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":"3606_CR22","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 (1997) Solving long-term financial planning problems via global optimization. J Econ Dyn Control 21:1405\u20131425","journal-title":"J Econ Dyn Control"},{"key":"3606_CR23","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:113\u2013119","journal-title":"J Glob Optim"},{"key":"3606_CR24","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1287\/opre.43.2.264","volume":"43","author":"J Mulvey","year":"1995","unstructured":"Mulvey J, Vanderbei R, Zenios S (1995) Robust optimization of large-scale systems. Oper Res 43:264\u2013281","journal-title":"Oper Res"},{"issue":"6","key":"3606_CR25","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1080\/02331939008843615","volume":"21","author":"P Pardalos","year":"1990","unstructured":"Pardalos P (1990) Polynomial time algorithms for some classes of constrained quadratic problems. Optimization 21(6):843\u2013853","journal-title":"Optimization"},{"key":"3606_CR26","first-page":"23","volume":"6","author":"A Reza","year":"2017","unstructured":"Reza A (2017) Minimizing the risk in investment projects. Eur J Sustain Dev 6:23\u201330","journal-title":"Eur J Sustain Dev"},{"key":"3606_CR27","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1023\/A:1024700901538","volume":"26","author":"H Ryoo","year":"2003","unstructured":"Ryoo H, Sahinidis N (2003) Global optimization of multiplicative programs. J Global Optim 26:387\u2013418","journal-title":"J Global Optim"},{"key":"3606_CR28","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.cor.2018.08.004","volume":"101","author":"P Saghand","year":"2019","unstructured":"Saghand P, Charkhgard H, Kwon C (2019) A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: A bi-objective optimization approach. Comput Oper Res 101:263\u2013274","journal-title":"Comput Oper Res"},{"key":"3606_CR29","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 (2016) Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes. Optimization 65:415\u2013431","journal-title":"Optimization"},{"key":"3606_CR30","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/s11590-018-1378-z","volume":"14","author":"P Shen","year":"2020","unstructured":"Shen P, Huang B (2020) Global algorithm for solving linear multiplicative programming problems. Optim Lett 14:693\u2013710","journal-title":"Optim Lett"},{"key":"3606_CR31","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 (2020) Outer space branch and bound algorithm for solving linear multiplicative programming problems. J Global Optim 78:453\u2013482","journal-title":"J Global Optim"},{"key":"3606_CR32","doi-asserted-by":"publisher","first-page":"1594","DOI":"10.1080\/01630563.2018.1488142","volume":"39","author":"S Treanta","year":"2018","unstructured":"Treanta S (2018) On a new class of vector variational control problems. Numer Funct Anal Optim 39:1594\u20131603","journal-title":"Numer Funct Anal Optim"},{"issue":"9","key":"3606_CR33","doi-asserted-by":"publisher","first-page":"829","DOI":"10.3390\/math7090829","volume":"7","author":"S Treanta","year":"2019","unstructured":"Treanta S (2019) On locally and globally optimal solutions in scalar variational control problems. Mathematics 7(9):829","journal-title":"Mathematics"},{"key":"3606_CR34","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 (2022) A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems. J Comput Appl Math 407:114080","journal-title":"J Comput Appl Math"},{"issue":"7","key":"3606_CR35","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 (2011) A new linearization method for generalized linear multiplicative programming. Comput Oper Res 38(7):1008\u20131013","journal-title":"Comput Oper Res"},{"key":"3606_CR36","doi-asserted-by":"publisher","first-page":"1412","DOI":"10.1016\/j.amc.2004.08.028","volume":"167","author":"E Youness","year":"2005","unstructured":"Youness E (2005) Level set algorithm for solving convex multiplicative programming problems. Appl Math Comput 167:1412\u20131417","journal-title":"Appl Math Comput"},{"issue":"1","key":"3606_CR37","first-page":"8877037","volume":"2021","author":"B Zhang","year":"2021","unstructured":"Zhang B, Gao Y, Liu X (2021) An efficient polynomial time algorithm for a class of generalized linear multiplicative programs with positive exponents. Math Prob Eng 2021(1):8877037","journal-title":"Math Prob Eng"},{"key":"3606_CR38","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 (2020) Output-space branch-and-bound reduction algorithm for a class of linear multiplicative programs. Mathematics 8:315","journal-title":"Mathematics"},{"key":"3606_CR39","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1007\/s10957-024-02461-y","volume":"202","author":"B Zhang","year":"2024","unstructured":"Zhang B, Wang H, Gao Y (2024) Output-space outer approximation branch-and-bound algorithm for a class of linear multiplicative programs. J Optim Theory Appl 202:997\u20131026","journal-title":"J Optim Theory Appl"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03606-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-025-03606-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03606-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T05:39:10Z","timestamp":1780292350000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-025-03606-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,16]]},"references-count":39,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["3606"],"URL":"https:\/\/doi.org\/10.1007\/s40314-025-03606-z","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,16]]},"assertion":[{"value":"16 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 December 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2026","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 there are no conflicts of interest relevant to the content of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}],"article-number":"208"}}