AC Optimal Power Flow: a Conic Programming relaxation and an iterative MILP scheme for Global Optimization
Open Journal of Mathematical Optimization · 2022
DOI: 10.5802/ojmo.17 ↗Kurz gefasst
Fachartikel in der Zeitschrift Open Journal of Mathematical Optimization, 2022. Verfasst von Antoine Oustry. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 33 Literaturangaben.
Abstract (Originalsprache)
We address the issue of computing a global minimizer of the AC Optimal Power Flow problem. We introduce valid inequalities to strengthen the Semidefinite Programming relaxation, yielding a novel Conic Programming relaxation. Leveraging these Conic Programming constraints, we dynamically generate Mixed-Integer Linear Programming (MILP) relaxations, whose solutions asymptotically converge to global minimizers of the AC Optimal Power Flow problem. We apply this iterative MILP scheme on the IEEE PES PGLib [2] benchmark and compare the results with two recent Global Optimization approaches.
Zitieren
APA
Oustry, A. (2022). AC Optimal Power Flow: a Conic Programming relaxation and an iterative MILP scheme for Global Optimization. Open Journal of Mathematical Optimization. https://doi.org/10.5802/ojmo.17
Vancouver
Oustry A. AC Optimal Power Flow: a Conic Programming relaxation and an iterative MILP scheme for Global Optimization. Open Journal of Mathematical Optimization. 2022. doi:10.5802/ojmo.17
BibTeX
@article{Oustry2022,
author = {Oustry, Antoine},
title = {AC Optimal Power Flow: a Conic Programming relaxation and an iterative MILP scheme for Global Optimization},
journal = {Open Journal of Mathematical Optimization},
year = {2022},
doi = {10.5802/ojmo.17}
}
EUVIMED