摘要
介绍了网络流规划的基本概念、原始对偶法和原始单纯形法竞价模型及算法 ,讨论了网络流规划法处理机组启停时间约束、升降功率速度约束、发电量约束和网络安全约束的模型。网络流规划法计算原理符合市场操作过程 ,容易解决竞价中关于时间耦合的约束和网络安全的约束 。
The basic concept of the network flow programming (NFP) method including the model and algorithm for dual-NFP and simplex-NFP in the generation bidding is introduced firstly. Then, the models of start-off constraints, speeds of increasing and decreasing generation load constraints, maximum and minimum generation limit constraints and network security constraints handled by the NFP method are discussed. It comes to the conclusion that the NFP is in accordance with the operation process of power market and can easily deal with constraints of time coupling and network security. Hopefully, it has been one of the most promising generation bidding algorithms up to now.
出处
《电力系统自动化》
EI
CSCD
北大核心
2001年第7期23-27,共5页
Automation of Electric Power Systems
