An Overview of Semidefinite Relaxations for Optimal Power Flow Problem

I. A. Zorin, E. N. Gryazina

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

The AC optimal power flow (AC OPF) problem is considered and five convex relaxations for solving this problem—the semidefinite, chordal, conic, and moment-based ones as well as the QC relaxation—are overviewed. The specifics of the AC formulation and also the nonconvexity of the problem are described in detail. Each of the relaxations for OPF is written in explicit form. The semidefinite, chordal and conic relaxations are of major interest. They are implemented on a test example of four nodes.

Original languageEnglish
Pages (from-to)813-833
Number of pages21
JournalAutomation and Remote Control
Volume80
Issue number5
DOIs
Publication statusPublished - 1 May 2019

Keywords

  • convex relaxations
  • power flows
  • power systems
  • semidefinite programming

Cite this