Related papers: Improving Optimal Power Flow Relaxations Using 3-C…
Convex relaxations of non-convex optimal power flow (OPF) problems have recently attracted significant interest. While existing relaxations globally solve many OPF problems, there are practical problems for which existing relaxations fail…
AC optimal power flow (AC OPF) is a fundamental problem in power system operations. Accurately modeling the network physics via the AC power flow equations makes AC OPF a challenging nonconvex problem. To search for global optima, recent…
Optimal power flow (OPF) over power transmission networks poses challenging large-scale nonlinear optimization problems, which involve a large number of quadratic equality and indefinite quadratic inequality constraints. These…
Higher levels of renewable electricity generation increase uncertainty in power system operation. To ensure secure system operation, new tools that account for this uncertainty are required. In this paper, we formulate a chance-constrained…
The Optimal Power Flow (OPF) problem can be reformulated as a nonconvex Quadratically Constrained Quadratic Program (QCQP). There is a growing body of work on the use of semidefinite programming relaxations to solve OPF. The relaxation is…
This paper presents a scalable method for improving the solutions of AC Optimal Power Flow (AC OPF) with respect to deviations in predicted power injections from wind and other uncertain generation resources. The focus of the paper is on…
The second-order cone plays an important role in convex optimization and has strong expressive abilities despite its apparent simplicity. Second-order cone formulations can also be solved more efficiently than semidefinite programming in…
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…
Quantum Max Cut (QMC), also known as the quantum anti-ferromagnetic Heisenberg model, is a QMA-complete problem relevant to quantum many-body physics and computer science. Semidefinite programming relaxations have been fruitful in designing…
This paper proposes a set of closed-form conditions to ensure the strong duality of second-order cone program (SOCP) formulation for AC power flow in radial power networks. In addition, numerical evaluations on IEEE 33-bus test networks and…
In this paper, we propose some new semidefinite relaxations for a class of nonconvex complex quadratic programming problems, which widely appear in the areas of signal processing and power system. By deriving new valid constraints to the…
The integration of large-scale renewable energy sources, such as wind power, poses significant challenges for the optimal operation of power systems owing to their inherent uncertainties. This paper proposes a solution framework for…
Exact Second Order Conic Programming (SOCP) formulation of AC Optimal Power Flow (ACOPF) consists of non-convex arctangent constraints. Generally, these constraints have been ignored or approximated (at the expense of increased…
Recently, there has been significant interest in convex relaxations of the optimal power flow (OPF) problem. A semidefinite programming (SDP) relaxation globally solves many OPF problems. However, there exist practical problems for which…
We propose a branch flow model for the anal- ysis and optimization of mesh as well as radial networks. The model leads to a new approach to solving optimal power flow (OPF) that consists of two relaxation steps. The first step eliminates…
Convex relaxation methods have been studied and used extensively to obtain an optimal solution to the optimal power flow (OPF) problem. Meanwhile, convex relaxed power flow equations are also prerequisites for efficiently solving a wide…
Flexible transmission line impedances on one hand are a promising control resource for facilitating grid flexibility, but on the other hand add much complexity to the concerned optimization problems. This paper develops a convexification…
The pooling problem is an important industrial problem in the class of network flow problems for allocating gas flow in pipeline transportation networks. For P-formulation of the pooling problem with time discretization, we propose second…
We present a pure linear cutting-plane relaxation approach for rapidly proving tight and accurate lower bounds for the Alternating Current Optimal Power Flow Problem (ACOPF) and its multi-period extension with ramping constraints. Our…
Semidefinite programming (SDP) is widely acknowledged as one of the most effective methods for deriving the tightest lower bounds of the optimal power flow (OPF) problems. In this paper, an enhanced semidefinite relaxation model that…