Published November 2012
| public
Book Section - Chapter
Exact Convex Relaxation of OPF for Radial Networks using Branch Flow Model
- Creators
- Li, Na
- Chen, Lijun
-
Low, Steven H.
Chicago
An error occurred while generating the citation.
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.
Additional Information
© 2012 IEEE. The authors would like to acknowledge Lingwen Gan for his insightful discussions on this topic. This work is 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, the Caltech Resnick Institute, and the Okawa Foundation.Additional details
- Eprint ID
- 40933
- DOI
- 10.1109/SmartGridComm.2012.6485951
- Resolver ID
- CaltechAUTHORS:20130826-134301716
- NSF
- CNS-0911041
- ARPA-E
- DE-AR0000226
- Southern California Edison
- National Science Council (Taipei)
- NSC 101-3113-P-008-001
- Resnick Sustainability Institute
- Okawa Foundation
- Created
-
2013-08-26Created from EPrint's datestamp field
- Updated
-
2021-11-10Created from EPrint's last_modified field
- Caltech groups
- Resnick Sustainability Institute