Journal
IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS
Volume 1, Issue 1, Pages 15-27Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCNS.2014.2309732
Keywords
Convex relaxation; optimal power flow; power systems; quadratically constrained quadratic program (QCQP); second-order cone program (SOCP); semidefinite program (SDP); semidefinite relaxation
Funding
- NSF under Grant NetSE [CNS 0911041]
- ARPA-E under Grant GENI [DE- AR0000226]
- National Science Council of Taiwan [NSC 103-3113-P-008-001]
- Southern California Edison
- Los Alamos National Lab
- Caltech'sResnick Institute
- Division of Computing and Communication Foundations
- Direct For Computer & Info Scie & Enginr [1144502] Funding Source: National Science Foundation
Ask authors/readers for more resources
This tutorial summarizes recent advances in the convex relaxation of the optimal power flow (OPF) problem, focusing on structural properties rather than algorithms. Part I presents two power flow models, formulates OPF and their relaxations in each model, and proves equivalence relationships among them. Part II presents sufficient conditions under which the convex relaxations are exact.
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
Share Paper
