About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
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.