EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

On the algorithmic solution of optimization problems subject to probabilistic/robust (probust) constraints

Holger Berthold, Holger Heitsch, René Henrion, Jan Schwientek

Mathematical Methods of Operations Research · 2022-08 · 96 (1) · 1-37

DOI: 10.1007/s00186-021-00764-8 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Mathematical Methods of Operations Research, online erschienen am 14.12.2021. Verfasst von Holger Berthold und 3 weiteren Autor:innen. Die Arbeit wurde bisher 13-mal zitiert (Crossref) und nennt 45 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Weierstraß-Institut für Angewandte Analysis und Stochastik, Leibniz-Institut im Forschungsverbund Berlin e.V..

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We present an adaptive grid refinement algorithm to solve probabilistic optimization problems with infinitely many random constraints. Using a bilevel approach, we iteratively aggregate inequalities that provide most information not in a geometric but in a probabilistic sense. This conceptual idea, for which a convergence proof is provided, is then adapted to an implementable algorithm. The efficiency of our approach when compared to naive methods based on uniform grid refinement is illustrated for a numerical test example as well as for a water reservoir problem with joint probabilistic filling level constraints.

Förderung

  • Weierstraß-Institut für Angewandte Analysis und Stochastik, Leibniz-Institut im Forschungsverbund Berlin e.V.

Zitieren

APA

Berthold, H., Heitsch, H., Henrion, R., & Schwientek, J. (2022). On the algorithmic solution of optimization problems subject to probabilistic/robust (probust) constraints. Mathematical Methods of Operations Research, 96(1), 1-37. https://doi.org/10.1007/s00186-021-00764-8

Vancouver

Berthold H, Heitsch H, Henrion R, Schwientek J. On the algorithmic solution of optimization problems subject to probabilistic/robust (probust) constraints. Mathematical Methods of Operations Research. 2022;96(1):1-37. doi:10.1007/s00186-021-00764-8

BibTeX
@article{Berthold2022,
  author = {Berthold, Holger and Heitsch, Holger and Henrion, René and Schwientek, Jan},
  title = {On the algorithmic solution of optimization problems subject to probabilistic/robust (probust) constraints},
  journal = {Mathematical Methods of Operations Research},
  year = {2022},
  volume = {96},
  number = {1},
  pages = {1--37},
  doi = {10.1007/s00186-021-00764-8}
}
Kostenlos starten →