By Topic

Using integer programming to refine Lagrangian-based unit commitment solutions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Takriti, S. ; Dept. of Math. Sci., IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA ; Birge, J.R.

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

Published in:

Power Systems, IEEE Transactions on  (Volume:15 ,  Issue: 1 )