Convex Relaxations of Optimal Power Flow Problems: An Illustrative Example
Convex Relaxations of Optimal Power Flow Problems: An Illustrative Example
Recently, there has been significant interest in convex relaxations of the optimal power flow (OPF) problem. A semidefinite programming (SDP) relaxation globally solves many OPF problems. However, there exist practical problems for which the SDP relaxation fails to yield the global solution. Conditions for the success or failure of the …