By Topic

Combination of Lagrangian-relaxation and linear-programming approaches for fuel-constrained unit-commitment problems

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
$33 $33
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)
S. K. Tong ; Dept. of Electr. & Comput. Eng., Illinois Inst. of Technol., Chicago, IL, USA ; S. M. Shahidehpour

The authors present a new method for determining the unit-commitment schedule of a power system which operates under fuel utilisation constraints. The proposed method employs the Lagrangian relaxation approach to determine a feasible suboptimal schedule. Then, linear programming is applied to improve the feasible solution, as well as seeking the optimal economic dispatch of the committed generators. The algorithm is implemented on a VAX11/780 machine to solve the unit-commitment problem of a system which consists of 26 thermal units and 6 fuel-constrained units. Numerical results presented in this paper describe the usefulness and practicality of the proposed method.<>

Published in:

IEE Proceedings C - Generation, Transmission and Distribution  (Volume:136 ,  Issue: 3 )