Convex Relaxation of Optimal Power Flow—Part II: Exactness

By Steven H. Low. IEEE Transactions on Control of Network Systems, 2014

575 citations recorded by the source corpus.

This tutorial summarizes recent advances in the convex relaxation of the optimal power flow (OPF) problem, focusing on structural properties rather than algorithms. Part I presents two power flow models, formulates OPF and their relaxations in each model, and proves equivalence relations among them. Part II presents sufficient conditions under which the convex relaxations are exact.

Subfields: Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/b6d4f75fb0dbf48add4b361e91178372b01bd74d

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Electrical and Electronic Engineering

Citations in the corpus

A Survey of Distributed Optimization and Control Algorithms for Electric Power Systems (2017, background): “sense that there is a bijection between their solution sets [16]– [18].”
Enhancing Distribution System Resilience With Mobile Energy Storage and Microgrids (2019, methodology): “In case of meshed networks, the SOC relaxation only holds under the restrictive assumption of phase shifters in strategic locations, [28].”
A Sufficient Condition on Convex Relaxation of AC Optimal Power Flow in Distribution Networks (2017, background): “The details of the convex relaxation for the AC OPF can be found in [17], [18].”
Real-Time Energy Management in Microgrids (2017, methodology): “We therefore relax the constraints and obtain a convex optimization problem for real-time computing (see [27], [28] for a tutorial on convex relaxation of OPF).”
Energy Crowdsourcing and Peer-to-Peer Energy Trading in Blockchain-Enabled Smart Grids (2019, methodology): “To model power flow in distribution networks, we use the branch flow model [35], [36].”