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

Abstract

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.

Keywords

• ACOPF
• Global Optimization
• Semidefinite Programming
• Mixed-Integer Linear Programming