{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T13:51:17Z","timestamp":1754488277447},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,7,18]],"date-time":"2024-07-18T00:00:00Z","timestamp":1721260800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,18]],"date-time":"2024-07-18T00:00:00Z","timestamp":1721260800000},"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 Glob Optim"],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1007\/s10898-024-01416-x","type":"journal-article","created":{"date-parts":[[2024,7,18]],"date-time":"2024-07-18T09:01:57Z","timestamp":1721293317000},"page":"573-592","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A method based on parametric convex programming for solving convex multiplicative programming problem"],"prefix":"10.1007","volume":"90","author":[{"given":"Yunchol","family":"Jong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongjin","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyonchol","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,18]]},"reference":[{"key":"1416_CR1","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.: Solving long-term financial planning problems via global optimization. J. Econ. Dyn. Control. 21, 1405\u20131425 (1997)","journal-title":"J. Econ. Dyn. Control."},{"key":"1416_CR2","doi-asserted-by":"crossref","unstructured":"Quesada, I., Grossmann, I.: Alternative bounding approximations for the global optimization of various engineering design problems. In: Grossmann, I. (ed.). Global Optimization in Engineering Design. Nonconvex Optimization and its Applications. Vol. 9, Kluwer Academic Publishers, Norwell, MA, pp. 309\u2013331 (1996)","DOI":"10.1007\/978-1-4757-5331-8_10"},{"key":"1416_CR3","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.: Robust optimization of large-scale systems. Oper. Res. 43, 264\u2013281 (1995)","journal-title":"Oper. Res."},{"issue":"2","key":"1416_CR4","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. Opt. 25(2), 131\u2013154 (1995)","journal-title":"Eng. Opt."},{"key":"1416_CR5","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF01299449","volume":"2","author":"K Bennett","year":"1994","unstructured":"Bennett, K., Mangasarian, O.: Bilinear separation of two sets in $$n$$-space. Comput. Opt. Appl. 2, 207\u2013227 (1994)","journal-title":"Comput. Opt. Appl."},{"key":"1416_CR6","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. Glob. Opt. 78, 453\u2013482 (2020)","journal-title":"J. Glob. Opt."},{"key":"1416_CR7","doi-asserted-by":"crossref","unstructured":"Zhang, B., Gao,Y., Liu, X.: Output-space branch-and-bound reduction algorithm for a class of linear multiplicative programs. Mathematics 8(35) (2020)","DOI":"10.3390\/math8030315"},{"key":"1416_CR8","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2016.1269765","author":"C Wang","year":"2017","unstructured":"Wang, C., Bai, Y., Shen, P.: A practicable branch-and-bound algorithm for globally solving linear multiplicative programming. Optimization (2017). https:\/\/doi.org\/10.1080\/02331934.2016.1269765","journal-title":"Optimization"},{"issue":"2","key":"1416_CR9","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10255-015-0456-6","volume":"31","author":"X Zhou","year":"2015","unstructured":"Zhou, X., Cao, B., Wu, K.: Global optimization method for linear multiplicative programming. Acta Math. Appl. Sin E. 31(2), 325\u2013334 (2015)","journal-title":"Acta Math. Appl. Sin E."},{"key":"1416_CR10","doi-asserted-by":"crossref","unstructured":"Zhao, Y., Liu, S.: An efficient method for generalized linear multiplicative programming problem with multiplicative constraints. SpringerPlus. 5, 1302 (2016). DOI: https:\/\/doi.org\/10.1186\/s40064-016-2984-9","DOI":"10.1186\/s40064-016-2984-9"},{"key":"1416_CR11","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s10957-010-9782-2","volume":"149","author":"AM Ashtiani","year":"2011","unstructured":"Ashtiani, A.M., Ferreira, P.A.V.: On the Solution of Generalized Multiplicative Extremum Problems. J. Opt. Theory Appl. 149, 411\u2013419 (2011)","journal-title":"J. Opt. Theory Appl."},{"key":"1416_CR12","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10898-009-9460-9","volume":"47","author":"RM Oliveira","year":"2010","unstructured":"Oliveira, R.M., Ferreira, P.A.V.: An outcome space approach for generalized convex multiplicative programs. J. Glob. Opt. 47, 107\u2013118 (2010)","journal-title":"J. Glob. Opt."},{"key":"1416_CR13","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF00119935","volume":"1","author":"T Kuno","year":"1991","unstructured":"Kuno, T., Konno, H.: A parametric successive underestimation method for convex multiplicative programming problems. J. Glob. Opt. 1, 267\u2013286 (1991)","journal-title":"J. Glob. Opt."},{"key":"1416_CR14","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0167-6377(95)00014-B","volume":"17","author":"T Phong","year":"1995","unstructured":"Phong, T., An, L., Tao, P.: On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method. Oper. Res. Lett. 17, 215\u2013220 (1995)","journal-title":"Oper. Res. Lett."},{"key":"1416_CR15","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.: Convex Analysis and Global Optimization. Kluwer Academic, Dordrecht (1998)"},{"key":"1416_CR16","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. Opt. 9, 113\u2013119 (1996)","journal-title":"J. Glob. Opt."},{"key":"1416_CR17","doi-asserted-by":"publisher","first-page":"150","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. Opt. Theory Appl. 137, 150\u2013170 (2008)","journal-title":"J. Opt. Theory Appl."},{"key":"1416_CR18","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF00130830","volume":"1","author":"N Thoai","year":"1991","unstructured":"Thoai, N.: A global optimization approach for solving the convex multiplicative programming problems. J. Glob. Opt. 1, 341\u2013357 (1991)","journal-title":"J. Glob. Opt."},{"key":"1416_CR19","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, 328\u2013336 (2006)","journal-title":"Appl. Math. Comput."},{"key":"1416_CR20","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1016\/j.cam.2008.03.031","volume":"223","author":"X Zhou","year":"2009","unstructured":"Zhou, X., Wu, K.: A method of acceleration for a class of multiplicative programming problems with exponent. J. Comput. Appl. Math. 223, 975\u2013982 (2009)","journal-title":"J. Comput. Appl. Math."},{"key":"1416_CR21","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1080\/02331939008843615","volume":"21","author":"P Pardalos","year":"1990","unstructured":"Pardalos, P.: Polynomial time algorithms for some classes of constrained quadratic problems. Optimization 21, 843\u2013853 (1990)","journal-title":"Optimization"},{"key":"1416_CR22","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF01096535","volume":"4","author":"J Falk","year":"1994","unstructured":"Falk, J., Palocsa, S.: Image space analysis of generalized fractional programs. J. Glob. Opt. 4, 63\u201388 (1994)","journal-title":"J. Glob. Opt."},{"key":"1416_CR23","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/BF02192573","volume":"87","author":"S Schaible","year":"1995","unstructured":"Schaible, S., Sodini, C.: Finite algorithm for generalized linear multiplicative programming. J. Opt. Theory Appl. 87, 441\u2013455 (1995)","journal-title":"J. Opt. Theory Appl."},{"key":"1416_CR24","doi-asserted-by":"publisher","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. Opt. Theory Appl. 104, 301\u2013322 (2000)","journal-title":"J. Opt. Theory Appl."},{"key":"1416_CR25","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1023\/A:1008308913266","volume":"4","author":"X Liu","year":"1999","unstructured":"Liu, X., Umegaki, T., Yamamoto, Y.: Heuristic methods for linear multiplicative programming. J. Glob. Opt. 4, 433\u2013447 (1999)","journal-title":"J. Glob. Opt."},{"key":"1416_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02947-3","volume-title":"Global Optimization: Deterministic Approaches","author":"R Horst","year":"1993","unstructured":"Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches. Springer-Verlag, Berlin (1993)"},{"key":"1416_CR27","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, 51\u201364 (1992)","journal-title":"Math. Program."},{"key":"1416_CR28","doi-asserted-by":"crossref","unstructured":"Konno, H., Kuno, T.: Multiplicative programming problems. In: Horst, R., Pardalos, P., (eds.), Handbook of Global Optimization. Kluwer, Dordrecht, The Netherlands, pp. 369\u2013405 (1995)","DOI":"10.1007\/978-1-4615-2025-2_8"},{"key":"1416_CR29","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. Opt. 1, 65\u201381 (1991)","journal-title":"J. Glob. Opt."},{"key":"1416_CR30","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/BF02192573","volume":"87","author":"S Schaible","year":"1995","unstructured":"Schaible, S., Sodini, C.: Finite algorithm for generalized linear multiplicative programming. J. Opt. Theory Appl. 87, 441\u2013455 (1995)","journal-title":"J. Opt. Theory Appl."},{"key":"1416_CR31","first-page":"63","volume":"399","author":"T Kuno","year":"1996","unstructured":"Kuno, T.: A practical algorithm for minimizing a rank-two saddle function on a polytope. J. Oper. Res. Soc. Japan 399, 63\u201376 (1996)","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"1416_CR32","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02283691","volume":"25","author":"H Konno","year":"1990","unstructured":"Konno, H., Kuno, T.: Generalized linear multiplicative and fractional programming. Ann. Oper. Res. 25, 147\u2013161 (1990)","journal-title":"Ann. Oper. Res."},{"key":"1416_CR33","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/0377-2217(84)90262-5","volume":"18","author":"Y Aneja","year":"1984","unstructured":"Aneja, Y., Aggarwal, V., Nair, K.: On a class of quadratic programs. Eur. J. Oper. Res. 18, 62\u201370 (1984)","journal-title":"Eur. J. Oper. Res."},{"key":"1416_CR34","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1080\/02331939208843778","volume":"24","author":"H Tuy","year":"1992","unstructured":"Tuy, H., Tam, B.: An efficient solution method for rank-two quasiconcave minimization problems. Optimization 24, 43\u201356 (1992)","journal-title":"Optimization"},{"key":"1416_CR35","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.: Global minimization of a generalized convex multiplicative function. J. Glob. Opt. 4, 47\u201362 (1994)","journal-title":"J. Glob. Opt."},{"key":"1416_CR36","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1023\/A:1008316429329","volume":"15","author":"H Benson","year":"1999","unstructured":"Benson, H.: An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming. J. Glob. Opt. 15, 315\u2013342 (1999)","journal-title":"J. Glob. Opt."},{"key":"1416_CR37","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. Glob. Opt. 18, 283\u2013299 (2000)","journal-title":"J. Glob. Opt."},{"key":"1416_CR38","doi-asserted-by":"publisher","DOI":"10.1002\/0471787779","volume-title":"Nonlinear Programming: Theory and Algorithms","author":"M Bazara","year":"2006","unstructured":"Bazara, M., Sherali, H., Shetty, C.: Nonlinear Programming: Theory and Algorithms. John Wiley and Sons, New York (2006)"},{"key":"1416_CR39","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.: A new linearization method for generalized linear multiplicative programming. Comput. Oper Res. 38, 1008\u20131013 (2011)","journal-title":"Comput. Oper Res."},{"key":"1416_CR40","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1023\/A:1024700901538","volume":"26","author":"H Ryoo","year":"2003","unstructured":"Ryoo, H., Sahinidis, N.: Global optimization of multiplicative programs. J. Glob. Opt. 26, 387\u2013418 (2003)","journal-title":"J. Glob. Opt."},{"issue":"1","key":"1416_CR41","first-page":"271","volume":"6","author":"H Jiao","year":"2014","unstructured":"Jiao, H., Li, K., Wang, J.: An optimization algorithm for solving a class of multiplicative problems. J. Chem. Pharm. Res. 6(1), 271\u2013277 (2014)","journal-title":"J. Chem. Pharm. Res."},{"key":"1416_CR42","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."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-024-01416-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-024-01416-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-024-01416-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T10:04:56Z","timestamp":1729073096000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-024-01416-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,18]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["1416"],"URL":"https:\/\/doi.org\/10.1007\/s10898-024-01416-x","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2024,7,18]]},"assertion":[{"value":"13 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2024","order":3,"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 no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}