TY - JOUR
T1 - Implementation of a Large-Scale Optimal Power Flow Solver Based on Semidefinite Programming
JF - IEEE Transactions on Power Systems
Y1 - 2013/
SP - 3987
EP - 3998
A1 - Molzahn, Daniel K.
A1 - Holzer, Jesse T.
A1 - Bernard C. Lesieutre
A1 - Christopher L. DeMarco
KW - AA13-005
KW - AARD
KW - optimal power flow (OPF)
KW - RTGRM
AB - The application of semidefinite programming to the optimal power flow (OPF) problem has recently attracted significant research interest. This paper provides advances in modeling and computation required for solving the OPF problem for large-scale, general power system models. Specifically, a semidefinite programming relaxation of the OPF problem is presented that incorporates multiple generators at the same bus and parallel lines. Recent research in matrix completion techniques that decompose a single large matrix constrained to be positive semidefinite into many smaller matrices has made solution of OPF problems using semidefinite programming computationally tractable for large system models. We provide three advances to existing decomposition techniques: a matrix combination algorithm that further decreases solver time, a modification to an existing decomposition technique that extends its applicability to general power system networks, and a method for obtaining the optimal voltage profile from the solution to a decomposed semidefinite program.
VL - 28
IS - 4
JO - IEEE Trans. Power Syst.
DO - 10.1109/TPWRS.2013.2258044
ER -