Cart (Loading....) | Create Account
Close category search window
 

Optimal reactive dispatch through primal-dual method

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

1 Author(s)
da Costa, G.R.M. ; Dept. of Electr. Eng., Sao Paulo Univ., Brazil

This paper presents an algorithm for the optimal reactive dispatch problem. The algorithm is based on Newton's method which it works with an augmented Lagrangian function associated with the original problem. The function aggregates all the equality and inequality constraints. The first order necessary conditions for optimality are reached by Newton's method, and by updating the dual variables and the penalty terms associated with the inequality constraints. The proposed approach does not have to identify the set of binding constraints and can be utilized for an infeasible starting point. The sparsity of the Hessian matrix of the augmented Lagrangian is completely exploited in the computational implementation. Tests results are presented to show the good performance of this algorithm

Published in:

Power Systems, IEEE Transactions on  (Volume:12 ,  Issue: 2 )

Date of Publication:

May 1997

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.