{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T18:02:45Z","timestamp":1770746565967,"version":"3.49.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T00:00:00Z","timestamp":1693267200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T00:00:00Z","timestamp":1693267200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007514","name":"Universit\u00e0 di Pisa","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007514","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Manag Sci"],"published-print":{"date-parts":[[2023,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper, linear multiplicative programs are approached with a branch-and-bound scheme and a detailed computational study is provided. Several underestimation functions are analyzed and various partitioning criteria are presented. A particular class of linear multiplicative programs, useful to solve some applicative bilevel problems, is considered from a theoretical point of view to emphasize an efficient solution method. Detailed results of the computational study are provided to point out the performances provided by using various underestimation functions and partitioning criteria, thus improving some of the results of the current literature.<\/jats:p>","DOI":"10.1007\/s10287-023-00471-1","type":"journal-article","created":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T05:02:07Z","timestamp":1693285327000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Solving linear multiplicative programs via branch-and-bound: a computational experience"],"prefix":"10.1007","volume":"20","author":[{"given":"R.","family":"Cambini","sequence":"first","affiliation":[]},{"given":"R.","family":"Riccardi","sequence":"additional","affiliation":[]},{"given":"D.","family":"Scopelliti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,29]]},"reference":[{"key":"471_CR2","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/s10957-019-01529-4","volume":"182","author":"D Aussel","year":"2019","unstructured":"Aussel D, Svensson A (2019) Towards tractable constraint qualifications for parametric optimisation problems and applications to generalised nash games. J Optim Theory Appl 182:404\u2013416. https:\/\/doi.org\/10.1007\/s10957-019-01529-4","journal-title":"J Optim Theory Appl"},{"key":"471_CR3","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10898-020-00883-2","volume":"77","author":"I Bajaj","year":"2020","unstructured":"Bajaj I, Faruque Hasan MM (2020) Global dynamic optimization using edge-concave underestimator. J Glob Optim 77:487\u2013512. https:\/\/doi.org\/10.1007\/s10898-020-00883-2","journal-title":"J Glob Optim"},{"key":"471_CR4","volume-title":"Practical bilevel optimization: algorithms and applications","author":"JF Bard","year":"1997","unstructured":"Bard JF (1997) Practical bilevel optimization: algorithms and applications. Kluwer Academic Publishers, Alphen aan den Rijn"},{"key":"471_CR5","series-title":"Lecture notes in economics and mathematical systems","volume-title":"Generalized convexity and optimization: theory and applications","author":"A Cambini","year":"2009","unstructured":"Cambini A, Martein L (2009) Generalized convexity and optimization: theory and applications. Lecture notes in economics and mathematical systems. Springer, Berlin"},{"key":"471_CR6","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10898-004-6095-8","volume":"33","author":"R Cambini","year":"2005","unstructured":"Cambini R, Sodini C (2005) Decomposition methods for solving nonconvex quadratic programs via branch and bound. J Glob Optim 33:313\u2013336. https:\/\/doi.org\/10.1007\/s10898-004-6095-8","journal-title":"J Glob Optim"},{"key":"471_CR7","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s10100-007-0049-4","volume":"16","author":"R Cambini","year":"2008","unstructured":"Cambini R, Sodini C (2008) A computational comparison of some branch and bound methods for indefinite quadratic programs. Cent Eur J Oper 16:139\u2013152. https:\/\/doi.org\/10.1007\/s10100-007-0049-4","journal-title":"Cent Eur J Oper"},{"key":"471_CR9","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1016\/j.cam.2009.07.053","volume":"233","author":"R Cambini","year":"2009","unstructured":"Cambini R, Salvi F (2009) A branch and reduce approach for solving a class of low rank d.c. programs. J Comput Appl Math. 233:492\u2013501. https:\/\/doi.org\/10.1016\/j.cam.2009.07.053","journal-title":"J Comput Appl Math."},{"key":"471_CR10","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1016\/j.orl.2010.07.008","volume":"38","author":"R Cambini","year":"2010","unstructured":"Cambini R, Salvi F (2010) Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience. Oper Res Lett. 38:354\u2013357. https:\/\/doi.org\/10.1016\/j.orl.2010.07.008","journal-title":"Oper Res Lett."},{"key":"471_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-52119-6","volume-title":"Bilevel optimization: theory, algorithms, applications and a bibliography","author":"S Dempe","year":"2020","unstructured":"Dempe S (2020) Bilevel optimization: theory, algorithms, applications and a bibliography. Springer, Berlin"},{"key":"471_CR13","doi-asserted-by":"publisher","first-page":"1202","DOI":"10.1016\/j.na.2011.05.097","volume":"75","author":"S Dempe","year":"2012","unstructured":"Dempe S, Zemkoho AB (2012) On the Karush\u2013Kuhn\u2013Tucker reformulation of the bilevel optimization problem. Nonlinear Anal Theory Methods Appl 75:1202\u20131218. https:\/\/doi.org\/10.1016\/j.na.2011.05.097","journal-title":"Nonlinear Anal Theory Methods Appl"},{"key":"471_CR14","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10107-011-0508-5","volume":"138","author":"S Dempe","year":"2013","unstructured":"Dempe S, Zemkoho AB (2013) The bilevel programming problem: reformulations, constraint qualifications and optimality conditions. Math Program Ser A 138:447\u2013473. https:\/\/doi.org\/10.1007\/s10107-011-0508-5","journal-title":"Math Program Ser A"},{"key":"471_CR15","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s13675-016-0079-6","volume":"5","author":"M Fampa","year":"2017","unstructured":"Fampa M, Lee J, Melo W (2017) On global optimization with indefinite quadratics. EURO J Comput Optim 5:309\u2013337. https:\/\/doi.org\/10.1007\/s13675-016-0079-6","journal-title":"EURO J Comput Optim"},{"key":"471_CR17","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/s10898-017-0503-3","volume":"68","author":"D Gerard","year":"2017","unstructured":"Gerard D, K\u00f6ppe M, Louveaux Q (2017) Guided dive for the spatial branch-and-bound. J Glob Optim 68:685\u2013711. https:\/\/doi.org\/10.1007\/s10898-017-0503-3","journal-title":"J Glob Optim"},{"key":"471_CR18","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1080\/02522667.1995.10699213","volume":"16","author":"OK Gupta","year":"1995","unstructured":"Gupta OK (1995) Applications of quadratic programming. J Inf Optim Sci 16:177\u2013194. https:\/\/doi.org\/10.1080\/02522667.1995.10699213","journal-title":"J Inf Optim Sci"},{"key":"471_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-2025-2","volume-title":"Handbook of global optimization, nonconvex optimization and its applications","author":"R Horst","year":"1995","unstructured":"Horst R, Pardalos PM (1995) Handbook of global optimization, nonconvex optimization and its applications. Kluwer Academic Publishers, Dordrecht"},{"key":"471_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03199-5","volume-title":"Global optimization: deterministic approaches","author":"R Horst","year":"1996","unstructured":"Horst R, Tuy H (1996) Global optimization: deterministic approaches, 3rd edn. Springer, Berlin","edition":"3"},{"key":"471_CR21","volume-title":"Introduction to global optimization, nonconvex optimization and its applications","author":"R Horst","year":"2001","unstructured":"Horst R, Pardalos PM, Thoai NV (2001) Introduction to global optimization, nonconvex optimization and its applications, 2nd edn. Kluwer Academic Publishers, Dordrecht","edition":"2"},{"key":"471_CR22","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/s12190-012-0576-6","volume":"40","author":"H Jiao","year":"2012","unstructured":"Jiao H, Liu S, Chen Y (2012) Global optimization algorithm for a generalized linear multiplicative programming. J Appl Math Comput 40:551\u2013568","journal-title":"J Appl Math Comput"},{"key":"471_CR23","doi-asserted-by":"publisher","first-page":"114784","DOI":"10.1016\/j.cam.2022.114784","volume":"419","author":"H Jiao","year":"2023","unstructured":"Jiao H, Wang W, Shang Y (2023) Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems. J Comput Appl Math 419:114784","journal-title":"J Comput Appl Math"},{"key":"471_CR24","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1287\/ijoc.2019.0945","volume":"33","author":"T Kleinert","year":"2021","unstructured":"Kleinert T, Schmidt M (2021) Computing feasible points of bilevel problems with a penalty alternating direction method. INFORMS J Comput 33:198\u2013215. https:\/\/doi.org\/10.1287\/ijoc.2019.0945","journal-title":"INFORMS J Comput"},{"key":"471_CR25","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/BF01580893","volume":"56","author":"H Konno","year":"1992","unstructured":"Konno H, Kuno T (1992) Linear multiplicative programming. Math Program 56:51\u201364. https:\/\/doi.org\/10.1007\/BF01580893","journal-title":"Math Program"},{"key":"471_CR26","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0305-0483(77)90020-2","volume":"5","author":"BA McCarl","year":"1977","unstructured":"McCarl BA, Moskowitz H, Furtan H (1977) Quadratic programming applications. Omega 5:43\u201355. https:\/\/doi.org\/10.1016\/0305-0483(77)90020-2","journal-title":"Omega"},{"key":"471_CR27","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"GP McCormick","year":"1976","unstructured":"McCormick GP (1976) Computability of global solutions to factorable nonconvex solutions: Part I: convex underestimating problems. Math Program 10:147\u2013175. https:\/\/doi.org\/10.1007\/BF01580665","journal-title":"Math Program"},{"key":"471_CR28","volume-title":"Methods of the allocation of limited resources","author":"KM Mjelde","year":"1983","unstructured":"Mjelde KM (1983) Methods of the allocation of limited resources. Wiley, New York"},{"key":"471_CR30","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1023\/A:1024700901538","volume":"26","author":"HS Ryoo","year":"2003","unstructured":"Ryoo HS, Sahinidis NV (2003) Global optimization of multiplicative programs. J Glob Optim 26:387\u2013418. https:\/\/doi.org\/10.1023\/A:1024700901538","journal-title":"J Glob Optim"},{"key":"471_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 Glob Optim 78:453\u2013482. https:\/\/doi.org\/10.1007\/s10898-020-00919-7","journal-title":"J Glob Optim"},{"key":"471_CR32","doi-asserted-by":"publisher","first-page":"1421","DOI":"10.1080\/02331934.2020.1812603","volume":"71","author":"P Shen","year":"2022","unstructured":"Shen P, Wang K, Lu T (2022) Global optimization algorithm for solving linear multiplicative programming problems. Optimization 71:1421\u20131441. https:\/\/doi.org\/10.1080\/02331934.2020.1812603","journal-title":"Optimization"},{"key":"471_CR33","series-title":"Springer optimization and its applications","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-31484-6","volume-title":"Convex analysis and global optimization","author":"H Tuy","year":"2016","unstructured":"Tuy H (2016) Convex analysis and global optimization, 2nd edn. Springer optimization and its applications. Springer, Berlin","edition":"2"},{"key":"471_CR34","doi-asserted-by":"publisher","first-page":"2446","DOI":"10.1016\/j.apm.2011.09.002","volume":"36","author":"CF Wang","year":"2012","unstructured":"Wang CF, Liu SY, Shen P (2012) Global minimization of a generalized linear multiplicative programming. Appl Math Model 36:2446\u20132451. https:\/\/doi.org\/10.1016\/j.apm.2011.09.002","journal-title":"Appl Math Model"},{"key":"471_CR35","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10255-015-0456-6","volume":"31","author":"XG Zhou","year":"2015","unstructured":"Zhou XG, Cao BY, Wu K (2015) Global optimization method for linear multiplicative programming. Acta Math Sin 31:325\u2013334. https:\/\/doi.org\/10.1007\/s10255-015-0456-6","journal-title":"Acta Math Sin"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-023-00471-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10287-023-00471-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-023-00471-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,10]],"date-time":"2023-11-10T16:13:05Z","timestamp":1699632785000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10287-023-00471-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,29]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["471"],"URL":"https:\/\/doi.org\/10.1007\/s10287-023-00471-1","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,29]]},"assertion":[{"value":"6 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 August 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 August 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"38"}}