articleIEEE Transactions on Control of Network SystemsMar 1, 2014GREEN OA

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

SHSteven H. Low

California Institute of Technology

Indexed inarxivcrossref

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

Citation impact

893
total citations
FWCI
40.45
Percentile
100%
References
57
Citations per year

Authors

1
  • SH
    Steven H. LowCorresponding

    California Institute of Technology

Topics & keywords

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