Generating Unit Commitment by Dynamic Programming

1 May 1966

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Apparatus and Systems

Vol. PAS-85 (5) , 422-426
https://doi.org/10.1109/tpas.1966.291679

Abstract

The objective of this study was to determine the feasibility of using Dynamic Programming1 to solve the generating unit commitment problem. The main difficulty connected with this problem, is that factorial N, a large number for even a relatively small N, plays a central role in any straightforward formulation of the problem.

Keywords

DYNAMIC PROGRAMMING
COSTS
POWER SYSTEMS
POWER INDUSTRY
FUELS
POWER ENGINEERING AND ENERGY
SYSTEMS ENGINEERING AND THEORY
PRINTING
POWER GENERATION