具有爬升约束机组组合的充分必要条件

在Lagrangian松弛框架下，很难确定机组组合问题的一个可行解是否可通过调整对偶机组组合而获得。对于具有爬升约束的机组组合调度问题来说，由于机组出力在连续的2个开机区间的耦合性，求解可行解就更困难。在Lagrangian松弛框架下，开发1个机组组合新方法的核心是如何获得1个可行的机组组合。文中采用Benders分解可行性条件严格证明了在给定时段，机组组合可行的充分必要条件：即在该时段一个相应于系统负载平衡约束和旋转各用约束的不等式组成立。该条件不需要求解经济分配问题，就可以判定机组组合的可行性。有了此条件，可在发电功率经济分配前知道机组组合是否可行，若不可行，则可通过调整机组组合状态而获得可行的组合。该条件对于构造一个求解机组组合问题的系统方法是重要且有效的。数值测试表明该条件是判定机组组合可行性的有效方法。

A NEW NECESSARY AND SUFFICIENT CONDITION FOR CHECKING FEASIBILITY OF A SOLUTION TO UNIT COMMITMENT PROBLEMS WITH RAMP RATE CONSTRAINTS

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 obtained from the dual solution using Lagrangian relaxation,especially for the cases where there exists ramping constraints coupling generation levels in consecutive hours.A new necessary and sufficient condition is presented in this paper to determine the feasible commitment states and is rigorously proved based on the Benders decomposition feasibility theorem.This condition is very important for developing an efficient method for obtaining feasible solutions to the UC problem with ramping constraints.