By Topic

Economic dispatch of active power with constraint 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 $31
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

2 Author(s)
Irving, M.R. ; University of Durham, Department of Engineering, Science Laboratories, Durham, UK ; Sterling, M.J.H.

The economic dispatch of active power in large-scale power systems is considered and an algorithm for the solution of the problem by means of the sparse dual revised Simplex method is presented. Computational experience with large-scale problems, including dynamic dispatch over several time steps, is given, which indicates that the method has very low memory and processor time requirements and is suitable for implementation on minicomputer systems. The algorithm is extended to allow for hierarchical constraint relaxation and removal in cases where an infeasible problem has been specified inadvertently. The availability of such a constraint relaxation strategy permits the application of approximate methods for the inclusion of transmission losses and spare capacity constraints.

Published in:

Generation, Transmission and Distribution, IEE Proceedings C  (Volume:130 ,  Issue: 4 )