Using integer programming to refine Lagrangian-based unit commitment solutions

Abstract

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