《《2016 A primal-dual interior point method for optimal power flow dispatching》.pdf

654 IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 17, NO. 3, AUGUST 2002 A Primal–Dual Interior Point Method for Optimal Power Flow Dispatching Rabih A. Jabr, Alun H. Coonick, and Brian J. Cory Abstract—In this paper, the solution of the optimal power Although these methods [1]–[6] proved to be efficient for flow dispatching (OPFD) problem by a primal–dual interior solving OPFD problems, they lack a technique which induces point method is considered. Several primal–dual methods for convergence and neglect the second-order sufficiency condi- optimal power flow (OPF) have been suggested, all of which are essentially direct extensions of primal–dual methods for tions [7], [8] which are needed to prove solution optimality. linear programming. The aim of the present work is to enhance An algorithm for nonlinear nonconvex programming which convergence through two modifications: a filter technique to guide does not check for the second-order conditions can leave the choice of the step length and an altered search direction in the user unsure about the outcome of the optimization. This order to avoid convergence to a nonminimizing stationary point. has motivated Almeida et al. [9] to propose the parametric A reduction in computational time is also gained through solving a positive definite matrix for the search direction. Numerical tests OPF that tracks the trajectory of the solution using Newton’s on standard IEEE systems and on a realistic network are very method while satisfying the second-order Kuhn–Tucker (K–T) encouraging and show that the new algorithm conver