A Linear-Programming Approximation of AC Power Flows

被引:203
作者
Coffrin, Carleton [1 ]
Van Hentenryck, Pascal [2 ,3 ]
机构
[1] NICTA, Optimizat Res Grp, Melbourne, Vic 3010, Australia
[2] NICTA, Optimizat Res Grp, Canberra, ACT 2601, Australia
[3] Australian Natl Univ, Coll Engn & Comp Sci, Canberra, ACT 0200, Australia
基金
澳大利亚研究理事会;
关键词
DC power flow; AC power flow; LP power flow; polyhedral relaxation; power system analysis; capacitor placement; power system restoration; PLACEMENT; SECURITY; ALGORITHM; STRATEGY; MODEL;
D O I
10.1287/ijoc.2014.0594
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Linear active-power-only power flow approximations are pervasive in the planning and control of power systems. However, AC power systems are governed by a system of nonlinear nonconvex power flow equations. Existing linear approximations fail to capture key power flow variables, including reactive power and voltage magnitudes, both of which are necessary in many applications that require voltage management and AC power flow feasibility. This paper proposes novel linear-programming models (the LPAC models) that incorporate reactive power and voltage magnitudes in a linear power flow approximation. The LPAC models are built on a polyhedral relaxation of the cosine terms in the AC equations as well as Taylor approximations of the remaining nonlinear terms. Experimental comparisons with AC solutions on a variety of standard IEEE and Matpower benchmarks show that the LPAC models produce accurate values for active and reactive power, phase angles, and voltage magnitudes. The potential benefits of the LPAC models are illustrated on two "proof-of-concept" studies in power restoration and capacitor placement.
引用
收藏
页码:718 / 734
页数:17
相关论文
共 60 条
[1]   AN OPTIMAL REACTIVE POWER PLANNING STRATEGY AGAINST VOLTAGE COLLAPSE [J].
AJJARAPU, V ;
LAU, PL ;
BATTULA, S .
IEEE TRANSACTIONS ON POWER SYSTEMS, 1994, 9 (02) :906-917
[2]  
[Anonymous], BENCHMARKS OPTIMIZAT
[3]  
[Anonymous], 2013, Power generation, operation, and control
[4]  
[Anonymous], P 2011 IEEE POW EN S
[5]  
Bhattacharya Aniruddha., 2010, Int J Elect Computer Eng, V4, P568
[6]   Using mixed-integer programming to solve power grid blackout problems [J].
Bienstock, Daniel ;
Mattia, Sara .
DISCRETE OPTIMIZATION, 2007, 4 (01) :115-141
[7]   THE N-k PROBLEM IN POWER GRIDS: NEW MODELS, FORMULATIONS, AND NUMERICAL EXPERIMENTS [J].
Bienstock, Daniel ;
Verma, Abhinav .
SIAM JOURNAL ON OPTIMIZATION, 2010, 20 (05) :2352-2380
[8]  
Bixby RE, 2000, INT FED INFO PROC, V46, P19
[9]  
Borghetti A, 2011, P 17 POW SYST COMP C
[10]   LINEAR REACTIVE POWER OPTIMIZATION IN A LARGE POWER NETWORK USING THE DECOMPOSITION APPROACH [J].
DEEB, N ;
SHAHIDEHPOUR, SM .
IEEE TRANSACTIONS ON POWER SYSTEMS, 1990, 5 (02) :428-478