Published January 2015
| Submitted
Journal Article
Open
Exact Convex Relaxation of Optimal Power Flow in Radial Networks
- Creators
- Gan, Lingwen
- Li, Na
- Topcu, Ufuk
-
Low, Steven H.
Abstract
The optimal power flow (OPF) problem determines a network operating point that minimizes a certain objective such as generation cost or power loss. It is nonconvex. We prove that a global optimum of OPF can be obtained by solving a second-order cone program, under a mild condition after shrinking the OPF feasible set slightly, for radial power networks. The condition can be checked a priori, and holds for the IEEE 13, 34, 37, 123-bus networks and two real-world networks.
Additional Information
© 2014 IEEE. Manuscript received March 20, 2013; revised November 19, 2013, March 13, 2014, and May 26, 2014; accepted May 27, 2014. Date of publication June 25, 2014; date of current version December 22, 2014. This work was supported by NSF NetSE grant CNS 0911041, ARPA-E grant DE-AR0000226, Southern California Edison, National Science Council of Taiwan, grant NSC 103-3113-P-008-001, Los Alamos National Lab through a DoE grant, Resnick Institute, and AFOSR award FA9550-12-1-0302. Recommended by Associate Editor C. M. Lagoa.Attached Files
Submitted - 1311.7170.pdf
Files
1311.7170.pdf
Files
(1.3 MB)
| Name | Size | Download all |
|---|---|---|
|
md5:a2ac701c1515ad8c43b69abf0f76dd06
|
1.3 MB | Preview Download |
Additional details
- Eprint ID
- 54315
- Resolver ID
- CaltechAUTHORS:20150203-084513340
- CNS-0911041
- NSF
- DE-AR0000226
- Department of Energy (DOE)
- Southern California Edison
- NSC 103-3113-P-008-001
- National Science Council (Taipei)
- Los Alamos National Lab
- Resnick Sustainability Institute
- FA9550-12-1-0302
- Air Force Office of Scientific Research (AFOSR)
- Created
-
2015-02-04Created from EPrint's datestamp field
- Updated
-
2021-11-10Created from EPrint's last_modified field
- Caltech groups
- Resnick Sustainability Institute