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

詳細記述

書誌詳細
出版年:Open Journal of Mathematical Optimization
第一著者: Oustry, Antoine
フォーマット: 論文
言語:英語
出版事項: Université de Montpellier 2022-11-01
主題:
オンライン・アクセス:https://ojmo.centre-mersenne.org/articles/10.5802/ojmo.17/
_version_ 1849475186016911360
author Oustry, Antoine
author_facet Oustry, Antoine
author_sort Oustry, Antoine
collection DOAJ
container_title Open Journal of Mathematical Optimization
description 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.
format Article
id doaj-art-dd4e88b76ab84e73af072ca7ba0fdb0f
institution Directory of Open Access Journals
issn 2777-5860
language English
publishDate 2022-11-01
publisher Université de Montpellier
record_format Article
spelling doaj-art-dd4e88b76ab84e73af072ca7ba0fdb0f2025-08-20T03:15:44ZengUniversité de MontpellierOpen Journal of Mathematical Optimization2777-58602022-11-01311910.5802/ojmo.1710.5802/ojmo.17AC Optimal Power Flow: a Conic Programming relaxation and an iterative MILP scheme for Global OptimizationOustry, Antoine0Ecole des Ponts, Marne-La-Vallée, France; LIX CNRS, Ecole polytechnique, Institut Polytechnique de Paris, Palaiseau, FranceWe 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.https://ojmo.centre-mersenne.org/articles/10.5802/ojmo.17/ACOPFGlobal OptimizationSemidefinite ProgrammingMixed-Integer Linear Programming
spellingShingle Oustry, Antoine
AC Optimal Power Flow: a Conic Programming relaxation and an iterative MILP scheme for Global Optimization
ACOPF
Global Optimization
Semidefinite Programming
Mixed-Integer Linear Programming
title AC Optimal Power Flow: a Conic Programming relaxation and an iterative MILP scheme for Global Optimization
title_full AC Optimal Power Flow: a Conic Programming relaxation and an iterative MILP scheme for Global Optimization
title_fullStr AC Optimal Power Flow: a Conic Programming relaxation and an iterative MILP scheme for Global Optimization
title_full_unstemmed AC Optimal Power Flow: a Conic Programming relaxation and an iterative MILP scheme for Global Optimization
title_short AC Optimal Power Flow: a Conic Programming relaxation and an iterative MILP scheme for Global Optimization
title_sort ac optimal power flow a conic programming relaxation and an iterative milp scheme for global optimization
topic ACOPF
Global Optimization
Semidefinite Programming
Mixed-Integer Linear Programming
url https://ojmo.centre-mersenne.org/articles/10.5802/ojmo.17/
work_keys_str_mv AT oustryantoine acoptimalpowerflowaconicprogrammingrelaxationandaniterativemilpschemeforglobaloptimization