The interior point branch and cut method for optimal power flow

As a complex mixed integer nonlinear programming problem, optimal power flow (OPF) is hardly to be solved by strict polynomial-time algorithm. In this paper, we present an interior point branch and cut method (IPBCM) for decoupled OPF problem. We use the modern interior point algorithm to solve acti...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International Conference on Power System Technology Proceedings, 2002 Ročník 1; s. 651 - 655 vol.1
Hlavní autoři: Ding Xiaoying, Wang Xifan, Song Yonghua, Geng Jian
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 2002
Témata:
Integer linear programming
Iterative algorithms
Large-scale systems
Load flow
Numerical simulation
Optimized production technology
Polynomials
Power system simulation
Reactive power
System testing
ISBN:9780780374591, 0780374592
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:As a complex mixed integer nonlinear programming problem, optimal power flow (OPF) is hardly to be solved by strict polynomial-time algorithm. In this paper, we present an interior point branch and cut method (IPBCM) for decoupled OPF problem. We use the modern interior point algorithm to solve active power suboptimal problem because it is very efficient for nonlinear programming problem. Reactive power suboptimal problem is a mixed integer nonlinear programming problem, we use IPBCM to iteratively solve its linearizations. Compared with simplex cutting plane method, IPBCM is more efficient because of its polynomial-time characteristic. Furthermore, we discuss some important issues in the implementation of IPBCM. Numerical simulations on IEEE 14-57 buses standard test systems have shown that the proposed method is efficient in solving OPT problems for large-scale power systems.
ISBN:9780780374591
0780374592
DOI:10.1109/ICPST.2002.1053623