Optimal Short-Term Scheduling of Large-Scale Power Systems

Dimitri P. Bertsekas, Gregory S. Lauer, Nils R. Sandell, Thomas A. Posbergh

Research output: Contribution to journalArticlepeer-review

144 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)1-11
Number of pages11
JournalIEEE Transactions on Automatic Control
Issue number1
StatePublished - Jan 1983


Dive into the research topics of 'Optimal Short-Term Scheduling of Large-Scale Power Systems'. Together they form a unique fingerprint.

Cite this