论文摘要
A solution to the power flow problem is imperative for many power system applications and several iterative approaches are employed to achieve this objective.However,the chance of finding a solution is dependent on the choice of the initial point because of the nonconvex feasibility region of this problem.In this paper,a non-iterative approach that leverages a convexified relaxed power flow problem is employed to verify the existence of a feasible solution.To ensure the scalability of the proposed convex relaxation,the problem is formulated as a sparse semi-definite programming problem.The variables associated with each maximal clique within the network form several positive semidefinite matrices.Perturbation and network reconfiguration schemes are employed to improve the tightness of the proposed convex relaxation in order to validate the existence of a feasible solution for the original non-convex problem.Multiple case studies including an ill-conditioned power flow problem are examined to show the effectiveness of the proposed approach to find a feasible solution.
论文目录
文章来源
类型: 期刊论文
作者: Saeed D.MANSHADI,Guangyi LIU,Mohammad E.KHODAYAR,Jianhui WANG,Renchang DAI
来源: Journal of Modern Power Systems and Clean Energy 2019年06期
年度: 2019
分类: 工程科技Ⅱ辑
专业: 电力工业
单位: Electrical and Computer Engineering Department,San Diego State University,Global Energy Interconnection Research Institute North America,Department of Electrical and Computer Engineering,Southern Methodist University
基金: supported by Technology Project of State Grid Corporation of China (No. SGRIJSKJ(2016)800)
分类号: TM744
页码: 1399-1410
总页数: 12
文件大小: 3657K
下载量: 5