Metraipolis › archive › dc_dbaf7b78ba4d

On the Relevance of Incorporating Decision Dependence in Distributional Ambiguity — arXiv:2609.33926

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.33926
License (as archived)
CC0-1.0
Archived
2026-10-07T23:06:39.652Z
SHA-256 of the archived text
caccd5177fe84ca9deb79deeae9b5bb1f693cff424042d08519705f1df2d0f26
Stable URL of this page
https://metraipolis.com/documento/dc_dbaf7b78ba4d

How to cite

On the Relevance of Incorporating Decision Dependence in Distributional Ambiguity — arXiv:2609.33926 — arXiv (en), https://arxiv.org/abs/2609.33926 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_dbaf7b78ba4d (Metraipolis archive dc_dbaf7b78ba4d, sha256 caccd5177fe84ca9deb79deeae9b5bb1f693cff424042d08519705f1df2d0f26)
BibTeX
@misc{dcdbaf7b78ba4d,
  title = {On the Relevance of Incorporating Decision Dependence in Distributional Ambiguity — arXiv:2609.33926},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.33926},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_dbaf7b78ba4d; sha256 caccd5177fe84ca9deb79deeae9b5bb1f693cff424042d08519705f1df2d0f26},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.33926. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Most existing studies on distributionally robust optimization (DRO) with a decision-dependent ambiguity set focus on the computational and theoretical challenges posed by this class of problems. In this paper, we adopt a combined modeling and computational perspective to understand the trade-offs between modeling fidelity, solution quality, and computational effort, particularly in comparison with DRO models using decision-independent ambiguity sets. Motivated by representative applications in joint pricing-stocking newsvendor problems with price-dependent demand and facility location problems with location-dependent demand, we consider a two-stage stochastic mixed-integer program with (non)convex continuous recourse. Assuming a finite sample space, we model the decision-dependent distributional ambiguity with a polyhedral ambiguity set and reformulate the problem as a nonconvex mixed-integer nonlinear program. To efficiently solve the reformulations, we propose decomposition-based cutting-plane algorithms. Our experiments on benchmark instances indicate that a decision-dependent ambiguity set substantially reduces the postdecision disappointment for the newsvendor and out-of-sample cost for the facility location problems, up to 65% and 7% on average, respectively; thereby mitigating the optimizer's curse relative to a decision-independent DRO. However, this improvement is achieved at the expense of increased computational effort, with the absolute runtime ratio falling between 2 and 25 for medium- to large-sized newsvendor instances and between 2 and 12 for facility location instances.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-29 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.33926 — 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-07T22:42:39.235Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).