Non-convex scenario optimization
Mathematical Programming · 2025-01 · 209 (1-2) · 557-608
DOI: 10.1007/s10107-024-02074-3 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematical Programming, online erschienen am 08.04.2024. Verfasst von Simone Garatti und 1 weiteren Autor:innen. Die Arbeit wurde bisher 20-mal zitiert (Crossref) und nennt 55 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: NextGenerationEU program within the PNRR-PE-AI scheme, Ministero dell’Università e della Ricerca.
Abstract (Originalsprache)
Scenario optimization is an approach to data-driven decision-making that has been introduced some fifteen years ago and has ever since then grown fast. Its most remarkable feature is that it blends the heuristic nature of data-driven methods with a rigorous theory that allows one to gain factual, reliable, insight in the solution. The usability of the scenario theory, however, has been restrained thus far by the obstacle that most results are standing on the assumption of convexity . With this paper, we aim to free the theory from this limitation. Specifically, we focus on the body of results that are known under the name of “wait-and-judge” and show that its fundamental achievements maintain their validity in a non-convex setup. While optimization is a major center of attention, this paper travels beyond it and into data-driven decision making . Adopting such a broad framework opens the door to building a new theory of truly vast applicability.
Förderung
- NextGenerationEU program within the PNRR-PE-AI scheme
- Ministero dell’Università e della Ricerca
Zitieren
APA
Garatti, S., & Campi, M. C. (2025). Non-convex scenario optimization. Mathematical Programming, 209(1-2), 557-608. https://doi.org/10.1007/s10107-024-02074-3
Vancouver
Garatti S, Campi MC. Non-convex scenario optimization. Mathematical Programming. 2025;209(1-2):557-608. doi:10.1007/s10107-024-02074-3
BibTeX
@article{Garatti2025,
author = {Garatti, Simone and Campi, Marco C.},
title = {Non-convex scenario optimization},
journal = {Mathematical Programming},
year = {2025},
volume = {209},
number = {1-2},
pages = {557--608},
doi = {10.1007/s10107-024-02074-3}
}
EUVIMED