We develop a technique for refining the unit commitment solution obtained f
rom solving the Lagrangian. Our model is an integer program with nonlinear
constraints. It can be solved to optimality using branch-and-bound. Numeric
al results indicate a significant improvement in the quality of the solutio
n obtained.