In *IEEE International Symposium on Circuits and Systems (ISCAS)*, pages 1887-1890, May, 2015.

Paper Link doi abstract bibtex

Paper Link doi abstract bibtex

Recently, there has been significant interest in convex relaxations of the optimal power flow (OPF) problem. A semidefinite relaxation globally solves many OPF problems. However, there exist practical problems for which the semidefinite relaxation fails to yield the global solution. Conditions for the success or failure of the semidefinite relaxation are valuable for determining whether the relaxation is appropriate for a given OPF problem. To move beyond existing conditions, which only apply to a limited class of problems, a typical conjecture is that failure of the semidefinite relaxation can be related to physical characteristics of the system. By presenting an example OPF problem with two equivalent formulations, this paper demonstrates that physically based conditions cannot universally explain algorithm behavior. The semidefinite relaxation fails for one formulation but succeeds in finding the global solution to the other formulation. Since these formulations represent the same system, success (or otherwise) of the semidefinite relaxation must involve factors beyond just the network physics.

@inproceedings{molzahn_baghsorkhi_hiskens-iscas2015, author={D. K. Molzahn and S. S. Baghsorkhi and I. A. Hiskens}, booktitle={IEEE International Symposium on Circuits and Systems (ISCAS)}, title={{Semidefinite Relaxations of Equivalent Optimal Power Flow Problems: An Illustrative Example}}, year={2015}, pages={1887-1890}, month={May}, doi={10.1109/ISCAS.2015.7169026}, keywords={Optimal Power Flow}, abstract={Recently, there has been significant interest in convex relaxations of the optimal power flow (OPF) problem. A semidefinite relaxation globally solves many OPF problems. However, there exist practical problems for which the semidefinite relaxation fails to yield the global solution. Conditions for the success or failure of the semidefinite relaxation are valuable for determining whether the relaxation is appropriate for a given OPF problem. To move beyond existing conditions, which only apply to a limited class of problems, a typical conjecture is that failure of the semidefinite relaxation can be related to physical characteristics of the system. By presenting an example OPF problem with two equivalent formulations, this paper demonstrates that physically based conditions cannot universally explain algorithm behavior. The semidefinite relaxation fails for one formulation but succeeds in finding the global solution to the other formulation. Since these formulations represent the same system, success (or otherwise) of the semidefinite relaxation must involve factors beyond just the network physics.}, url_Paper={molzahn_baghsorkhi_hiskens-iscas2015.pdf}, url_Link={http://ieeexplore.ieee.org/document/7169026/}, }

Downloads: 0