Convex Relaxation for Optimal Power Flow Problem: Mesh Networks

This paper is concerned with the optimal power flow (OPF) problem. We have recently shown that a convex relaxation based on semidefinite programming (SDP) is able to find a global solution of OPF for IEEE benchmark systems, and moreover this technique is guaranteed to work over acyclic (distribution) networks. The present work studies the potential of the SDP relaxation for OPF over mesh (transmission) networks. First, we consider a simple class of cyclic systems, namely weakly-cyclic networks with cycles of size 3. We show that the success of the SDP relaxation depends on how the line capacities are modeled mathematically. More precisely, the SDP relaxation is proven to succeed if the capacity of each line is modeled in terms of bus voltage difference, as opposed to line active power, apparent power or angle difference. This result elucidates the role of the problem formulation. Our second contribution is to relate the rank of theminimum-rank solution of the SDP relaxation to the network topology. The goal is to understand how the computational complexity of OPF is related to the underlying topology of the power network. To this end, an upper bound is derived on the rank of the SDP solution, which is expected to be small in practice. A penalization method is then applied to the SDP relaxation to enforce the rank of its solution to become 1, leading to a near-optimal solution for OPF with a guaranteed optimality degree. The remarkable performance of this technique is demonstrated on IEEE systems with more than 7000 different cost functions.