DocumentCode :
2888172
Title :
Optimal power flow over tree networks
Author :
Bose, Subhonmesh ; Gayme, Dennice F. ; Low, Steven ; Chandy, K. Mani
Author_Institution :
Dept. of Electr. Eng., California Inst. of Technol., Pasadena, CA, USA
fYear :
2011
fDate :
28-30 Sept. 2011
Firstpage :
1342
Lastpage :
1348
Abstract :
The optimal power flow (OPF) problem is critical to power system operation but it is generally non-convex and therefore hard to solve. Recently, a sufficient condition has been found under which OPF has zero duality gap, which means that its solution can be computed efficiently by solving the convex dual problem. In this paper we simplify this sufficient condition through a reformulation of the problem and prove that the condition is always satisfied for a tree network provided we allow over-satisfaction of load. The proof, cast as a complex semi-definite program, makes use of the fact that if the underlying graph of an n × n Hermitian positive semi-definite matrix is a tree, then the matrix has rank at least n-1.
Keywords :
load flow; power grids; trees (mathematics); Hermitian positive semidefinite matrix; complex semidefinite program; nonconvex problem; optimal power flow; power system operation; tree networks; Admittance; Computational modeling; Eigenvalues and eigenfunctions; Load flow; Null space; Reactive power; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communication, Control, and Computing (Allerton), 2011 49th Annual Allerton Conference on
Conference_Location :
Monticello, IL
Print_ISBN :
978-1-4577-1817-5
Type :
conf
DOI :
10.1109/Allerton.2011.6120323
Filename :
6120323
Link To Document :
بازگشت