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

25 卷 24 期 中 国 电 机 工 程 学 报 Vol.25 No.24 Dec. 2005 2005 年12 月 Proceedings of the CSEE 2005 Chin.Soc.for Elec.Eng. 文章编号：0258-8013 （2005 ）24-0014-06 中图分类号：TM311 文献标识码：A 学科分类号：47040 具有爬升约束机组组合的充分必要条件 郭三刚，管晓宏，翟桥柱 （西安交通大学系制造系统工程国家重点实验室，陕西省西安市 710049 ） A NEW NECESSARY AND SUFFICIENT CONDITION FOR CHECKING FEASIBILITY OF A SOLUTION TO UNIT COMMITMENT PROBLEMS WITH RAMP RATE CONSTRAINTS Guo San-gang, Guan Xiao-hong, Zhai Qiao-zhu ( SKLMSE Lab, Xi’an Jiaotong University, Xi’an 710049, Shaanxi, China) ABSTRACT: 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 关键词：电力系统；机组组合；爬升约束；Lagrangian 松弛； sufficient condition is presented in this paper to determine the Benders 分解可行性定理； feasible commitment states and is rigorously proved based on 1 引言 the Benders decomposition feasibility theorem. This condition is very important for developing an efficient method for 因机组组合(UC) 问题是数学上的 NP-Hard 难 obtaining feasible solutions to the UC problem with ramping 问题，故对于大型的电力系统调度问题，在可接受 constraints.