{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T12:31:13Z","timestamp":1753273873240,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,3,22]],"date-time":"2024-03-22T00:00:00Z","timestamp":1711065600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,3,22]],"date-time":"2024-03-22T00:00:00Z","timestamp":1711065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100006360","name":"Bundesministerium f\u00fcr Wirtschaft und Energie","doi-asserted-by":"publisher","award":["03ET4053B"],"award-info":[{"award-number":["03ET4053B"]}],"id":[{"id":"10.13039\/501100006360","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004837","name":"Spanish Ministry of Science and Innovation","doi-asserted-by":"crossref","award":["PID2021-123278OB-I00"],"award-info":[{"award-number":["PID2021-123278OB-I00"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2025,2]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>We present a novel relaxation for general nonconvex sparse MINLP problems, called overlapping convex hull relaxation (CHR). It is defined by replacing all nonlinear constraint sets by their convex hulls. If the convex hulls are disjunctive, e.g. if the MINLP is block-separable, the CHR is equivalent to the convex hull relaxation obtained by (standard) column generation (CG). The CHR can be used for computing an initial lower bound in the root node of a branch-and-bound algorithm, or for computing a start vector for a local-search-based MINLP heuristic. We describe a dynamic block and column generation (DBCG) MINLP algorithm to generate the CHR by dynamically adding aggregated blocks. The idea of adding aggregated blocks in the CHR is similar to the well-known cutting plane approach. Numerical experiments on nonconvex MINLP instances show that the duality gap can be significantly reduced with the results of CHRs. DBCG is implemented as part of the CG-MINLP framework Decogo, see <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"https:\/\/decogo.readthedocs.io\/en\/latest\/index.html\" ext-link-type=\"uri\">https:\/\/decogo.readthedocs.io\/en\/latest\/index.html<\/jats:ext-link>.<\/jats:p>","DOI":"10.1007\/s10898-024-01376-2","type":"journal-article","created":{"date-parts":[[2024,3,22]],"date-time":"2024-03-22T10:02:25Z","timestamp":1711101745000},"page":"415-436","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the use of overlapping convex hull relaxations to solve nonconvex MINLPs"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6589-957X","authenticated-orcid":false,"given":"Ouyang","family":"Wu","sequence":"first","affiliation":[]},{"given":"Pavlo","family":"Muts","sequence":"additional","affiliation":[]},{"given":"Ivo","family":"Nowak","sequence":"additional","affiliation":[]},{"given":"Eligius M. T.","family":"Hendrix","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,22]]},"reference":[{"key":"1376_CR1","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"GB Dantzig","year":"1960","unstructured":"Dantzig, G.B., Wolfe, P.: Decomposition principle for linear programs. Oper. Res. 8, 101\u2013111 (1960)","journal-title":"Oper. Res."},{"issue":"9","key":"1376_CR2","first-page":"1459","volume":"19","author":"RT Rockafellar","year":"2018","unstructured":"Rockafellar, R.T.: Problem decomposition in block-separable convex optimization: ideas old and new. J. Nonlinear Convex Anal. 19(9), 1459\u20131474 (2018)","journal-title":"J. Nonlinear Convex Anal."},{"key":"1376_CR3","first-page":"317","volume":"24","author":"P Muts","year":"2023","unstructured":"Muts, P., Bruche, S., Nowak, I., Wu, O., Hendrix, E.M., Tsatsaronis, G.: A column generation algorithm for solving energy system planning problems. Optim. Eng. 24, 317\u2013351 (2023)","journal-title":"Optim. Eng."},{"key":"1376_CR4","unstructured":"Vigerske, S.: MINLPLib. http:\/\/minlplib.org\/index.html (2018)"},{"issue":"1","key":"1376_CR5","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10898-020-00888-x","volume":"77","author":"P Muts","year":"2020","unstructured":"Muts, P., Nowak, I., Hendrix, E.M.T.: The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming. J. Global Optim. 77(1), 75\u201396 (2020)","journal-title":"J. Global Optim."},{"key":"1376_CR6","doi-asserted-by":"publisher","unstructured":"Muts,P., Nowak,I., Hendrix,E.M.T.: A resource constraint approach for one global constraint MINLP. In: Computational Science and Its Applications - ICCSA 2020, pp. 590\u2013605. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-58808-3_43","DOI":"10.1007\/978-3-030-58808-3_43"},{"issue":"3","key":"1376_CR7","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1007\/s11081-020-09576-x","volume":"22","author":"P Muts","year":"2021","unstructured":"Muts, P., Nowak, I., Hendrix, E.M.: On decomposition and multiobjective-based column and disjunctive cut generation for MINLP. Optim. Eng. 22(3), 1389\u20131418 (2021)","journal-title":"Optim. Eng."},{"key":"1376_CR8","unstructured":"Bodur, M., Ahmed, S., Boland, N., Nemhauser, G.L.: Decomposition of loosely coupled integer programs: a multiobjective perspective. http:\/\/www.optimization-online.org\/DB_FILE\/2016\/08\/5599.pdf (2016)"},{"key":"1376_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/3-7643-7374-1","volume-title":"Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming","author":"I Nowak","year":"2005","unstructured":"Nowak, I.: Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming. Birkh\u00e4user, Basel (2005)"},{"issue":"3","key":"1376_CR10","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s12532-011-0026-8","volume":"3","author":"WE Hart","year":"2011","unstructured":"Hart, W.E., Watson, J.-P., Woodruff, D.L.: Pyomo: modeling and solving mathematical programs in python. Math. Program. Comput. 3(3), 219\u2013260 (2011)","journal-title":"Math. Program. Comput."},{"key":"1376_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-68928-5","volume-title":"Pyomo-optimization modeling in python","author":"ML Bynum","year":"2021","unstructured":"Bynum, M.L., Hackebeil, G.A., Hart, W.E., Laird, C.D., Nicholson, B.L., Siirola, J.D., Watson, J.-P., Woodruff, D.L.: Pyomo-optimization modeling in python, vol. 67, 3rd edn. Springer, Berlin (2021)","edition":"3"},{"key":"1376_CR12","unstructured":"Muts,P., Wu,O., Nowak,I.: Decogo - decomposed-based approximation framework for global optimization. https:\/\/github.com\/ouyang-w-19\/decogo (2020)"},{"key":"1376_CR13","unstructured":"Gamrath, G., Anderson, D., Bestuzheva, K., Chen, W.-K., Eifler, L., Gasse, M., Gemander, P., Gleixner, A., Gottwald, L., Halbig, K., Hendel, G., Hojny, C., Koch, T., Le Bodic, P., Maher, S.J., Matter, F., Miltenberger, M., M\u00fchmer, E., M\u00fcller, B., Pfetsch, M.E., Schl\u00f6sser, F., Serrano, F., Shinano, Y., Tawfik, C., Vigerske, S., Wegscheider, F., Weninger, D., Witzig, J.: The SCIP Optimization Suite 7.0. Technical report, Optimization Online, March 2020. http:\/\/www.optimization-online.org\/DB_HTML\/2020\/03\/7705.html"},{"key":"1376_CR14","unstructured":"Gurobi Optimization, LLC. Gurobi Optimizer Reference Manual (2021). https:\/\/www.gurobi.com"},{"key":"1376_CR15","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.compchemeng.2016.09.008","volume":"95","author":"S Goderbauer","year":"2016","unstructured":"Goderbauer, S., Bahl, B., Voll, P., L\u00fcbbecke, M., Bardow, A., Koster, A.: An adaptive discretization MINLP algorithm for optimal synthesis of decentralized energy supply systems. Comput. Chem. Eng. 95, 38\u201348 (2016)","journal-title":"Comput. Chem. Eng."},{"key":"1376_CR16","unstructured":"Bahl, B., Goderbauer, S., Arnold, F., Voll, P., L\u00fcbbecke, M., Bardow, A., Koster, A.M.: DESSLib\u2014Benchmark Instances for Optimization of Decentralized Energy Supply Systems. Technical report, Technische Universit\u00e4t Aachen, 2016. URL http:\/\/www.math2.rwth-aachen.de\/DESSLib\/"},{"key":"1376_CR17","unstructured":"Sahinidis,N.V.: BARON 21.1.14: Global Optimization of Mixed-Integer Nonlinear Programs, User\u2019s Manual, http:\/\/www.minlp.com\/ (2020)"},{"key":"1376_CR18","first-page":"543","volume":"269","author":"YE Nesterov","year":"1983","unstructured":"Nesterov, Y.E.: A method for solving the convex programming problem with convergence rate O($$1\/k^2$$). Dokl. Akad. Nauk SSSR 269, 543\u2013547 (1983)","journal-title":"Dokl. Akad. Nauk SSSR"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-024-01376-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-024-01376-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-024-01376-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,15]],"date-time":"2025-02-15T05:47:49Z","timestamp":1739598469000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-024-01376-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,22]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["1376"],"URL":"https:\/\/doi.org\/10.1007\/s10898-024-01376-2","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2024,3,22]]},"assertion":[{"value":"25 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}