Journal
IEEE TRANSACTIONS ON AUTOMATIC CONTROL
Volume 60, Issue 3, Pages 729-742Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TAC.2014.2357112
Keywords
Optimal power flow (OPF); semidefinite program (SDP)
Funding
- National Science Foundation (NSF) through NetSE [CNS 0911041, CNS-0932428, CCF-1018927, CCF-1423663, CCF-1409204]
- ARPA-E [DE-AR0000226]
- National Science Council of Taiwan [NSC 103-3113-P-008-001]
- Southern California Edison
- Los Alamos National Lab (DoE)
- Resnick Institute at Caltech
- Office of Naval Research under the MURI [N00014-08-0747]
- Qualcomm Inc.
- King Abdulaziz University
Ask authors/readers for more resources
Several convex relaxations of the optimal power flow (OPF) problem have recently been developed using both bus injection models and branch flow models. In this paper, we prove relations among three convex relaxations: a semidefinite relaxation that computes a full matrix, a chordal relaxation based on a chordal extension of the network graph, and a second-order cone relaxation that computes the smallest partial matrix. We prove a bijection between the feasible sets of the OPF in the bus injection model and the branch flow model, establishing the equivalence of these two models and their second-order cone relaxations. Our results imply that, for radial networks, all these relaxations are equivalent and one should always solve the second-order cone relaxation. For mesh networks, the semidefinite relaxation and the chordal relaxation are equally tight and both are strictly tighter than the second-order cone relaxation. Therefore, for mesh networks, one should either solve the chordal relaxation or the SOCP relaxation, trading off tightness and the required computational effort. Simulations are used to illustrate these results.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available