Strong SOCP Relaxations for the Optimal Power Flow Problem

By Burak Kocuk, Santanu S. Dey, Xu Andy Sun. Operational Research, 2015

326 citations recorded by the source corpus.

This paper proposes three strong second order cone programming (SOCP) relaxations for the AC optimal power flow (OPF) problem. These three relaxations are incomparable to each other and two of them are incomparable to the standard SDP relaxation of OPF. Extensive computational experiments show that these relaxations have numerous advantages over existing convex relaxations in the literature: (i) their solution quality is extremely close to that of the standard SDP relaxation (the best one is within 99.96% of the SDP relaxation on average for all the IEEE test cases) and consistently outperforms previously proposed convex quadratic relaxations of the OPF problem, (ii) the solutions from the strong SOCP relaxations can be directly used as a warm start in a local solver such as IPOPT to obtain a high quality feasible OPF solution, and (iii) in terms of computation times, the strong SOCP relaxations can be solved an order of magnitude faster than the standard SDP relaxation. For example, one of the proposed S...

Subfields: Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/c47a373335fb47a63fbe58b1162362a72e1a8310

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Electrical and Electronic Engineering

  1. Daniel D. Molzahn
  2. Steven H. Low
  3. Javad Lavaei
  4. Vijay Vittal
  5. Qifeng Li
  6. Florian Dörfler
  7. Henrik Sandberg
  8. Ross Baldick

Citations in the corpus