{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T15:36:26Z","timestamp":1774280186163,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,6,5]],"date-time":"2024-06-05T00:00:00Z","timestamp":1717545600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,5]],"date-time":"2024-06-05T00:00:00Z","timestamp":1717545600000},"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"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["41962016"],"award-info":[{"award-number":["41962016"]}],"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":"Basic discipline research projects supported by Nanjing Securities","award":["NJZQJCXK202201"],"award-info":[{"award-number":["NJZQJCXK202201"]}]},{"name":"Construction Project of first-class subjects in Hydraulic Engineering","award":["NXYLXK2021A03"],"award-info":[{"award-number":["NXYLXK2021A03"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s10957-024-02461-y","type":"journal-article","created":{"date-parts":[[2024,6,5]],"date-time":"2024-06-05T19:01:51Z","timestamp":1717614111000},"page":"997-1026","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Output-Space Outer Approximation Branch-and-Bound Algorithm for a Class of Linear Multiplicative Programs"],"prefix":"10.1007","volume":"202","author":[{"given":"Bo","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Hongyu","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2021-2097","authenticated-orcid":false,"given":"Yuelin","family":"Gao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,5]]},"reference":[{"key":"2461_CR1","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, 253\u2013257 (1979)","journal-title":"J. Optim. Theory Appl."},{"key":"2461_CR2","first-page":"156","volume":"26","author":"K Bennett","year":"1994","unstructured":"Bennett, K.: Global tree optimization: a non-greedy decision tree algorithm. Comput. Sci. Stat. 26, 156\u2013160 (1994)","journal-title":"Comput. Sci. Stat."},{"key":"2461_CR3","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, 487\u2013510 (1997)","journal-title":"J. Optim. Theory Appl."},{"key":"2461_CR4","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, 301\u2013332 (2000)","journal-title":"J. Optim. Theory Appl."},{"key":"2461_CR5","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, 41\u201361 (2005)","journal-title":"J. Optim. Theory Appl."},{"key":"2461_CR6","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. Comput. Oper. Res. 36, 2573\u20132579 (2009)","journal-title":"Comput. Oper. Res."},{"key":"2461_CR7","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. Optim. 25, 131\u2013154 (1995)","journal-title":"Eng. Optim."},{"key":"2461_CR8","first-page":"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. For. Sci. 44, 421\u2013429 (1998)","journal-title":"For. Sci."},{"key":"2461_CR9","unstructured":"Gleixner, A., Eifler, L., Gally, T., Gamrath, G., Gemander, P., Gottwald, R.L., Hendel, G., Hojny, C., Koch, T., Miltenberger, M., M\u00fcller, B., Pfetsch, M-E., Puchert, C., Rehfeldt, D., Schl\u00f6sser, F., Serrano, F., Shinano, Y., Viernickel, J.M., Vigerske, S., Weninger, D., Witt, J-T., Witzig, J.: The SCIP Optimization Suite. https:\/\/www.scipopt.org\/index.php\/download, v5.0.1 (2017)"},{"key":"2461_CR10","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, 494\u2013505 (2006)","journal-title":"Appl. Math. Comput."},{"key":"2461_CR11","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, 1206\u20131218 (2010)","journal-title":"Appl. Math. Comput."},{"key":"2461_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.: A branch and bound algorithm for globally solving a class of nonconvex programming problems. Nonlinear Anal. 70, 1113\u20131123 (2009)","journal-title":"Nonlinear Anal."},{"key":"2461_CR13","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.L.: 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."},{"key":"2461_CR14","doi-asserted-by":"crossref","unstructured":"Jiao, H., Wang, W., Shang, Y.L.: Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems. J. Comput. Appl. Math. 419, article number: 114784 (2023)","DOI":"10.1016\/j.cam.2022.114784"},{"key":"2461_CR15","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. Glob. Optim. 1, 65\u201381 (1991)","journal-title":"J. Glob. Optim."},{"key":"2461_CR16","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. Glob. Optim. 3, 325\u2013335 (1993)","journal-title":"J. Glob. Optim."},{"key":"2461_CR17","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, 295\u2013303 (1993)","journal-title":"Oper. Res. Lett."},{"key":"2461_CR18","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF01096534","volume":"41","author":"H Konno","year":"1994","unstructured":"Konno, H., Kuno, T., Yajima, Y.: Global optimization of a generalized convex multiplicative function. J. Glob. Optim. 41, 47\u201362 (1994)","journal-title":"J. Glob. Optim."},{"key":"2461_CR19","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/BFb0120986","volume":"19","author":"P Loridan","year":"1982","unstructured":"Loridan, P.: Necessary conditions for $$\\epsilon $$-optimality. Math. Program. Stud. 19, 140\u2013152 (1982)","journal-title":"Math. Program. Stud."},{"key":"2461_CR20","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. Glob. Optim. 15, 433\u2013447 (1999)","journal-title":"J. Glob. Optim."},{"key":"2461_CR21","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1016\/j.cam.2015.11.009","volume":"296","author":"SY Liu","year":"2016","unstructured":"Liu, S.Y., Zhao, Y.F.: An efficient algorithm for globally solving generalized linear multiplicative programming. J. Comput. Appl. Math. 296, 840\u2013847 (2016)","journal-title":"J. Comput. Appl. Math."},{"key":"2461_CR22","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, 264\u2013281 (1995)","journal-title":"Oper. Res."},{"key":"2461_CR23","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. Glob. Optim. 9, 113\u2013119 (1996)","journal-title":"J. Glob. Optim."},{"key":"2461_CR24","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, 1405\u20131425 (1997)","journal-title":"J. Econ. Dyn. Control."},{"key":"2461_CR25","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, 105178 (2021)","journal-title":"Comput. Oper. Res."},{"key":"2461_CR26","doi-asserted-by":"publisher","first-page":"8793","DOI":"10.1016\/j.eswa.2010.06.026","volume":"37","author":"SR Nanda","year":"2010","unstructured":"Nanda, S.R., Mahanty, B., Tiwari, M.K.: Clustering Indian stock market data for portfolio management. Expert Syst. Appl. 37, 8793\u20138798 (2010)","journal-title":"Expert Syst. Appl."},{"key":"2461_CR27","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, 211 (1980)","journal-title":"Economica"},{"key":"2461_CR28","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1023\/A:1011295715398","volume":"19","author":"HS Ryoo","year":"2001","unstructured":"Ryoo, H.S., Sahinidis, N.V.: Analysis of bounds for multilinear functions. J. Glob. Optim. 19, 403\u2013424 (2001)","journal-title":"J. Glob. Optim."},{"key":"2461_CR29","first-page":"23","volume":"6","author":"AN Reza","year":"2017","unstructured":"Reza, A.N.: Minimizing the risk in investment projects. Eur. J. Sustain. Dev. 6, 23\u201330 (2017)","journal-title":"Eur. J. Sustain. Dev."},{"key":"2461_CR30","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, 415\u2013431 (2016)","journal-title":"Optimization"},{"key":"2461_CR31","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/j.cam.2018.10.038","volume":"350","author":"PP Shen","year":"2019","unstructured":"Shen, P.P., Huang, B.D., Wang, L.F.: 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":"2461_CR32","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s10898-020-00919-7","volume":"78","author":"PP Shen","year":"2020","unstructured":"Shen, P.P., Wang, K., Lu, T.: Outer space branch and bound algorithm for solving linear multiplicative programming problems. J. Glob. Optim. 78, 453\u2013482 (2020)","journal-title":"J. Glob. Optim."},{"key":"2461_CR33","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1016\/j.cor.2010.10.016","volume":"38","author":"CF Wang","year":"2011","unstructured":"Wang, C.F., Liu, S.Y.: A new linearization method for generalized linear multiplicative programming. Comput. Oper. Res. 38, 1008\u20131013 (2011)","journal-title":"Comput. Oper. Res."},{"key":"2461_CR34","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1080\/02331934.2016.1269765","volume":"66","author":"CF Wang","year":"2017","unstructured":"Wang, C.F., Bai, Y.Q., Shen, P.P.: A practicable branch-and-bound algorithm for globally solving linear multiplicative programming. Optimization 66, 397\u2013405 (2017)","journal-title":"Optimization"},{"key":"2461_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2021.114080","volume":"407","author":"CF Wang","year":"2022","unstructured":"Wang, C.F., Deng, Y.P., Shen, P.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."},{"key":"2461_CR36","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, 1412\u20131417 (2005)","journal-title":"Appl. Math. Comput."},{"key":"2461_CR37","doi-asserted-by":"crossref","unstructured":"Zhang, B., Gao, Y.L., Liu, X., Huang, X.L.: Output-space branch-and-bound reduction algorithm for a class of linear multiplicative programs. Mathematics 8, article number: 315 (2020)","DOI":"10.3390\/math8030315"},{"key":"2461_CR38","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.L., Liu, X., Huang, X.L.: An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems. J. Optim. Theory Appl. 192, 830\u2013855 (2022)","journal-title":"J. Optim. Theory Appl."},{"key":"2461_CR39","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.L., Liu, X., Huang, X.L.: Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems. J. Glob. Optim. 86, 61\u201392 (2023)","journal-title":"J. Glob. Optim."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02461-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-024-02461-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02461-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:04:32Z","timestamp":1725458672000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-024-02461-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,5]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["2461"],"URL":"https:\/\/doi.org\/10.1007\/s10957-024-02461-y","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,5]]},"assertion":[{"value":"19 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}