本文利用带上、下界的修正单纯形法，求解安全约束最优化问题之一的有功安全校正问题。
In this paper, a revised simplex algorithm with lower and upper bounds is used for solving the problem of active power security control which is one kind of the security constrained optimization.
第一步不考虑变量的整数约束，用修正单纯形法求解，由此可确定一部分线路是否需要建设。
The revised simplex method is used at first to calculate the optimal line extensions without integer constraints of the variables so that it can be determined which lines should be constructed.
应用推荐