Published December 2012
| public
Book Section - Chapter
On the exactness of convex relaxation for optimal power flow in tree networks
- Creators
- Gan, Lingwen
- Li, Na
- Topcu, Ufuk
-
Low, Steven
Abstract
The optimal power flow problem is nonconvex, and a convex relaxation has been proposed to solve it. We prove that the relaxation is exact, if there are no upper bounds on the voltage, and any one of some conditions holds. One of these conditions requires that there is no reverse real power flow, and that the resistance to reactance ratio is non-decreasing as transmission lines spread out from the substation to the branch buses. This condition is likely to hold if there are no distributed generators. Besides, avoiding reverse real power flow can be used as rule of thumb for placing distributed generators.
Additional Information
© 2012 IEEE. This work was supported by Bell Labs of Alcatel-Lucent, 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, Resnick Institute, Okawa Foundation, Boeing Corporation, Cisco, and AFOSR award number FA9550-12-1-0302.Additional details
- Eprint ID
- 43112
- Resolver ID
- CaltechAUTHORS:20131220-094526108
- Bell Labs of Alcatel-Lucent
- CNS-0911041
- NSF
- DE-AR0000226
- ARPA-E
- Southern California Edison
- NSC 101-3113-P-008-001
- National Science Council (Taipei)
- Resnick Sustainability Institute
- Okawa Foundation
- Boeing Corporation
- Cisco
- FA9550-12-1-0302
- Air Force Office of Scientific Research (AFOSR)
- Created
-
2013-12-23Created from EPrint's datestamp field
- Updated
-
2021-11-10Created from EPrint's last_modified field
- Caltech groups
- Resnick Sustainability Institute