Exact Convex Relaxation of Optimal Power Flow in Radial Networks

Abstract

The optimal power flow (OPF) problem determines power generation/demand that minimize a certain objective such as generation cost or power loss. It is nonconvex. We prove that, for radial networks, after shrinking its feasible set slightly, the global optimum of OPF can be recovered via a second-order cone programming (SOCP) relaxation under a condition that can be checked a priori. The condition holds for the IEEE 13-, 34-, 37-, 123-bus networks and two real-world networks, and has a physical interpretation.

Stochastic reactive power management in microgrids with renewables

“…The latter is a residential feeder that was modified according to [40]. Regarding renewable generation, solar panels were located on buses No.…”

A Sufficient Condition on Convex Relaxation of AC Optimal Power Flow in Distribution Networks

“…For radial networks, [11]- [13] have proposed several sufficient conditions for the convex relaxation to be exact. In [11], [12], it is proposed that if just one of any two connected nodes has a lower active power bound and no node has a lower reactive power bound, the convex relaxation is exact.…”

OpenBuildNet framework for distributed co-simulation of smart energy systems

“…The specific grid model for the study is taken from [18] and describes a mid-voltage distribution grid with 47 buses. The implementation requires co-simulation of 42 nodes, summarized in the following Fig.…”