摘要
水电系统优化运行问题可表达为一非线性网络流问题，既约梯度网流法是求解该问题的常用方法，但在实际应用中，经常会出现“基变量达界后，找不到新的入基变量”的情况，使算法无法进行下去。文章分析了造成这一情况的原因，并给出了一种新的非线性最小费用循环流算法。该算法能避免发生上述情况，且具有计算速度快，收敛性好等特点，是求解水电系统优化运行问题的有效方法。实际算例也表明，该算法是实用和有效的。
Reduced gradient network flow algorithm(RGNFA) is often used to solve hydro subproblem. However, new base variables can often not be found when base variables have reached boundaries in practical applications, thus RGNFA is nullified. The reasons causing the above problem are analyzed, and a novel nonlinear minimum cost cycle flow algorithm is presented. Calculation results show that this algorithm is practical and effective.
出处
《电网技术》
EI
CSCD
北大核心
1999年第10期41-44,共4页
Power System Technology
关键词
电力系统
经济运行
网络流
最小费用循环流
economic operations
network flow
minimum cost cycle flow algorithm
reduced gradient network flow algorithm
