TY - JOUR

T1 - An interior point nonlinear programming for optimal power flow problems with a novel data structure

AU - Wei, H.

AU - Sasaki, H.

AU - Kubokawa, J.

AU - Yokoyama, R.

PY - 1997

Y1 - 1997

N2 - This paper presents a new interior point nonlinear programming algorithm for optimal power flow problems (OPF) based on the perturbed KKT conditions of the primal problem. Through the concept of the centering direction, we extend this algorithm to classical power flow (PF) and approximate OPF problems. For the latter, CPU time can be reduced substantially. To efficiently handle functional inequality constraints, a reduced correction equation is derived, the size of which depends on that of equality constraints. A novel data structure is proposed which has been realized by rearranging the correction equation, Compared with the conventional data structure of Newton OPF, the number of fill-ins of the proposed scheme is roughly halved and CPU time is reduced by about 15% for large scale systems. The proposed algorithm includes four kinds of objective functions and two different data structures. Extensive numerical simulations on test systems that range in size from 14 to 1047 buses, have shown that the proposed method is very promising for large scale application due to its robustness and fast execution time.

AB - This paper presents a new interior point nonlinear programming algorithm for optimal power flow problems (OPF) based on the perturbed KKT conditions of the primal problem. Through the concept of the centering direction, we extend this algorithm to classical power flow (PF) and approximate OPF problems. For the latter, CPU time can be reduced substantially. To efficiently handle functional inequality constraints, a reduced correction equation is derived, the size of which depends on that of equality constraints. A novel data structure is proposed which has been realized by rearranging the correction equation, Compared with the conventional data structure of Newton OPF, the number of fill-ins of the proposed scheme is roughly halved and CPU time is reduced by about 15% for large scale systems. The proposed algorithm includes four kinds of objective functions and two different data structures. Extensive numerical simulations on test systems that range in size from 14 to 1047 buses, have shown that the proposed method is very promising for large scale application due to its robustness and fast execution time.

KW - Approximate opf

KW - Centering direction

KW - Interior point nonlinear programming

KW - Optimal power flow

KW - Perturbed kkt conditions

UR - http://www.scopus.com/inward/record.url?scp=35848951866&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35848951866&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:35848951866

VL - 17

SP - 59

JO - IEEE Power Engineering Review

JF - IEEE Power Engineering Review

SN - 0272-1724

IS - 12

ER -