Lagrangian Reduction of Search-Range for Large-Scale Unit Commitment

This paper is concerned with the thermal unit commitment problem for Large-Scale Power Systems. A new approach capable of producing low-cost solutions in relatively short execution times is presented. The proposed technique applies Dynamic Programming in successive approximations. A reduced search-range is determined for each successive iteration by means of a Lagrangian technique. Results are given and discused for very large and complex unit commitment problems.