Solution Methods for Infinite-Dimensional Generalized Disjunctive Programming
Abstract
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 InfiniteDisjunctiveProgramming.jl. 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.
Related
- Generalized Disjunctive Programming with Derivative-Free Configuration Search
- When Can an Infinite-Stream Evaluation Support Dynamic Programming? Compatibility, Recursive Compression, and Generalized Summation
- Generalized Semi-Infinite Programming for Robust Optimal Control with Decision-Dependent Uncertainty
- More on Disjunctive Convex Hulls of Generalized Cross Polytopes
- Non-convex integer programming: a deterministic solution method of the large block sale problem
BibTeX
@misc{nguyen2026solution,
title = {{Solution Methods for Infinite-Dimensional Generalized Disjunctive Programming}},
author = {Daniel Nguyen and Joshua L. Pulsipher},
howpublished = {arXiv},
year = {2026},
month = aug,
doi = {10.48550/arxiv.2608.27707},
eprint = {2608.27707},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2608.27707},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Solution Methods for Infinite-Dimensional Generalized Disjunctive Programming
AU - Daniel Nguyen
AU - Joshua L. Pulsipher
PY - 2026
DA - 2026/08/27
PB - arXiv
DO - 10.48550/arxiv.2608.27707
UR - https://arxiv.org/abs/2608.27707
AB - 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 InfiniteDisjunctiveProgramming.jl. 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.
ER -