AC Optimal Power Flow: a Conic Programming relaxation and an iterative MILP scheme for Global Optimization

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 Mix...

Celý popis

Podrobná bibliografie

Hlavní autor:	Oustry, Antoine
Médium:	Artigo
Jazyk:	Inglês
Vydáno:	Université de Montpellier 2022-11-01
Edice:	Open Journal of Mathematical Optimization
Témata:	ACOPF Global Optimization Semidefinite Programming Mixed-Integer Linear Programming
On-line přístup:	https://ojmo.centre-mersenne.org/articles/10.5802/ojmo.17/
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!