Published August 2014
| Submitted
Book Section - Chapter
Open
Convex relaxations and linear approximation for optimal power flow in multiphase radial networks
- Creators
- Gan, Lingwen
-
Low, Steven H.
Chicago
An error occurred while generating the citation.
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.
Additional Information
© 2014 IEEE. Paper submitted to Power Systems Computation Conference, August 18-22, 2014, Wroclaw, Poland, organized by Power Systems Computation Conference and Wroclaw University of Technology. This work was supported by NSF NetSE grant CNS 0911041, ARPA-E grant DE-AR0000226, Southern California Edison, National Science Council of Taiwan, R.O.C, grant NSC 101-3113-P-008-001, and Caltech's Resnick Institute.Attached Files
Submitted - 1406.3054.pdf
Files
1406.3054.pdf
Files
(620.7 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:5ad45d79d200912454aa81117346cbb9
|
620.7 kB | Preview Download |
Additional details
- Eprint ID
- 80127
- Resolver ID
- CaltechAUTHORS:20170810-114020714
- NSF
- CNS-0911041
- ARPA-E
- DE-AR0000226
- Southern California Edison
- National Science Council (Taipei)
- NSC 101-3113-P-008-001
- Resnick Sustainability Institute
- Created
-
2017-08-10Created from EPrint's datestamp field
- Updated
-
2021-11-15Created from EPrint's last_modified field
- Caltech groups
- Resnick Sustainability Institute