| Article ID: | iaor2008786 |
| Country: | United Kingdom |
| Volume: | 15 |
| Issue: | 4 |
| Start Page Number: | 355 |
| End Page Number: | 368 |
| Publication Date: | Oct 2004 |
| Journal: | IMA Journal of Management Mathematics (Print) |
| Authors: | Ding Xiaoying, Wang Xifan, Song Y.H. |
| Keywords: | programming: mathematical |
In this paper, an interior point cutting plane method (IPCPM) is applied to solve optimal power flow (OPF) problems. Compared with the simplex cutting plane method (SCPM), the IPCPM is simpler, and efficient because of its polynomial-time characteristic. Issues in implementing IPCPM for OPF problems are addressed, including (1) how to generate cutting planes without using the simplex tableau, (2) how to identify the basis variables in IPCPM, and (3) how to generate mixed integer cutting planes. The calculation speed of the proposed algorithm is further enhanced by utilizing the sparsity features of the OPF formulation. Numerical simulations on IEEE 14-300-bus test systems have shown that the proposed method is effective.