By Topic

Economic dispatch with network and ramping constraints via interior point methods

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
$33 $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)
G. Irisarri ; Open Access Technol. Int., Minneapolis, MN, USA ; L. M. Kimball ; K. A. Clements ; A. Bagchi
more authors

The authors describe an approach to the economic dispatch problem that combines both time-separated constraints (e.g., demand and network flow) and inter-temporal constraints (e.g., ramping) into a single optimization problem that can be solved efficiently by interior point methods. By including generator ramping limits as well as network line flow constraints, both economic and security issues are treated simultaneously, avoiding ad hoc post processing. They present several test cases, including dispatching six generators on the IEEE 30-bus network over 168 hours with line flow and ramping constraints. Computational effort as measured by iteration counts or execution time (CPU sees) varies only modestly with problem size

Published in:

IEEE Transactions on Power Systems  (Volume:13 ,  Issue: 1 )