Optimal Load Flow Solution Using the Hessian Matrix

Sasson, Albert; Viloria, F.; Aboytes, F.

doi:10.1109/tpas.1973.293590

Cited by 106 publications

(31 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The subject of the optimal power flows for system operation has been reported widely in the literature [1][2][3][4][5][6] with the author of [7] reviewing the subject. Essentially, the optimal power flow calculation employs mathematical optimisation techniques to optimise the steady-state operating conditions of a power system.…”

Section: Introductionmentioning

confidence: 99%

Decoupled Secure Economic Dispatch Algorithm for Power Systems Operation

Ekwue

1986

COMPEL - The International Journal for Computation and Mathematics in Electrical and Electronic Engineering

View full text Add to dashboard Cite

This paper describes an algorithm which can be used to determine the optimal power flows of a network via the Dommel‐Tinney approach with or without the incorporation of security constraints; security constraints are properly handled via sensitivity analysis and least‐squares minimisation techniques. The algorithm can also determine the security enhancement of a network without taking the economics of operation into consideration. The refined second‐order loadflow method using rectangular coordinates is employed and the contingencies are determined by second‐order corrections on the base‐case; the computational aspects of this development are highlighted in the appropriate sections. The main emphasis of this paper is on numerical methods.

show abstract

Section: Introductionmentioning

confidence: 99%

Decoupled Secure Economic Dispatch Algorithm for Power Systems Operation

Ekwue

1986

COMPEL - The International Journal for Computation and Mathematics in Electrical and Electronic Engineering

View full text Add to dashboard Cite

show abstract

“…Commensurate with the power flow Newton-Raphson application, the Jacobian sub-matrix in (15) keeps the same level of sparsity as the nodal admittance matrix and so does its Hessian sub-matrix. This contrasts with an earlier formulation based solely on the use of an alternative Hessian matrix [20], which contains little sparsity. The gradient vector, L z  , which comprises the first order derivatives of the Lagrangian function with respect to the entries of vector z ought to maintain a decreasing pace throughout the course of the iterative solution [2], [18]- [20], to ensure a reliable solution towards the optimum.…”

Section: F(p G )mentioning

confidence: 85%

An advanced STATCOM model for optimal power flows using Newton's method

Kazemtabrizi

Acha

2015

2015 IEEE Power &Amp; Energy Society General Meeting

View full text Add to dashboard Cite

(2014) 'An advanced STATCOM model for optimal power ows using Newton's method.', IEEE transactions on power systems., 29 (2). pp. 514-525. Further information on publisher's website:http://dx.doi.org/10.1109/TPWRS.2013.2287914Publisher's copyright statement: c 2014 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Additional information:Use policyThe full-text may be used and/or reproduced, and given to third parties in any format or medium, without prior permission or charge, for personal research or study, educational, or not-for-prot purposes provided that:• a full bibliographic reference is made to the original source • a link is made to the metadata record in DRO • the full-text is not changed in any way The full-text must not be sold in any format or medium without the formal permission of the copyright holders.Please consult the full DRO policy for further details.

show abstract

“…These methods were used by Sasson [Sasson et al, 1969], to transform the OPF into an unconstrained problem and solve it via the Fletcher-Powell method. The better performance of the Penalty methods led to subsequent studies [Sasson et al, 1971]. In this last work, penalties were used to represent both equality and inequality constraints of the OPF problem and the modified unconstrained OPF was solved via the Newton method.…”

Section: Penalty Based Approachesmentioning

confidence: 99%