A Solution of the Unit Commitment Problem Via Decomposition and Dynamic Programming

Each day power generating units have to be selected to realize a reliable production of electric energy with the fewest fuel costs. This paper proposes decomposition and dynamic programming as techniques for solving the unit commitment problem, a high- dimensional non-linear, mixed-integer optimization problem. Experiments indicate that the proposed methods locate in less time a better solution than many existing techniques.