DocumentCode
20521
Title
Convex Relaxation of Optimal Power Flow—Part I: Formulations and Equivalence
Author
Low, S.H.
Author_Institution
Eng. & Appl. Sci., California Inst. of Technol., Pasadena, CA, USA
Volume
1
Issue
1
fYear
2014
fDate
Mar-14
Firstpage
15
Lastpage
27
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 relationships among them. Part II presents sufficient conditions under which the convex relaxations are exact.
Keywords
convex programming; load flow; power system simulation; convex relaxation; optimal power flow; power flow model; structural properties; Biological system modeling; Control systems; Cost function; Equations; Generators; Mathematical model; Vectors; Convex relaxation; optimal power flow; power systems; quadratically constrained quadratic program (QCQP); second-order cone program (SOCP); semidefinite program (SDP); semidefinite relaxation;
fLanguage
English
Journal_Title
Control of Network Systems, IEEE Transactions on
Publisher
ieee
ISSN
2325-5870
Type
jour
DOI
10.1109/TCNS.2014.2309732
Filename
6756976
Link To Document