Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Optimal short-term scheduling of large-scale power systems

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.

The purchase and pricing options are temporarily unavailable. Please try again later.
4 Author(s)
Bertsekas, Dimitri ; Massachusetts Institute of Technology, Cambridge, MA, USA ; Lauer, G. ; Sandell, N., Jr. ; Posbergh, Thomas A.

This paper is concerned with the longstanding problem of optimal unit commitment in an electric power system. We follow the traditional formulation of this problem which gives rise to a large-scale, dynamic, mixed-integer programming problem. We describe a solution methodology based on duality, Lagrangian relaxation, and nondifferentiable optimization that has two unique features. First, computational requirements typically grow only linearly with the number of generating units. Second, the duality gap decreases in relative terms as the number of units increases, and as a result our algorithm tends to actually perform better for problems of large size. This allows for the first time consistently reliable solution of large practical problems involving several hundreds of units within realistic time constraints. Aside from the unit commitment problem, this methodology, is applicable to a broad class of large-scale dynamic scheduling and resource allocation problems involving integer variables.

Published in:

Automatic Control, IEEE Transactions on  (Volume:28 ,  Issue: 1 )