Title :
Using integer programming to refine Lagrangian-based unit commitment solutions
Author :
Takriti, Samer ; Birge, John R.
Author_Institution :
Dept. of Math. Sci., IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
fDate :
2/1/2000 12:00:00 AM
Abstract :
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
Keywords :
integer programming; power generation dispatch; power generation planning; power generation scheduling; tree searching; Lagrangian-based unit commitment solutions refinement; branch-and-bound technique; computer simulation; integer programming; nonlinear constraints; optimality; solution quality; Dynamic programming; Lagrangian functions; Linear programming; Optimal scheduling; Power generation; Power industry; Production; Uncertainty;
Journal_Title :
Power Systems, IEEE Transactions on
