Title :
Convex Relaxation of Optimal Power Flow—Part II: Exactness
Author_Institution :
Eng. & Appl. Sci. (EAS), California Inst. of Technol. (Caltech), Pasadena, CA, USA
Abstract :
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.
Keywords :
load flow; OPF problem; convex relaxation; equivalence relations; optimal power flow problem; structural properties; Control systems; Cost function; Mesh networks; Phase shifters; Tutorials; Upper bound; Voltage control; Convex relaxation; optimal power flow; power systems; quadratically constrained quadratic program (QCQP); second-order cone program (SOCP); semidefinite program (SDP); semidefinite relaxation;
Journal_Title :
Control of Network Systems, IEEE Transactions on
DOI :
10.1109/TCNS.2014.2323634