Moment-Based Relaxation of the Optimal Power Flow Problem
Preprint
Abstract
The optimal power flow (OPF) problem minimizes power system operating cost subject to both engineering and network constraints. With the potential to find global solutions, significant research interest has focused on convex relaxations of the non-convex AC OPF problem. This paper investigates ``moment-based'' relaxations of the OPF problem developed from the theory of polynomial optimization problems. At the cost of increased computational requirements, moment-based relaxations are generally tighter than the semidefinite relaxation employed in previous research, thus resulting in global solutions for a broader class of OPF problems. Exploration of the feasible space for test systems illustrates the effectiveness of the moment-based relaxation.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- A rank minimization algorithm to enhance semidefinite relaxations of Optimal Power Flow2013
- Local Solutions of the Optimal Power Flow ProblemIEEE Transactions on Power Systems, 2013
- Convex relaxation of optimal power flow: A tutorial2013
- Implementation of a Large-Scale Optimal Power Flow Solver Based on Semidefinite ProgrammingIEEE Transactions on Power Systems, 2013
- Examining the limits of the application of semidefinite programming to power flow problems2011
- Zero Duality Gap in Optimal Power Flow ProblemIEEE Transactions on Power Systems, 2011
- MATPOWER: Steady-State Operations, Planning, and Analysis Tools for Power Systems Research and EducationIEEE Transactions on Power Systems, 2010
- Convexity of the Set of Feasible Injections and Revenue Adequacy in FTR MarketsIEEE Transactions on Power Systems, 2005
- YALMIP : a toolbox for modeling and optimization in MATLAB2005
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric conesOptimization Methods and Software, 1999