DocumentCode
267588
Title
Convex relaxations and linear approximation for optimal power flow in multiphase radial networks
Author
Lingwen Gan ; Low, Steven H.
Author_Institution
Eng. & Appl. Sci. Div., California Inst. of Technol., Pasadena, CA, USA
fYear
2014
fDate
18-22 Aug. 2014
Firstpage
1
Lastpage
9
Abstract
Distribution networks are usually multiphase and radial. To facilitate power flow computation and optimization, two semidefinite programming (SDP) relaxations of the optimal power flow problem and a linear approximation of the power flow are proposed. We prove that the first SDP relaxation is exact if and only if the second one is exact. Case studies show that the second SDP relaxation is numerically exact and that the linear approximation obtains voltages within 0.0016 per unit of their true values for the IEEE 13, 34, 37, 123-bus networks and a real-world 2065-bus network.
Keywords
approximation theory; convex programming; distribution networks; load flow; IEEE 123-bus networks; IEEE 13-bus networks; IEEE 34-bus networks; IEEE 37-bus networks; convex relaxations; distribution networks; linear approximation; multiphase radial networks; optimal power flow problem; power flow computation; power flow optimization; real-world 2065-bus network; semidefinite programming relaxations; Computational modeling; Linear approximation; Load flow; Numerical stability; Programming; Silicon; Standards;
fLanguage
English
Publisher
ieee
Conference_Titel
Power Systems Computation Conference (PSCC), 2014
Conference_Location
Wroclaw
Type
conf
DOI
10.1109/PSCC.2014.7038399
Filename
7038399
Link To Document