Related papers: A Dynamic Relaxation Framework for Global Solution…
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…
The recent literature has discussed the use of the relaxed Second Order Cone Programming (SOCP) to formulate Optimal Power Flow problems (OPF) for radial power grids. However, if the shunt parameters of the lines, composing the power grid,…
In this paper, we consider the optimal power flow (OPF) problem which consists in determining the power production at each bus of an electric network by minimizing the production cost. Our contribution is an exact solution algorithm for the…
The classical alternating current optimal power flow problem is highly nonconvex and generally hard to solve. Convex relaxations, in particular semidefinite, second-order cone, convex quadratic, and linear relaxations, have recently…
We present a decomposition approach for obtaining good feasible solutions for the security-constrained alternating-current optimal power flow (SCACOPF) problem at an industrial scale and under real-world time and computational limits. The…
Convex relaxations of the optimal power flow (OPF) problem provide an efficient alternative to solving the intractable alternating current (AC) optimal power flow. The conic subset of OPF convex relaxations, in particular, greatly…
The use of convex relaxations has lately gained considerable interest in Power Systems. These relaxations play a major role in providing global optimality guarantees for non-convex optimization problems. For the Optimal Power Flow (OPF)…
Convex relaxations of the power flow equations and, in particular, the Semi-Definite Programming (SDP) and Second-Order Cone (SOC) relaxations, have attracted significant interest in recent years. The Quadratic Convex (QC) relaxation is a…
In this paper, we show that the standard semidefinite programming (SDP) relaxation of altering current optimal power flow (AC OPF) can be equivalently reformulated as second-order cone programming (SOCP) relaxation with maximal clique- and…
This paper develops a novel second order cone relaxation of the semidefinite programming formulation of optimal power flow, that does not imply the `angle relaxation'. We build on a technique developed by Kim et al., extend it for complex…
We consider a robust optimization problem in an electric power system under uncertain demand and availability of renewable energy resources. Solving the deterministic alternating current optimal power flow (ACOPF) problem has been…
Nonlinear convex relaxations of the power flow equations and, in particular, the Semi-Definite Programming (SDP), Convex Quadratic (QC), and Second-Order Cone (SOC) relaxations, have attracted significant interest in recent years. Thus far,…
In this paper, we present new convex relaxations for nonconvex quadratically constrained quadratic programming (QCQP) problems. While recent research has focused on strengthening convex relaxations using reformulation-linearization…
Optimal power flow (OPF) is an important problem in the operation of electric power systems. Due to the OPF problem's non-convexity, there may exist multiple local optima. Certifiably obtaining the global solution is important for certain…
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…
We demonstrate that valid inequalities, or lifted nonlinear cuts (LNC), can be projected to tighten the Second Order Cone (SOC), Convex DistFlow (CDF), and Network Flow (NF) relaxations of the AC Optimal Power Flow (AC-OPF) problem. We…
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…
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…
Optimal power flow (OPF) problem is a class of large-scale and non-convex optimization problem. Various algorithms are proposed to solve the challenging OPF problem. Recent studies show that semidefinite programming (SDP) can either provide…
The optimal power flow (OPF) problem seeks to control power generation/demand to optimize certain objectives such as minimizing the generation cost or power loss in the network. It is becoming increasingly important for distribution…