articleJan 1, 2014Closed access

Convex Relaxation of Optimal Power Flow -- Part I: Formulations and Equivalence

SHSteven H. Low

Abstract

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 relations among them. Part II presents sufficient conditions under which the convex relaxations are exact.

Citation impact

595
total citations
FWCI
43.20
Percentile
100%
References
79
Citations per year

Authors

1
  • SH
    Steven H. LowCorresponding

Topics & keywords

Topics
Keywords
  • Equivalence (formal languages)
  • Regular polygon
  • Power flow
  • Relaxation (psychology)
  • Mathematical optimization
  • Mathematics
  • Convex analysis
  • Convex optimization
No related works found for this paper.