ScholarLens Back to search
2002•Unpublished venueRequires access

Unlimited point algorithm for OPF problems

Gabriella Tognola, R. Bacher

Open publisher page 7 citations

Abstract

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Karush–Kuhn–Tucker conditions, Newton's method, Mathematical optimization, Interior point method, Nonlinear system, Iterative method, Process (computing), Simple (philosophy)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Unlimited point algorithm for OPF problems — Research Paper | ScholarLens