scispace - formally typeset
Journal ArticleDOI

Quadratically Convergent Optimal Power Flow

R. C. Burchett, +2 more
- 01 Nov 1984 - 
- Vol. 103, Iss: 11, pp 3267-3275
TLDR
A newly developed sparse implementation of an optimization method using exact second derivatives is applied to the optimal power flow problem, and an option to add shunt capacitors in the event of hopeless infeasibility guarantees an optimal solution for many difficult to solve systems.
Abstract
A newly developed sparse implementation of an optimization method using exact second derivatives is applied to the optimal power flow problem. Four utility systems are studied using a variety of objective functions, including fuel costs, active and reactive losses, and new shunt capacitors. Systems solved range from 350 buses to 2000 buses. Comparisons are made with an older algorithm which uses an Augmented Lagrangian to demonstrate the advantages of run time and robustness of the new method. The algorithm and accompanying software represent a technological breakthrough, since they are suitable for solving systems on the order of 2000 buses and demonstrate solution speeds of 5 minutes on large mainframe computers. The method is particularly well suited to infeasible, or even divergent starting points. An option to add shunt capacitors in the event of hopeless infeasibility guarantees an optimal solution for many difficult to solve systems. An automatic scaling feature is added to correct numerical ill-conditioning resulting from series compensation or poor R/X ratios.

read more

Citations
More filters
Journal ArticleDOI

Optimal power flow using particle swarm optimization

TL;DR: In this paper, an evolutionary-based approach to solve the optimal power flow (OPF) problem is presented. And the proposed approach has been examined and tested on the standard IEEE 30bus test system with different objectives that reflect fuel cost minimization, voltage profile improvement, and voltage stability enhancement.
Journal ArticleDOI

Optimal reactive dispatch through interior point methods

TL;DR: An implementation of an interior point method to the optimal reactive dispatch problem is described in this article, which is based on the primal-dual algorithm and the numerical results in large scale networks (1832 and 3467 bus systems) have shown that this technique can be very effective to some optimal power flow applications.
Journal ArticleDOI

A review of selected optimal power flow literature to 1993. I. Nonlinear and quadratic programming approaches

TL;DR: In this paper, a review of literature on optimal power flow tracing progress in this area over from 1962-93 is presented. Part I deals with the application of nonlinear and quadratic programming.
Journal ArticleDOI

A survey of the optimal power flow literature

TL;DR: A survey of publications in the fields of optimal power flow and dispatching can be found in this article, where the authors suggest a classification of methods based on the choice of optimization techniques and a single flow-chart-type figure, which indicates the relationship between methods, their chronology, and their popularity.
Journal ArticleDOI

A review of recent advances in economic dispatch

TL;DR: In this article, a survey of papers and reports that address various aspects of economic dispatch is presented, including optimal power flow, economic dispatch in relation to AGC, dynamic dispatch, and economic dispatch with nonconventional generation sources.
References
More filters
Journal ArticleDOI

Large Scale Optimal Power Flow

TL;DR: In this paper, a new optimization method is applied to optimal power flow analysis, based on transforming the original problem to that of solving a sequence of linearly constrained subproblems using an augmented Lagrangian type objective function.
Journal ArticleDOI

Large Scale Optimal Power Flow

Journal ArticleDOI

Modified quasilinearization and optimal initial choice of the multipliers part 1—Mathematical programming problems

TL;DR: In this paper, a modified quasilinearization algorithm is developed; its main property is a descent property in the performance indexR, the cumulative error in the constraint and the optimum condition.
Journal ArticleDOI

The prerestorative step in the sequential Gradient-Restoration Algorithm for mathematical Programming problems with inequality constraints*

TL;DR: A modification of the sequential gradient-restoration algorithm, designed to improve the convergence characteristics, is presented, which consists of inserting a prerestorative step prior to any iteration of the algorithm to reduce the constraint violation.
Related Papers (5)