.png){kind=icon}
返回
Semidefinite programming for optimal power flow problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ijepes.2007.12.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a new solution using the semidefinite programming (SDP) technique to solve the optimal power flow problems (OPF). The proposed method involves reformulating the OPF problems into a SDP model and developing an algorithm of interior point method (IPM) for SDP. That is said, OPF in a nonlinear programming (NP) model, which is a nonconvex problem, has been accurately transformed into a SDP model which is a convex problem. Based on SDP, the OPF problem can be solved by primal-dual interior point algorithms which possess superlinear convergence. The proposed method has been tested with four kinds of objective functions of OPF. Extensive numerical simulations on test systems with sizes ranging from 4 to 300 buses have shown that this method is promising for OPF problems due to its robustness. (C) 2008 Published by Elsevier Ltd.
Keyword:
optimal power flow
interior point method
semidefinite programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
5
论文数:
1.1W
被引数:
3.1W
机构
引用论文
.png){kind=icon}
Dynamical Cluster Approximation in Disordered Systems with Magnetic Impurities具有磁性杂质的无序系统中的动力学簇近似
PREAI
分享收藏An interior point nonlinear programming for optimal power flow problems with a novel data structure
PREAI
分享收藏
查看更多内容