mlsanityData to 7 Oct 2026

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

arXiv 1405.0766 ↗First posted 5 May 2014math.OC cs.SY eess.SYcited by 17

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 17 papers in the map (data through 7 Oct 2026). First posted on arXiv 5 May 2014.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 4; 2022: 1; 2023: 4; 2024: 3; 2025: 2; 2026: 3.

17 papers.

Sort: