By Topic

Unlimited point algorithm for OPF problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Tognola, G. ; Swiss Federal Inst. of Technol., Zurich, Switzerland ; Bacher, R.

A nonlinear optimal power flow (OPF) algorithm is presented which allows to solve the Karush-Kuhn-Tucker (KKT) optimality conditions using a pure Newton-Raphson solution procedure. The method is similar to interior point algorithms. However, due to a simple transformation, the variable space becomes unlimited (unlimited point) and variables do not need to be forced to stay within the feasible region during all OPF iterations as is the case for interior point algorithms. As a consequence only a pure Newton-Raphson iterative process to algebraically transformed KKT conditions is applied. The algorithm has been successfully applied to various networks up to size 700 buses with the active power loss objective function

Published in:

Power Industry Computer Applications., 1997. 20th International Conference on

Date of Conference:

11-16 May 1997