By Topic

The necessary and sufficient conditions for determining feasible solutions to unit commitment problems with ramping constraints

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 $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

3 Author(s)
Sangang Guo ; Syst. Eng. Inst., Xi'an Jiaotong Univ., China ; Xiaohong Guan ; Qiaozhu Zhai

It is difficult to determine if a feasible solution to unit commitment (UC) problem can be obtained by adjusting generation levels for the fixed commitment states. In this paper, a necessary and sufficient condition is developed to determine the feasibility of commitment states if the generation regions of the units with ramping constraints at each time period are known recursively before solving continuous economic dispatch problems. The condition is proved rigorously by applying the Benders decomposition feasibility theorem [Benders, JF 1962 and Geoffion AM 1972]. Based on this condition, an efficient method for solving UC problems with ramping constraints can be developed. Numerical test shows that the feasibility of commitment states can be determined very efficiently and effectively.

Published in:

IEEE Power Engineering Society General Meeting, 2005

Date of Conference:

12-16 June 2005