{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T10:15:56Z","timestamp":1783160156514,"version":"3.54.6"},"reference-count":39,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12571319"],"award-info":[{"award-number":["12571319"]}],"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":["12071133"],"award-info":[{"award-number":["12071133"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational and Applied Mathematics"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1016\/j.cam.2026.117845","type":"journal-article","created":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T00:02:19Z","timestamp":1780012939000},"page":"117845","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Globally minimizing a class of linear multiplicative programming under the flexible branching scheme"],"prefix":"10.1016","volume":"488","author":[{"given":"Yaping","family":"Deng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peiping","family":"Shen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.cam.2026.117845_bib0001","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/j.ejor.2010.04.030","article-title":"A coordinating contract for transshipment in a two-company supply chain","volume":"207","author":"Hezarkhani","year":"2010","journal-title":"Eur. J. Oper. Res."},{"issue":"8","key":"10.1016\/j.cam.2026.117845_bib0002","doi-asserted-by":"crossref","first-page":"1482","DOI":"10.1287\/mnsc.1080.0880","article-title":"A bargaining framework in supply chains: the assembly problem","volume":"54","author":"Nagarajan","year":"2008","journal-title":"Manage. Sci."},{"issue":"3","key":"10.1016\/j.cam.2026.117845_bib0003","doi-asserted-by":"crossref","first-page":"1453","DOI":"10.1287\/ijoc.2021.1097","article-title":"A criterion space branch-and-cut algorithm for mixed integer bilinear maximum multiplicative programs","volume":"34","author":"Mahmoodian","year":"2022","journal-title":"Inf. J. Comput."},{"key":"10.1016\/j.cam.2026.117845_bib0004","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.cor.2017.07.015","article-title":"A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints","volume":"89","author":"Charkhgard","year":"2017","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"10.1016\/j.cam.2026.117845_bib0005","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0167-6377(93)90052-I","article-title":"Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set","volume":"13","author":"Konno","year":"1993","journal-title":"Oper. Res. Lett."},{"issue":"8-9","key":"10.1016\/j.cam.2026.117845_bib0006","doi-asserted-by":"crossref","first-page":"1405","DOI":"10.1016\/S0165-1889(97)00032-8","article-title":"Solving long-term financial planning problems via global optimization","volume":"21","author":"Maranas","year":"1997","journal-title":"J. Econ. Dyn. Control"},{"key":"10.1016\/j.cam.2026.117845_bib0007","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/j.cie.2019.03.042","article-title":"Optimal strategy for a green supply chain considering shipping policy and default risk","volume":"131","author":"Qu","year":"2019","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"10.1016\/j.cam.2026.117845_bib0008","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1080\/03052159508941259","article-title":"Global optimization algorithms for chip layout and compaction","volume":"25","author":"Dorneich","year":"1995","journal-title":"Eng. Optim."},{"key":"10.1016\/j.cam.2026.117845_bib0009","series-title":"Generalized Convexity and Optimization: Theory and Applications","author":"Cambini","year":"2009"},{"issue":"10","key":"10.1016\/j.cam.2026.117845_bib0010","doi-asserted-by":"crossref","first-page":"1449","DOI":"10.1080\/02331934.2013.852548","article-title":"On the minimization of a class of generalized linear functions on a flow polytope","volume":"63","author":"Cambini","year":"2014","journal-title":"Optimization"},{"key":"10.1016\/j.cam.2026.117845_bib0011","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1023\/A:1024700901538","article-title":"Global optimization of multiplicative programs","volume":"26","author":"Hong","year":"2003","journal-title":"J. Glob. Optim."},{"issue":"2","key":"10.1016\/j.cam.2026.117845_bib0012","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1287\/opre.43.2.264","article-title":"Robust optimization of large-scale systems","volume":"43","author":"Mulvey","year":"1995","journal-title":"Oper. Res."},{"issue":"2","key":"10.1016\/j.cam.2026.117845_bib0013","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF00121658","article-title":"NP-hardness of linear multiplicative programming and related problems","volume":"9","author":"Matsui","year":"1996","journal-title":"J. Glob. Optim."},{"key":"10.1016\/j.cam.2026.117845_bib0014","doi-asserted-by":"crossref","first-page":"2573","DOI":"10.1016\/j.cor.2008.11.002","article-title":"A nonisolated optimal solution of general linear multiplicative programming problems","volume":"6","author":"Chen","year":"2009","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cam.2026.117845_bib0015","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1016\/j.cam.2015.11.009","article-title":"An efficient algorithm for globally solving generalized linear multiplicative programming","volume":"296","author":"Liu","year":"2016","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/j.cam.2026.117845_bib0016","doi-asserted-by":"crossref","first-page":"1412","DOI":"10.1016\/j.amc.2004.08.028","article-title":"Level set algorithm for solving convex multiplicative programming problems","volume":"176","author":"Youness","year":"2005","journal-title":"Appl. Math. Comput."},{"issue":"4","key":"10.1016\/j.cam.2026.117845_bib0017","doi-asserted-by":"crossref","first-page":"1206","DOI":"10.1016\/j.amc.2010.02.012","article-title":"A new global optimization approach for convex multiplicative programming","volume":"216","author":"Gao","year":"2010","journal-title":"Appl. Math. Comput."},{"issue":"3","key":"10.1016\/j.cam.2026.117845_bib0018","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF01096774","article-title":"An outer approximation method for minimizing the product of several convex functions on a convex set","volume":"3","author":"Kuno","year":"1993","journal-title":"J. Glob. Optim."},{"issue":"1","key":"10.1016\/j.cam.2026.117845_bib0019","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s10898-009-9460-9","article-title":"An outcome space approach for generalized convex multiplicative programs","volume":"47","author":"Oliveira","year":"2010","journal-title":"J. Glob. Optim."},{"issue":"2","key":"10.1016\/j.cam.2026.117845_bib0020","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/BF02192573","article-title":"Finite algorithm for generalized multiplicative programming","volume":"87","author":"Schaible","year":"1995","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/j.cam.2026.117845_bib0021","first-page":"301","article-title":"Outcome-space cutting-plane algorithm for linear multiplicative programming","volume":"104","author":"Benson","year":"2000","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/j.cam.2026.117845_bib0022","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1023\/A:1008308913266","article-title":"Heuristic methods for linear multiplicative programming","volume":"4","author":"Liu","year":"1999","journal-title":"J. Glob. Optim."},{"issue":"3","key":"10.1016\/j.cam.2026.117845_bib0023","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1023\/A:1008314922240","article-title":"A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems","volume":"18","author":"Konno","year":"2000","journal-title":"J. Glob. Optim."},{"key":"10.1016\/j.cam.2026.117845_bib0024","doi-asserted-by":"crossref","DOI":"10.1016\/j.cam.2021.114080","article-title":"A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems","volume":"407","author":"Wang","year":"2022","journal-title":"J. Comput. Appl. Math."},{"issue":"5","key":"10.1016\/j.cam.2026.117845_bib0025","first-page":"1","article-title":"Global optimization for generalized linear multiplicative programming using convex relaxation","volume":"2018","author":"Zhao","year":"2018","journal-title":"Math. Probl. Eng."},{"key":"10.1016\/j.cam.2026.117845_bib0026","first-page":"675","article-title":"Outcome-space branch and bound algorithm for solving linear multiplicative programming","volume":"3801","author":"Gao","year":"2005","journal-title":"Comput. Intell. Secur."},{"issue":"3","key":"10.1016\/j.cam.2026.117845_bib0027","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3390\/math8030315","article-title":"Output-space branch-and-bound reduction algorithm for a class of linear multiplicative programs","volume":"8","author":"Zhang","year":"2020","journal-title":"Mathematics"},{"issue":"3","key":"10.1016\/j.cam.2026.117845_bib0028","first-page":"1","article-title":"Image space accelerating algorithm for solving a class of multiplicative programming problems","volume":"2022","author":"Zhou","year":"2022","journal-title":"Math. Probl. Eng."},{"issue":"3","key":"10.1016\/j.cam.2026.117845_bib0029","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1080\/02331934.2016.1269765","article-title":"A practicable branch-and-bound algorithm for globally solving multiplicative programming","volume":"66","author":"Wang","year":"2017","journal-title":"Optimization"},{"key":"10.1016\/j.cam.2026.117845_bib0030","first-page":"1","article-title":"Global algorithm for generalized affine multiplicative programming problem","volume":"99","author":"Yin","year":"2019","journal-title":"IEEE Access"},{"key":"10.1016\/j.cam.2026.117845_bib0031","doi-asserted-by":"crossref","DOI":"10.1016\/j.chaos.2023.113924","article-title":"Output-space branch-and-bound reduction algorithm for generalized linear fractional-multiplicative programming problem","volume":"175","author":"Gao","year":"2023","journal-title":"Chaos Solit. Fractals"},{"key":"10.1016\/j.cam.2026.117845_bib0032","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1007\/s11075-022-01330-x","article-title":"Global algorithm for a class of multiplicative programs using piecewise linear approximation technique","volume":"92","author":"Hou","year":"2023","journal-title":"Numer. Algor."},{"key":"10.1016\/j.cam.2026.117845_bib0033","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1007\/s10287-023-00471-1","article-title":"Solving linear multiplicative programs via branch-and-bound: a computational experience","volume":"20","author":"Cambini","year":"2023","journal-title":"Comput. Manage. Sci."},{"issue":"3","key":"10.1016\/j.cam.2026.117845_bib0034","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s10898-020-00919-7","article-title":"Outer space branch and bound algorithm for solving linear multiplicative programming problems","volume":"78","author":"Shen","year":"2020","journal-title":"J. Glob. Optim."},{"key":"10.1016\/j.cam.2026.117845_bib0035","doi-asserted-by":"crossref","DOI":"10.1016\/j.cam.2023.115100","article-title":"An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming","volume":"426","author":"Shen","year":"2023","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/j.cam.2026.117845_bib0036","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10898-023-01277-w","article-title":"Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound","volume":"86","author":"Shen","year":"2023","journal-title":"J. Glob. Optim."},{"key":"10.1016\/j.cam.2026.117845_bib0037","doi-asserted-by":"crossref","first-page":"997","DOI":"10.1007\/s10957-024-02461-y","article-title":"Output-space outer approximation branch-and-bound algorithm for a class of linear multiplicative programs","volume":"202","author":"Zhang","year":"2024","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/j.cam.2026.117845_bib0038","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/s10898-023-01358-w","article-title":"A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems","volume":"89","author":"Jiao","year":"2024","journal-title":"J. Glob. Optim."},{"key":"10.1016\/j.cam.2026.117845_bib0039","doi-asserted-by":"crossref","DOI":"10.1016\/j.cam.2024.116070","article-title":"An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications","volume":"451","author":"Hou","year":"2024","journal-title":"J. Comput. Appl. Math."}],"container-title":["Journal of Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042726004875?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042726004875?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T09:20:57Z","timestamp":1783156857000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377042726004875"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":39,"alternative-id":["S0377042726004875"],"URL":"https:\/\/doi.org\/10.1016\/j.cam.2026.117845","relation":{},"ISSN":["0377-0427"],"issn-type":[{"value":"0377-0427","type":"print"}],"subject":[],"published":{"date-parts":[[2026,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Globally minimizing a class of linear multiplicative programming under the flexible branching scheme","name":"articletitle","label":"Article Title"},{"value":"Journal of Computational and Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cam.2026.117845","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"117845"}}