{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T21:07:10Z","timestamp":1780434430745,"version":"3.54.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,6,24]],"date-time":"2020-06-24T00:00:00Z","timestamp":1592956800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,24]],"date-time":"2020-06-24T00:00:00Z","timestamp":1592956800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11671122"],"award-info":[{"award-number":["11671122"]}],"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":["11871196"],"award-info":[{"award-number":["11871196"]}],"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":["11171094"],"award-info":[{"award-number":["11171094"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s10898-020-00919-7","type":"journal-article","created":{"date-parts":[[2020,6,24]],"date-time":"2020-06-24T04:13:36Z","timestamp":1592972016000},"page":"453-482","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["Outer space branch and bound algorithm for solving linear multiplicative programming problems"],"prefix":"10.1007","volume":"78","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5649-911X","authenticated-orcid":false,"given":"Peiping","family":"Shen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kaimin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ting","family":"Lu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,6,24]]},"reference":[{"key":"919_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-31484-6","volume-title":"Convex Analysis and Global Optimization","author":"H Tuy","year":"2016","unstructured":"Tuy, H.: Convex Analysis and Global Optimization, 2nd edn. Kluwer Academic, Dordrecht (2016)","edition":"2"},{"key":"919_CR2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.cam.2016.12.037","volume":"319","author":"Y Zhao","year":"2017","unstructured":"Zhao, Y., Liu, S.: Global optimization algorithm for mixed integer quadratically constrained quadratic program. J. Comput. Appl. Math. 319, 159\u2013169 (2017)","journal-title":"J. Comput. Appl. Math."},{"key":"919_CR3","unstructured":"Konno, H., Yajima, Y.: Solving rank two bilinear programs by parametric simplex algorithms. Technical Report IHSS Report 90-17, Institute of Human And Social Sciences, Tokyo Institute of Technology (1990)"},{"key":"919_CR4","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1287\/opre.17.4.680","volume":"17","author":"M Raghavachari","year":"1969","unstructured":"Raghavachari, M.: On connections between zero-one integer programming and concave programming under linear constraints. Oper. Res. 17, 680\u2013684 (1969)","journal-title":"Oper. Res."},{"key":"919_CR5","first-page":"309","volume":"9","author":"I Quesada","year":"1996","unstructured":"Quesada, I., Grossmann, I.E.: Alternative bounding applications for the global optimization of various engineering design problems. Glob. Optim. Eng. Des. Nonconvex Optim. Appl. 9, 309\u2013331 (1996)","journal-title":"Glob. Optim. Eng. Des. Nonconvex Optim. Appl."},{"key":"919_CR6","first-page":"143","volume":"32","author":"H Konno","year":"1988","unstructured":"Konno, H., Inori, M.: Bond portfolio optimization by bilinear fractional programming. J. Oper. Res. Soc. Jpn. 32, 143\u2013158 (1988)","journal-title":"J. Oper. Res. Soc. Jpn."},{"issue":"3","key":"919_CR7","first-page":"295","volume":"39","author":"H Konno","year":"1994","unstructured":"Konno, H., Wantanabe, H.: Bond portfolio optimization problems and their applications to index tracking. J. Oper. Res. Soc. Jpn. 39(3), 295\u2013306 (1994)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"919_CR8","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1007\/s11047-017-9630-5","volume":"17","author":"C Wang","year":"2018","unstructured":"Wang, C., Liu, K.: An improved particle optimization algorithm based on comparative judgement. Nat. Comput. 17, 641\u2013661 (2018)","journal-title":"Nat. Comput."},{"key":"919_CR9","doi-asserted-by":"crossref","first-page":"1405","DOI":"10.1016\/S0165-1889(97)00032-8","volume":"21","author":"C Maranas","year":"1997","unstructured":"Maranas, C., Androulakis, I., Flounda, C., Berger, A., Mulvey, J.: Solving long-term financial planning problems via global optimization. J. Econ. Dyn. Control 21, 1405\u20131425 (1997)","journal-title":"J. Econ. Dyn. Control"},{"key":"919_CR10","doi-asserted-by":"crossref","first-page":"1123","DOI":"10.1007\/s10898-012-9933-0","volume":"56","author":"P Shen","year":"2013","unstructured":"Shen, P., Li, X.: Branch-reduction-bound algorithm for generalized geometric programming. J. Glob. Optim. 56, 1123\u20131142 (2013)","journal-title":"J. Glob. Optim."},{"key":"919_CR11","first-page":"116","volume":"242","author":"P Shen","year":"2014","unstructured":"Shen, P., Yang, L., Liang, Y.: Range division and contraction algorithm for a class of global optimization problems. Appl. Math. Comput. 242, 116\u2013126 (2014)","journal-title":"Appl. Math. Comput."},{"key":"919_CR12","first-page":"797","volume":"273","author":"Y Pei","year":"2016","unstructured":"Pei, Y., Zhu, D.: Local convergence of a trust-region algorithm with line search filter technique for nonlinear constrained optimization. Appl. Math. Comput. 273, 797\u2013808 (2016)","journal-title":"Appl. Math. Comput."},{"key":"919_CR13","doi-asserted-by":"crossref","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."},{"key":"919_CR14","first-page":"156","volume":"26","author":"KP Bennett","year":"1994","unstructured":"Bennett, K.P.: Global tree optimization: a non-greedy decision tree algorithm. Comput. Sci. Stat. 26, 156\u2013160 (1994)","journal-title":"Comput. Sci. Stat."},{"issue":"2","key":"919_CR15","doi-asserted-by":"crossref","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."},{"key":"919_CR16","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1287\/opre.43.2.264","volume":"43","author":"J Mulvey","year":"1995","unstructured":"Mulvey, J., Vanderbei, R., Zenios, S.: Robust optimization of large-scale systems. Oper. Res. 43, 264\u2013281 (1995)","journal-title":"Oper. Res."},{"key":"919_CR17","volume-title":"Generalized Convexity and Optimization: Theory and Applications","author":"A Cambini","year":"2009","unstructured":"Cambini, A., Martein, L.: Generalized Convexity and Optimization: Theory and Applications. Springer, Berlin (2009)"},{"issue":"10","key":"919_CR18","doi-asserted-by":"crossref","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":"1","key":"919_CR19","doi-asserted-by":"crossref","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. Eur. J. Oper. Res. 207(1), 25\u201329 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"919_CR20","doi-asserted-by":"crossref","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. Numer. Funct. Anal. Optim. 38(11), 1426\u20131445 (2017)","journal-title":"Numer. Funct. Anal. Optim."},{"issue":"1","key":"919_CR21","doi-asserted-by":"crossref","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. Comput. Appl. Math. 36(1), 225\u2013247 (2017)","journal-title":"Comput. Appl. Math."},{"issue":"2","key":"919_CR22","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/BF02192573","volume":"87","author":"S Schaible","year":"1995","unstructured":"Schaible, S., Sodini, C.: Finite algorithm for generalized multiplicative programming. J. Optim. Theory Appl. 87(2), 441\u2013455 (1995)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"919_CR23","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s10898-009-9460-9","volume":"47","author":"R\u00fabia M Oliveira","year":"2010","unstructured":"Oliveira, R\u00fabia M., Ferreira, P.A.V.: An outcome space approach for generalized convex multiplicative programs. J. Glob. Optim. 47(1), 107\u2013118 (2010)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"919_CR24","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1186\/s13660-017-1342-y","volume":"2017","author":"P Shen","year":"2017","unstructured":"Shen, P., Wang, C.: Linear decomposition approach for a class of nonconvex programming problems. J. Inequal. Appl. 2017(1), 74 (2017)","journal-title":"J. Inequal. Appl."},{"key":"919_CR25","doi-asserted-by":"crossref","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. J. Comput. Appl. Math. 350, 324\u2013342 (2019)","journal-title":"J. Comput. Appl. Math."},{"key":"919_CR26","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1023\/A:1004657629105","volume":"104","author":"H Benson","year":"2000","unstructured":"Benson, H., Boger, G.: Outcome-space cutting-plane algorithm for linear multiplicative programming. J. Optim. Theory Appl. 104, 301\u2013332 (2000)","journal-title":"J. Optim. Theory Appl."},{"key":"919_CR27","doi-asserted-by":"crossref","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":"919_CR28","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/641909","author":"L Yang","year":"2014","unstructured":"Yang, L., Shen, P., Pei, Y.: A global optimization approach for solving generalized nonlinear multiplicative programming problem. Abstr. Appl. Anal. (2014). https:\/\/doi.org\/10.1155\/2014\/641909","journal-title":"Abstr. Appl. Anal."},{"key":"919_CR29","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1023\/A:1024700901538","volume":"26","author":"HS Ryoo","year":"2003","unstructured":"Ryoo, H.S., Sahinidis, N.V.: Global optimization of multiplicative programs. J. Glob. Optim. 26, 387\u2013418 (2003)","journal-title":"J. Glob. Optim."},{"key":"919_CR30","doi-asserted-by":"crossref","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.: Gobal minmization of a generalized linear multipicative programming. Appl. Math. Model. 36, 2446\u20132451 (2012)","journal-title":"Appl. Math. Model."},{"key":"919_CR31","doi-asserted-by":"publisher","DOI":"10.1186\/s40064-016-2984-9","author":"Y Zhao","year":"2016","unstructured":"Zhao, Y., Liu, S.: An efficient method for generalized linear multiplicative programming problem with multiplicative constraints. SpringerPlus (2016). https:\/\/doi.org\/10.1186\/s40064-016-2984-9","journal-title":"SpringerPlus"},{"key":"919_CR32","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/9146309","author":"Y Zhao","year":"2018","unstructured":"Zhao, Y., Zhao, T.: Global optimization for generalized linear multiplicative programming using convex relaxation. Math. Probl. Eng. (2018). https:\/\/doi.org\/10.1155\/2018\/9146309","journal-title":"Math. Probl. Eng."},{"key":"919_CR33","doi-asserted-by":"crossref","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":"1","key":"919_CR34","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s00186-009-0289-2","volume":"71","author":"R Cambini","year":"2010","unstructured":"Cambini, R., Sodini, C.: Global optimization of a rank-two nonconvex program. Math. Methods Oper. Res. 71(1), 165\u2013180 (2010)","journal-title":"Math. Methods Oper. Res."},{"key":"919_CR35","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1007\/s12190-012-0576-6","volume":"40","author":"H Jiao","year":"2012","unstructured":"Jiao, H., Liu, S., Chen, Y.: Global optimization algorithm of a generalized linear multiplicative programmin. J. Appl. Math. Comput. 40, 551\u2013568 (2012)","journal-title":"J. Appl. Math. Comput."},{"key":"919_CR36","first-page":"675","volume":"3801","author":"Y Gao","year":"2005","unstructured":"Gao, Y., Xu, C., Yang, Y.: Outcome-space branch and bound algorithm for solving linear multiplicative programming. Comput. Intell. Secur. 3801, 675\u2013681 (2005)","journal-title":"Comput. Intell. Secur."},{"issue":"2","key":"919_CR37","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/s10255-015-0456-6","volume":"31","author":"X Zhou","year":"2015","unstructured":"Zhou, X., Cao, B., Wu, K.: Gobal optimization method for linear multiplicative programming. Acta Math. Appl. Sin. 31(2), 325\u2013334 (2015)","journal-title":"Acta Math. Appl. Sin."},{"issue":"3","key":"919_CR38","doi-asserted-by":"crossref","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":"919_CR39","doi-asserted-by":"crossref","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."},{"key":"919_CR40","first-page":"790","volume-title":"A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems","author":"HD Sherali","year":"1998","unstructured":"Sherali, H.D., Adams, W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems, p. 790. Springer, Berlin (1998)"},{"issue":"1","key":"919_CR41","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L Vandenberghe","year":"1996","unstructured":"Vandenberghe, L., Boyd, S.: Semidefinite programming. SIAM Rev. 38(1), 49\u201395 (1996)","journal-title":"SIAM Rev."},{"key":"919_CR42","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10898-008-9372-0","volume":"43","author":"KM Anstreicher","year":"2009","unstructured":"Anstreicher, K.M.: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming. J. Glob. Optim. 43, 471\u2013484 (2009)","journal-title":"J. Glob. Optim."},{"key":"919_CR43","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1007\/s10898-010-9630-9","volume":"50","author":"X Zheng","year":"2011","unstructured":"Zheng, X., Sun, X., Li, D.: Nonconvex quadratically constrained quadratic programming: best D.C. decompositions and their SDP representations. J. Glob. Optim. 50, 695\u2013712 (2011)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"919_CR44","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12532-010-0010-8","volume":"2","author":"S Burer","year":"2010","unstructured":"Burer, S.: Optimizing a polyhedral-semidefinite relaxation of completely positive programs. Math. Program. Comput. 2(1), 1\u201319 (2010)","journal-title":"Math. Program. Comput."},{"key":"919_CR45","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1023\/A:1008288411710","volume":"11","author":"Le Thi Hoai An","year":"1997","unstructured":"An, Le Thi Hoai, Tao, Pham Dinh: Solving a class of linearly constrained indefinite quadratic problems by D.C. algorithms. J. Glob. Optim. 11, 253\u2013285 (1997)","journal-title":"J. Glob. Optim."},{"key":"919_CR46","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"NV Sahinidis","year":"1996","unstructured":"Sahinidis, N.V.: BARON: a general purpose global optimization software package. J. Glob. Optim. 8, 201\u2013205 (1996)","journal-title":"J. Glob. Optim."},{"key":"919_CR47","unstructured":"Grant, M., Boyd, S.: CVX: Matlab software for disciplined convex programming, version 2.1 (2018). http:\/\/cvxr.com\/cvx"},{"key":"919_CR48","unstructured":"IBM ILOG CPLEX: IBM ILOG CPLEX 12.3 User\u2019s Manual for CPLEX, 89 (2011)"},{"key":"919_CR49","doi-asserted-by":"crossref","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.: An FPTAS for minimizing the product of two non-negative linear cost functions. Math. Program. 126, 401\u2013405 (2011)","journal-title":"Math. Program."},{"issue":"2","key":"919_CR50","doi-asserted-by":"crossref","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(2), 113\u2013119 (1996)","journal-title":"J. Glob. Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00919-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-020-00919-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00919-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,23]],"date-time":"2021-06-23T23:29:45Z","timestamp":1624490985000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-020-00919-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,24]]},"references-count":50,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["919"],"URL":"https:\/\/doi.org\/10.1007\/s10898-020-00919-7","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,24]]},"assertion":[{"value":"27 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}