Implementation of a Large-Scale Optimal Power Flow Solver Based on Semidefinite Programming

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.

[1]  Robert E. Tarjan,et al.  Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..

[2]  Patrick R. Amestoy,et al.  An Approximate Minimum Degree Ordering Algorithm , 1996, SIAM J. Matrix Anal. Appl..

[3]  Jos F. Sturm,et al.  A Matlab toolbox for optimization over symmetric cones , 1999 .

[4]  Kazuo Murota,et al.  Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework , 2000, SIAM J. Optim..

[5]  Gabriel Valiente,et al.  Algorithms on Trees and Graphs , 2002, Springer Berlin Heidelberg.

[6]  Katsuki Fujisawa,et al.  Exploiting sparsity in semidefinite programming via matrix completion II: implementation and numerical results , 2003, Math. Program..

[7]  Kim-Chuan Toh,et al.  Solving semidefinite-quadratic-linear programs using SDPT3 , 2003, Math. Program..

[8]  Timothy A. Davis,et al.  Algorithm 837: AMD, an approximate minimum degree ordering algorithm , 2004, TOMS.

[9]  J. Lofberg,et al.  YALMIP : a toolbox for modeling and optimization in MATLAB , 2004, 2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508).

[10]  I. Hiskens,et al.  Convexity of the set of feasible injections and revenue adequacy in FTR markets , 2005, IEEE Transactions on Power Systems.

[11]  K. Fujisawa,et al.  Semidefinite programming for optimal power flow problems , 2008 .

[12]  R. Belmans,et al.  A literature survey of Optimal Power Flow problems in the electricity market context , 2009, 2009 IEEE/PES Power Systems Conference and Exposition.

[13]  David Tse,et al.  Geometry of feasible injection region of power networks , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[14]  Masakazu Kojima,et al.  Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion , 2011, Math. Program..

[15]  K. Mani Chandy,et al.  Optimal power flow over tree networks , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[16]  R D Zimmerman,et al.  MATPOWER: Steady-State Operations, Planning, and Analysis Tools for Power Systems Research and Education , 2011, IEEE Transactions on Power Systems.

[17]  Daniel K. Molzahn,et al.  Examining the limits of the application of semidefinite programming to power flow problems , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[18]  Xiaoqing Bai,et al.  A semidefinite programming method with graph partitioning technique for optimal power flow problems , 2011 .

[19]  R. Jabr.  Exploiting Sparsity in SDP Relaxations of the OPF Problem , 2012, IEEE Transactions on Power Systems.

[20]  David Tse,et al.  Distributed algorithms for optimal power flow problem , 2011, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[21]  Javad Lavaei,et al.  Geometry of power flows in tree networks , 2012, 2012 IEEE Power and Energy Society General Meeting.

[22]  S. Low,et al.  Zero Duality Gap in Optimal Power Flow Problem , 2012, IEEE Transactions on Power Systems.

[23]  J. Lavaei,et al.  Physics of power networks makes hard optimization problems easy to solve , 2012, 2012 IEEE Power and Energy Society General Meeting.

[24]  A. Grothey,et al.  Local Solutions of Optimal Power Flow , 2013 .

[25]  B. Lesieutre,et al.  A Sufficient Condition for Power Flow Insolvability With Applications to Voltage Stability Margins , 2012, IEEE Transactions on Power Systems.