摘要
A new algorithm is presented to solve Mixed Integer Optimal Power Flow (OPF) problem by Interior Point Cutting Plane Method (IPCPM). The proposed algorithm repeatedly runs the following steps: (1) linearizing OPF problem at its feasible solution; (2) identifying the basis variables in interior point method (3) generating mixed integer cutting plane relied on these basis variables. Compared with Simplex Cutting Plane Method (SCPM), IPCPM is simpler, and during the scale of system becoming larger and larger, it is more efficient because of its polynomial-time characteristic. At the same time, the settlement of degenerated problem and the application of sparsity technique are discussed in details. Numerical simulations on IEEE test systems have shown that the proposed method is efficient in solving OPF problems for large-scale power systems.
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 1-7 |
| 页数 | 7 |
| 期刊 | Zhongguo Dianji Gongcheng Xuebao/Proceedings of the Chinese Society of Electrical Engineering |
| 卷 | 24 |
| 期 | 2 |
| 出版状态 | 已出版 - 2月 2004 |
学术指纹
探究 'Mixed integer optimal power flow based on interior point cutting plane method' 的科研主题。它们共同构成独一无二的指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver