Skip Navigation

IMA Journal of Management Mathematics 2004 15(4):355-368; doi:10.1093/imaman/15.4.355
© 2004 by Institute of Mathematics and its Applications
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Ding, X.
Right arrow Articles by Song, Y. H.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Interior point cutting plane method for optimal power flow

Xiaoying Ding1, Xifan Wang1 and Y. H. Song2

1 School of Electrical Engineering, Xi’an Jiaotong University, Xi’an, 710049, People's Republic of China, 2 Brunel Institute of Power Systems, Brunel University, Uxbridge UB8 3PH, UK

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.

Keywords: optimal power flow; interior point cutting; plane method


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.