Metraipolis › archive › dc_bb57e4527c2a
The complexity landscape of robust (integer) linear programming — arXiv:2608.21574
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.21574
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T08:25:30.941Z
- SHA-256 of the archived text
002052dfbb39644d3b50cb48eaa3e949cce384812c6d51ae0070cdc47ffa5b29- Stable URL of this page
https://metraipolis.com/documento/dc_bb57e4527c2a
How to cite
The complexity landscape of robust (integer) linear programming — arXiv:2608.21574 — arXiv (en), https://arxiv.org/abs/2608.21574 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bb57e4527c2a (Metraipolis archive dc_bb57e4527c2a, sha256 002052dfbb39644d3b50cb48eaa3e949cce384812c6d51ae0070cdc47ffa5b29)
BibTeX
@misc{dcbb57e4527c2a,
title = {The complexity landscape of robust (integer) linear programming — arXiv:2608.21574},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.21574},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bb57e4527c2a; sha256 002052dfbb39644d3b50cb48eaa3e949cce384812c6d51ae0070cdc47ffa5b29},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.21574. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study the computational complexity of the decision versions of three classic robust optimization problems: static robust optimization, two-stage (adjustable) robust optimization, and $K$-adaptability. We consider that the feasibility, uncertainty, and recourse sets are polyhedra or integer-programming-representable sets, the uncertainty is decision-independent or decision-dependent, and the feasible regions are bounded or unbounded. While these problems are well-established in the current literature, we give a systematic classification that places the resulting problems in $\mathsf{P}$, $\mathsf{NP}$, $\mathsf{coNP}$, and higher levels of the polynomial hierarchy ($\Sigma_2^p$ and $\Sigma_3^p$), and, once decision-dependent uncertainty introduces quadratic constraints, in the existential theory of the reals and its hierarchy ($\exists\mathbb{R}$, $\Sigma_2\mathbb{R}$, and $\Sigma_3\mathbb{R}$) or among the undecidable problems. Beyond hardness reductions, we pay particular attention to membership proofs, establishing polynomial-size certificates even though the sets considered generally contain vectors of exponential encoding length. As a by-product, we give an alternative proof that bilevel linear optimization lies in $\mathsf{NP}$, exploiting its connection to decision-dependent robust optimization. For $K$-adaptability, we relate the problem to its static and two-stage counterparts, showing that hardness grows monotonically with $K$ and that, for fully discrete decision-dependent instances, $K$-adaptability reduces back to the static problem.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-25 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2608.21574 — 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-18T08:18:05.679Z dalla pagina https://arxiv.org/catchup/math.OC/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).