A Laplacian-Based Approach for Finding Near Globally Optimal Solutions to OPF Problems
IEEE Transactions on Power Systems(2017)
摘要
A semidefinite programming (SDP) relaxation globally solves many optimal power flow (OPF) problems. For other OPF problems where the SDP relaxation only provides a lower bound on the objective value rather than the globally optimal decision variables, recent literature has proposed a penalization approach to find feasible points that are often nearly globally optimal. A disadvantage of this penali...
更多查看译文
关键词
Linear programming,Reactive power,Mathematical model,Laplace equations,Optimization,Generators
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络