{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T21:18:48Z","timestamp":1770758328567,"version":"3.50.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,1,3]],"date-time":"2026-01-03T00:00:00Z","timestamp":1767398400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,3]],"date-time":"2026-01-03T00:00:00Z","timestamp":1767398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1007\/s12190-025-02715-6","type":"journal-article","created":{"date-parts":[[2026,1,3]],"date-time":"2026-01-03T08:47:22Z","timestamp":1767430042000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A global optimization approach utilizing convex relaxation for linear multiplicative programming problems"],"prefix":"10.1007","volume":"72","author":[{"given":"Bo","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suxia","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,3]]},"reference":[{"issue":"3","key":"2715_CR1","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s11263-007-0117-1","volume":"79","author":"F. Kahl","year":"2008","unstructured":"Kahl, F., Agarwal, S., Chandraker, M.K., Kriegman, D., Belongies, S.: Practical global optimization for multiview geometry. Int. J. Comput. Vision 79(3), 271\u2013284 (2008)","journal-title":"Int. J. Comput. Vision"},{"key":"2715_CR2","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.cie.2019.03.042","volume":"131","author":"S. Qu","year":"2019","unstructured":"Qu, S., Zhou, Y., Zhang, Y., Wahab, M.I.M., Zhang, G., Ye, Y.: Optimal strategy for a green supply chain considering shipping policy and default risk. Comput. Ind. Eng. 131, 172\u2013186 (2019)","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"2715_CR3","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1080\/03052159508941259","volume":"25","author":"M. Dorneich","year":"1995","unstructured":"Dorneich, M., Sahinidis, N.: Global optimization algorithms for chip design and compaction. Eng. Optim. 25(2), 131\u2013154 (1995)","journal-title":"Eng. Optim."},{"issue":"3","key":"2715_CR4","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF01299449","volume":"2","author":"K.P. Bennett","year":"1993","unstructured":"Bennett, K.P., Mangasarian, O.L.: Bilinear separation of two sets in n-space. Comput. Optim. Appl. 2(3), 207\u2013227 (1993)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"2715_CR5","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1287\/opre.43.2.264","volume":"43","author":"J.M. Mulvey","year":"1995","unstructured":"Mulvey, J.M., Vanderbei, R.J., Zenios, S.A.: Robust optimization of large-scale systems. Opers. Res. 43(2), 264\u2013281 (1995)","journal-title":"Opers. Res."},{"key":"2715_CR6","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.cor.2018.08.004","volume":"101","author":"P.G. Saghand","year":"2019","unstructured":"Saghand, P.G., Charkhgard, H., Kwon, C.: A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach. Comput. Opers. Res. 101, 263\u2013274 (2019). https:\/\/doi.org\/10.1016\/j.cor.2018.08.004","journal-title":"Comput. Opers. Res."},{"issue":"2","key":"2715_CR7","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."},{"key":"2715_CR8","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10957-007-9323-9","volume":"137","author":"H. Benson","year":"2008","unstructured":"Benson, H.: Global maximization of a generalized concave multiplicative function. J. Optim. Theory Appl. 137, 105\u2013120 (2008)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"2715_CR9","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s10898-016-0436-2","volume":"67","author":"C. Lu","year":"2017","unstructured":"Lu, C., Deng, Z., Jin, Q.: An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints. J. Global Optim. 67(3), 475\u2013493 (2017)","journal-title":"J. Global Optim."},{"key":"2715_CR10","unstructured":"Konno, H., Yajima, Y.: Solving rank two bilinear programs by parametric simplex algorithms. Tech Rep IHSS Rep 90\u201317 (1990)"},{"issue":"3","key":"2715_CR11","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1080\/02331934.2016.1269765","volume":"66","author":"C. Wang","year":"2017","unstructured":"Wang, C., Bai, Y., Shen, P.: A practicable branch-and-bound algorithm for globally solving multiplicative programming. Optimization 66(3), 397\u2013405 (2017)","journal-title":"Optimization"},{"key":"2715_CR12","doi-asserted-by":"publisher","first-page":"162245","DOI":"10.1109\/ACCESS.2019.2951515","volume":"7","author":"J. Yin","year":"2019","unstructured":"Yin, J., Jiao, H., Shang, Y.: Global algorithm for generalized affine multiplicative programming problem. IEEE Access 7, 162245\u2013162253 (2019)","journal-title":"IEEE Access"},{"key":"2715_CR13","volume-title":"Global Optimization: deterministic Approaches","author":"R. Horst","year":"2013","unstructured":"Horst, R., Tuy, H.: Global optimization: deterministic Approaches. Springer Science & Business Media, Deutschland (2013)"},{"issue":"2","key":"2715_CR14","first-page":"1412","volume":"167","author":"E.A. 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."},{"key":"2715_CR15","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":"2715_CR16","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1023\/A:1004657629105","volume":"104","author":"H.P. 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\u2013322 (2000)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"2715_CR17","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10898-022-01255-8","volume":"86","author":"B. Zhang","year":"2023","unstructured":"Zhang, B., Gao, Y., Liu, X., Huang, X.: Outcome-space branch-and-bound outer approximation algorithm for a class of nonconvex quadratic programming problems. J. Global Optim. 86(1), 61\u201392 (2023)","journal-title":"J. Global Optim."},{"issue":"2","key":"2715_CR18","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":"3","key":"2715_CR19","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.: Output-space outer approximation branch-and-bound algorithm for a class of linear multiplicative programs. J. Optim. Theory Appl. 202(3), 997\u20131026 (2024). https:\/\/doi.org\/10.1007\/s10957-024-02461-y","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"2715_CR20","first-page":"1","volume":"11","author":"L.Q. Thuy","year":"2011","unstructured":"Thuy, L.Q., Kim, N.T.B., Thien, N.T.: Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming. J. Appl. Math. 11(1), 1\u201321 (2011)","journal-title":"J. Appl. Math."},{"key":"2715_CR21","doi-asserted-by":"crossref","unstructured":"Jiao, H., Wang, W., Shang, Y.: Outer space branch-reduction-bound algorithm for globally generalized affine multiplicative problems. J. Comput. Appl. Math. 419, 114784 (2023)","DOI":"10.1016\/j.cam.2022.114784"},{"issue":"1\u20133","key":"2715_CR22","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/BF01580893","volume":"56","author":"H. Konno","year":"1992","unstructured":"Konno, H., Kuno, T.: Linear multiplicative programming. Math. Program. 56(1\u20133), 51\u201364 (1992)","journal-title":"Math. Program."},{"issue":"1","key":"2715_CR23","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10898-009-9460-9","volume":"47","author":"R.M. Oliveira","year":"2010","unstructured":"Oliveira, R.M., Ferreira, P.A.V.: An outcome space approach for generalized convex multiplicative programs. J. Global Optim. 47(1), 107\u2013118 (2010)","journal-title":"J. Global Optim."},{"key":"2715_CR24","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.: A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints. Comput. Opers. Res. 89, 17\u201330 (2018)","journal-title":"Comput. Opers. Res."},{"issue":"1","key":"2715_CR25","first-page":"328","volume":"183","author":"P. Shen","year":"2006","unstructured":"Shen, P., Jiao, H.: Linearization method for a class of multiplicative programming with exponent. Appl. Math. Comput. 183(1), 328\u2013336 (2006)","journal-title":"Appl. Math. Comput."},{"issue":"23\u201324","key":"2715_CR26","doi-asserted-by":"publisher","first-page":"7568","DOI":"10.1016\/j.apm.2015.03.025","volume":"39","author":"H. Jiao","year":"2015","unstructured":"Jiao, H., Liu, S., Zhao, Y.: Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints. Appl. Math. Modell. 39(23\u201324), 7568\u20137582 (2015)","journal-title":"Appl. Math. Modell."},{"issue":"3","key":"2715_CR27","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1023\/A:1008314922240","volume":"18","author":"H. Konno","year":"2000","unstructured":"Konno, H., Fukaishi, K.: A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems. J. Global Optim. 18(3), 283\u2013299 (2000)","journal-title":"J. Global Optim."},{"key":"2715_CR28","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s40840-024-01730-3","volume":"47","author":"Y. Zhang","year":"2024","unstructured":"Zhang, Y.: A self-adjustable branch-and-bound algorithm for solving linear multiplicative programming. Bull. Malays. Math. Sci. Soc. 47, 137 (2024). https:\/\/doi.org\/10.1007\/s40840-024-01730-3","journal-title":"Bull. Malays. Math. Sci. Soc."},{"key":"2715_CR29","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s12190-024-02244-8","volume":"71","author":"Y. Zhang","year":"2025","unstructured":"Zhang, Y., Shen, P.: A novel global algorithm for solving linear multiplicative problem by integrating linear combination rule and branch-and-bound framework. J. Appl. Math. Comput. 71, 365\u2013386 (2025). https:\/\/doi.org\/10.1007\/s12190-024-02244-8","journal-title":"J. Appl. Math. Comput."},{"key":"2715_CR30","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Shen, P., Huang, B., Deng, Y.: An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs. J. Comput. Appl. Math. 450, 116035 (2024)","DOI":"10.1016\/j.cam.2024.116035"},{"issue":"6","key":"2715_CR31","doi-asserted-by":"publisher","first-page":"2446","DOI":"10.1016\/j.apm.2011.09.002","volume":"36","author":"C. Wang","year":"2012","unstructured":"Wang, C., Liu, S., Shen, P.: Global minimization of a generalized linear multiplicative programming. Appl. Math. Modell. 36(6), 2446\u20132451 (2012)","journal-title":"Appl. Math. Modell."},{"key":"2715_CR32","doi-asserted-by":"crossref","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)","DOI":"10.1016\/j.cam.2021.114080"},{"key":"2715_CR33","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.: Global algorithm for solving linear multiplicative programming problems. Optim. Lett. 14, 693\u2013710 (2020)","journal-title":"Optim. Lett."},{"issue":"6","key":"2715_CR34","doi-asserted-by":"publisher","first-page":"1421","DOI":"10.1080\/02331934.2020.1812603","volume":"71","author":"P. Shen","year":"2020","unstructured":"Shen, P., Wang, K., Lu, T.: Global optimization algorithm for solving linear multiplicative programming problems. Optimization 71(6), 1421\u20131441 (2020)","journal-title":"Optimization"},{"key":"2715_CR35","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":"2715_CR36","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10898-023-01277-w","volume":"86","author":"P. Shen","year":"2023","unstructured":"Shen, P., Wu, D., Wang, K.: Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound. J. Global Optim. 86, 303\u2013321 (2023). https:\/\/doi.org\/10.1007\/s10898-023-01277-w","journal-title":"J. Global Optim."},{"key":"2715_CR37","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 problems. J. Comput. Appl. Math. 426, 115100 (2023)","DOI":"10.1016\/j.cam.2023.115100"},{"key":"2715_CR38","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s40314-024-02765-9","volume":"43","author":"B. Huang","year":"2024","unstructured":"Huang, B., Shen, P.: An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation. Comput. Appl. Math. 43, 247 (2024). https:\/\/doi.org\/10.1007\/s40314-024-02765-9","journal-title":"Comput. Appl. Math."},{"key":"2715_CR39","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s12532-018-0142-9","volume":"11","author":"H. Luo","year":"2019","unstructured":"Luo, H., Bai, X., Lim, G., et al.: 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 (2019)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"2715_CR40","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.: Solving linear multiplicative programs via branch-and-bound: a computational experience. Comput. Manag. Sci. 20(1), 38 (2023)","journal-title":"Comput. Manag. Sci."},{"key":"2715_CR41","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. Optim. Theory Appl. 201, 1\u201331 (2024). https:\/\/doi.org\/10.1007\/s10957-023-02368-0","journal-title":"J. Optim. Theory Appl."},{"key":"2715_CR42","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, 597\u2013632 (2024). https:\/\/doi.org\/10.1007\/s10898-023-01358-w","journal-title":"J. Global Optim."},{"key":"2715_CR43","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., Y., S.: Image space branch-reduction-bound algorithm for globally minimizing a class of multiplicative problems. RAIRO-Opers. Res. 56, 1533\u20131552 (2022). https:\/\/doi.org\/10.1051\/ro\/2022061","journal-title":"RAIRO-Opers. Res."},{"key":"2715_CR44","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/nav.3800090303","volume":"9","author":"A. Charnes","year":"1962","unstructured":"Charnes, A., Cooper, W.W.: Programming with linear fractional functionals. Nav. Res. Logist. Q. 9, 181\u2013186 (1962). https:\/\/doi.org\/10.1002\/nav.3800090303","journal-title":"Nav. Res. Logist. Q."},{"key":"2715_CR45","unstructured":"IBM ILOG: IBM ILOG CPLEX 22.1.1 User\u2019s manual for CPLEX. (2022). [EB\/OL]. 2022-12-9. [2023-01-10] https:\/\/www.ibm.com\/docs\/en\/icos\/22.1.1?topic=optimizers-users-manual-cplex"}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-025-02715-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-025-02715-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-025-02715-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T16:12:52Z","timestamp":1770739972000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-025-02715-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,3]]},"references-count":45,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["2715"],"URL":"https:\/\/doi.org\/10.1007\/s12190-025-02715-6","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,3]]},"assertion":[{"value":"18 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 November 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 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 they have no competing financial interests or personal connections that could influence the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"69"}}