摘要
在应用内点法进行线性规划时,尚不能保证它的全面收敛性。提出了一种新的算法来求解无功线性优化问题。利用潮流雅可比矩阵直接变换求取灵敏度系数,建立无功优化线性规划模型,同时采用一种不可行内点算法来直接求解该问题。IEEE 14节点、30节点、57节点系统的计算结果表明,该算法能有效求解无功优化线性规划问题,同时在初始点的选择上不要求从内点启动,迭代收敛次数稳定,对计算系统的规模不敏感。
It cannot assure comprehensive convergence when applying interior point algorithm to solve linear programming problem. As to this problem, a novel method was proposed for reactive power optimization in power system. Jacobi matrix of power flow directly transformed into coefficient of sensitivity was employed to form linear programming model of reactive power optimization problem. Then an infeasible interior point algorithm was employed to solve linear programming model of reactive power optimization problem. Simulation results of respectively applying the proposed method to IEEE 14-bus system, 30-bus system as well as and 57-bus system show that this method can illustrates that the proposed strategy is effective, in addition, it is not required to select the initial point from the interior points, the iteration times can be remarkably reduced and convergence is stable.
出处
《中国电力》
CSCD
北大核心
2007年第2期19-21,共3页
Electric Power
关键词
无功优化
线性规划
不可行内点
步长
reactive power optimization
linear programming
infeasible-interior-point
pedometer