DocumentCode
1669201
Title
Exact convex relaxation of OPF for radial networks using branch flow model
Author
Na Li ; Lijun Chen ; Low, S.H.
Author_Institution
Div. of Eng. & Appl. Sci., California Inst. of Technol., Pasadena, CA, USA
fYear
2012
Firstpage
7
Lastpage
12
Abstract
The optimal power flow (OPF) problem is generally nonconvex. Recently a second-order cone relaxation for OPF has been proposed using the branch flow model. In this paper, we provide sufficient conditions under which the relaxation is exact, and demonstrate that these conditions hold for a wide class of practical power distribution systems.
Keywords
convex programming; distribution networks; load flow; OPF; branch flow model; exact convex relaxation; optimal power flow problem; power distribution systems; radial networks; second-order cone relaxation; Boolean functions; Data structures; Integrated circuit modeling; Load modeling; Reactive power; System-on-chip; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Smart Grid Communications (SmartGridComm), 2012 IEEE Third International Conference on
Conference_Location
Tainan
Print_ISBN
978-1-4673-0910-3
Electronic_ISBN
978-1-4673-0909-7
Type
conf
DOI
10.1109/SmartGridComm.2012.6485951
Filename
6485951
Link To Document