optimal power flow;
convex relaxation condition;
dispatching;
power grid;
branch flow model;
D O I:
暂无
中图分类号:
TM [电工技术];
TN [电子技术、通信技术];
学科分类号:
0808 ;
0809 ;
摘要:
Branch flow model is a scheduling model considering power flow. It is nonconvex and NP-hard. In order to solve the model quickly and convergently, we can relax the model into a convex optimization model by using the convex relaxation strategy. In this paper, we propose that under certain conditions, the two models before and after convex relaxation can be guaranteed to have the same optimal solution. So we can solve the convex optimization model which is easier to solve.
机构:
Electrical and Computer Engineering Department,San Diego State UniversityElectrical and Computer Engineering Department,San Diego State University
Saeed D.MANSHADI
Guangyi LIU
论文数: 0引用数: 0
h-index: 0
机构:
Global Energy Interconnection Research Institute North AmericaElectrical and Computer Engineering Department,San Diego State University
Guangyi LIU
Mohammad E.KHODAYAR
论文数: 0引用数: 0
h-index: 0
机构:
Department of Electrical and Computer Engineering,Southern Methodist UniversityElectrical and Computer Engineering Department,San Diego State University
Mohammad E.KHODAYAR
Jianhui WANG
论文数: 0引用数: 0
h-index: 0
机构:
Department of Electrical and Computer Engineering,Southern Methodist UniversityElectrical and Computer Engineering Department,San Diego State University
Jianhui WANG
Renchang DAI
论文数: 0引用数: 0
h-index: 0
机构:
Global Energy Interconnection Research Institute North AmericaElectrical and Computer Engineering Department,San Diego State University