Metraipolis › archive › dc_35561ec19f66
Solution Methods for Infinite-Dimensional Generalized Disjunctive Programming — arXiv:2608.27707
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.27707
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T11:17:49.545Z
- SHA-256 of the archived text
c103a63e55d9100467991fdc45dd2300a1b2752c68756dfbc422d4a22a0bc197- Stable URL of this page
https://metraipolis.com/documento/dc_35561ec19f66
How to cite
Solution Methods for Infinite-Dimensional Generalized Disjunctive Programming — arXiv:2608.27707 — arXiv (en), https://arxiv.org/abs/2608.27707 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_35561ec19f66 (Metraipolis archive dc_35561ec19f66, sha256 c103a63e55d9100467991fdc45dd2300a1b2752c68756dfbc422d4a22a0bc197)
BibTeX
@misc{dc35561ec19f66,
title = {Solution Methods for Infinite-Dimensional Generalized Disjunctive Programming — arXiv:2608.27707},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.27707},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_35561ec19f66; sha256 c103a63e55d9100467991fdc45dd2300a1b2752c68756dfbc422d4a22a0bc197},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.27707. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Generalized disjunctive programming (GDP) expresses mixed discrete-continuous decisions through Boolean indicators and disjunctions, and can be systematically solved via a library of methods proposed in the literature. The recent InfiniteGDP abstraction lifts this modeling layer to continuous domains such as time, space, and uncertainty, but only the big-M and hull reformulations, the two endpoints of the relaxation spectrum, have been generalized to the infinite setting. This work closes this gap by generalizing four other GDP solution methods to infinite-dimensional optimization: the multiple big-M reformulation, P-split reformulation, cutting plane reformulation, and the logic-based outer approximation algorithm. It further proposes MBM-GP, a novel Gaussian-process variant of multiple big-M that learns the big-M function over the infinite domain from a small subset of the subproblem solves. Moreover, these approaches are implemented in the Julia package this http URL . The methods are benchmarked on case studies arising in dynamic and stochastic optimization. The results demonstrate how the generalized solution methods can outperform big-M and hull, with MBM-GP retaining the tightness of multiple big-M at a fraction of its reformulation cost. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-31 in math.OC). Categorie arXiv: Optimization and Control (math.OC) ; Systems and Control (eess.SY). Pagina del lavoro: https://arxiv.org/abs/2608.27707 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-17T10:58:16.476Z dalla pagina https://arxiv.org/catchup/math.OC/2026-08-31?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).