本文利用带上、下界的修正单纯形法,求解安全约束最优化问题之一的有功安全校正问题。
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.
本文利用带上、下界的修正单纯形法,求解安全约束最优化问题之一的有功安全校正问题。
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.
应用推荐