Reduced-Complexity Semidefinite Relaxations of Optimal Power Flow Problems
Reduced-Complexity Semidefinite Relaxations of Optimal Power Flow Problems
We propose a new method for generating semidefinite relaxations of optimal power flow problems. The method is based on chordal conversion techniques: by dropping some equality constraints in the conversion, we obtain semidefinite relaxations that are computationally cheaper, but potentially weaker, than the standard semidefinite relaxation. Our numerical results show …