A Branch-and-Bound Algorithm for Unit Commitment

A new approach is presented for solving the unit commitment problem based on branch-and-bound techniques. The method incorporates time-dependent start-up costs, demand and reserve constraints and minimum up and down time constraints. It does not require a priority ordering of the units. The method can be extended to allow for a probabilistic reserve constraint. Preliminary computational results are reported.