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

Short-term generation scheduling with transmission and environmental constraints using an augmented Lagrangian relaxation

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

5 Author(s)
Wang, S.J. ; Dept. of Electr. & Comput. Eng., Illinois Inst. of Technol., Chicago, IL, USA ; Shahidehpour, S.M. ; Kirschen, D.S. ; Mokhtari, S.
more authors

This paper proposes a new approach based on augmented Lagrangian relaxation for short term generation scheduling problems with transmission and environmental constraints. In this method, the power system constraints, e.g. load demand, spinning reserve, transmission capacity and environmental constraints, are relaxed by using Lagrangian multipliers, and quadratic penalty terms associated with power system load demand balance are added to the Lagrangian objective function. Then, the decomposition and coordination technique is used, and nonseparable quadratic penalty terms are replaced by linearization around the solution obtained from the previous iteration. In order to improve the convergence property, the exactly convex quadratic terms of decision variables are added to the objective function as strongly convex, differentiable and separable auxiliary functions. The overall problem is decomposed into N subproblems, multipliers and penalty coefficients are updated in the dual problem and power system constraints are satisfied iteratively. The corresponding unit commitment subproblems are solved by dynamic programming, and the economic dispatch with transmission and environmental constraints is solved by an efficient network flow programming algorithm. The augmented Lagrangian relaxation method enhanced by the decomposition and coordination techniques avoids oscillations associated with piece-wise linear cost functions. Numerical results indicate that the proposed approach is fast and efficient in dealing with numerous power system constraints

Published in:

Power Systems, IEEE Transactions on  (Volume:10 ,  Issue: 3 )

Date of Publication:

Aug 1995

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.