摘要
提出了一种采用内点割平面法求解混合整数最优潮流(OPF)的算法。该算法循环执行3个步骤:①求解OPF的可行解并将其线性化;②从线性内点法的最优解中判断基变量;③根据基变量产生混合整数割平面。与单纯形割平面法相比,内点割平面法不仅简单易实现,计算效率高,而且随着问题规模的增加,更能发挥其多项式时间特性的优点。文中还对退化问题的处理以及稀疏技巧的应用进行了深入的讨论。通过对IEEE典型系统的数值仿真计算显示出所提算法对于大型电力系统最优潮流问题的精确求解是非常有效的。
A new algorithm is presented in this paper to solve Mixed Integer Optimal Power Flow(OPF) problem by Interior Point Cutting Plane Method(IPCPM). The proposed algorithm repeatedly runs the following steps: (1) linearizing OPF problem at its feasible solution; (2) identifying the basis variables in interior point method (3) generating mixed integer cutting plane relied on these basis variables. Compared with Simplex Cutting Plane Method (SCPM), IPCPM is simpler, and during the scale of system becoming larger and larger, it is more efficient because of its polynomial-time characteristic. At the same time, the settlement of degenerated problem and the application of sparsity technique are discussed in details. Numerical simulations on IEEE test systems have shown that the proposed method is efficient in solving OPF problems for large-scale power systems.
出处
《中国电机工程学报》
EI
CSCD
北大核心
2004年第2期1-7,共7页
Proceedings of the CSEE
基金
国家自然科学基金重点项目(59937150)
教育部博士点基金项目(1999069801)~~
