Solution of Optimal Power Flow Problems using Moment Relaxations Augmented with Objective Function Penalization
arXiv:1508.05037 · doi:10.1109/CDC.2015.7402083
Abstract
The optimal power flow (OPF) problem minimizes the operating cost of an electric power system. Applications of convex relaxation techniques to the non-convex OPF problem have been of recent interest, including work using the Lasserre hierarchy of "moment" relaxations to globally solve many OPF problems. By preprocessing the network model to eliminate low-impedance lines, this paper demonstrates the capability of the moment relaxations to globally solve large OPF problems that minimize active power losses for portions of several European power systems. Large problems with more general objective functions have thus far been computationally intractable for current formulations of the moment relaxations. To overcome this limitation, this paper proposes the combination of an objective function penalization with the moment relaxations. This combination yields feasible points with objective function values that are close to the global optimum of several large OPF problems. Compared to an existing penalization method, the combination of penalization and the moment relaxations eliminates the need to specify one of the penalty parameters and solves a broader class of problems.
8 pages, 1 figure, to appear in IEEE 54th Annual Conference on Decision and Control (CDC), 15-18 December 2015
Cited by in corpus (6)
- AC Power Flow Data in MATPOWER and QCQP Format: iTesla, RTE Snapshots, and PEGASE
- Convex Relaxations of Optimal Power Flow Problems: An Illustrative Example
- Recent Advances in Computational Methods for the Power Flow Equations
- Moment/Sum-of-Squares Hierarchy for Complex Polynomial Optimization
- Computational Analysis of Sparsity-Exploiting Moment Relaxations of the OPF Problem
- A Laplacian-Based Approach for Finding Near Globally Optimal Solutions to OPF Problems