A semidefinite programming method with graph partitioning technique for optimal power flow problems

A new semidefinite programming (SDP) method with graph partitioning technique to solve optimal power flow (OPF) problems is presented in this paper. The non-convex OPF problem is converted into its convex SDP model at first, and then according to the characters of power system network, the matrix variable of SDP is re-arranged using the chordal extension of its aggregate sparsity pattern by the graph partitioning technique. A new SDP-OPF model is reformulated with the re-arranged matrix variable, and can be solved by the interior point method (IPM) for SDP. This method can reduce the consumption of computer memory and improve the computing performance significantly. Extensive numerical simulations on seven test systems with sizes up to 542 buses have shown that this new method of SDP-OPF can guarantee the global optimal solutions within the polynomial time same as the original SDP-OPF, but less CPU times and memory.

[1]  Sydulu Maheswarapu,et al.  Enhanced Genetic Algorithm based computation technique for multi-objective Optimal Power Flow solution , 2010 .

[2]  Hans D. Mittelmann,et al.  An independent benchmarking of SDP and SOCP solvers , 2003, Math. Program..

[3]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[4]  Hao Wu,et al.  An OPF based approach for assessing the minimal reactive power support for generators in deregulated power systems , 2008 .

[5]  Xiong Zhang,et al.  Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization , 1999, SIAM J. Optim..

[6]  Charles R. Johnson,et al.  Positive definite completions of partial Hermitian matrices , 1984 .

[7]  V. A. de Sousa,et al.  Studies of cases in power systems by Sensitivity Analysis oriented by OPF , 2010 .

[8]  Victor H. Quintana,et al.  Interior-point methods and their applications to power systems: a classification of publications and software codes , 2000 .

[9]  Lieven Vandenberghe,et al.  Convex optimization problems involving finite autocorrelation sequences , 2002, Math. Program..

[10]  Stephen P. Boyd,et al.  Semidefinite Programming , 1996, SIAM Rev..

[11]  H. Sasaki,et al.  An application of interior point quadratic programming algorithm to power system optimization problems , 1995 .

[12]  V. Quintana,et al.  Medium-term hydrothermal coordination by semidefinite programming , 2003 .

[13]  Michael L. Overton,et al.  Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results , 1998, SIAM J. Optim..

[14]  Panos M. Pardalos,et al.  Handbook of applied optimization , 2002 .

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

[16]  William F. Tinney,et al.  Optimal Power Flow Solutions , 1968 .

[17]  James A. Momoh,et al.  Challenges to optimal power flow , 1997 .

[18]  Michel X. Goemans,et al.  Semideenite Programming in Combinatorial Optimization , 1999 .

[19]  Masakazu Kojima,et al.  SDPA-M (SemiDefinite Programming Algorithm in MATLAB) User's Manual — Version 6.2.0 , 2003 .

[20]  Pablo A. Parrilo,et al.  Semidefinite Programming Relaxations and Algebraic Optimization in Control , 2003, Eur. J. Control.