Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 1-7 |
| Number of pages | 7 |
| Journal | Zhongguo Dianji Gongcheng Xuebao/Proceedings of the Chinese Society of Electrical Engineering |
| Volume | 24 |
| Issue number | 2 |
| State | Published - Feb 2004 |
Keywords
- Degenerated problem
- Interior point cutting plane method
- Optimal power flow
- Power system