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

Short-term scheduling of a pumped storage plant

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

1 Author(s)
Ferreira, L.A.F.M. ; Dept. of Electr. Eng. & Comput., Inst. Superior Tecnico, Lisbon, Portugal

The problem is formulated as a mixed-integer nonlinear program where the prices of energy and spinning capacity are assumed known and where two kinds of constraints are considered: first dynamic plant constraints, concerning the operation of several units and including startup costs and minimum up time requirements, and secondly dynamic reservoir constraints, concerning the operation of the upper and lower reservoirs within specified levels. The consideration of dynamic plant constraints together with dynamic reservoir constraints has never been attempted. It is an extended problem and its solution is difficult to approach. Approaches based on dynamic programming, Lagrangian duality and network flow programming are analysed in view of the extended problem and their advantages and disadvantages are indicated. To bridge the gap between the application range of the programming techniques to this problem of pumped storage scheduling, approximate assumptions and a new approach are proposed

Published in:

Generation, Transmission and Distribution, IEE Proceedings C  (Volume:139 ,  Issue: 6 )

Date of Publication:

Nov 1992

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.