相关论文: Branch Flow Model: Relaxations and Convexification…
This tutorial summarizes recent advances in the convex relaxation of the optimal power flow (OPF) problem, focusing on structural properties rather than algorithms. Part I presents two power flow models, formulates OPF and their relaxations…
Several convex relaxations of the optimal power flow (OPF) problem have recently been developed using both bus injection models and branch flow models. In this paper, we prove relations among three convex relaxations: a semidefinite…
We derive the branch ampacity constraint associated to power losses for the convex optimal power flow (OPF) model based on the branch flow formulation. The branch ampacity constraint derivation is motivated by the physical interpretation of…
This tutorial summarizes recent advances in the convex relaxation of the optimal power flow (OPF) problem, focusing on structural properties rather than algorithms. Part I presents two power flow models, formulates OPF and their relaxations…
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…
Convex relaxations of the AC Optimal Power Flow (OPF) problem are essential not only for identifying the globally optimal solution but also for enabling the use of OPF formulations in Bilevel Programming and Mathematical Programs with…
This paper develops a branch-flow based optimal power flow (OPF) problem for multi-phase distribution networks that allows for tap selection of wye, closed-delta, and open-delta step-voltage regulators (SVRs). SVRs are assumed ideal and…
The optimal power flow (OPF) problem determines power generation/demand that minimize a certain objective such as generation cost or power loss. It is nonconvex. We prove that, for radial networks, after shrinking its feasible set slightly,…
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…
Optimal Power Flow (OPF) can be modeled as a non-convex Quadratically Constrained Quadratic Program (QCQP). Our purpose is to solve OPF to global optimality. To this end, we specialize the Mixed-Integer Quadratic Convex Reformulation method…
The formulations and approximations of the branch flow model for mesh power networks (Mesh-BranchFlow) are given in this paper. Using different sets of the power flow equations, six formats of the exact Mesh-BranchFlow model are listed.…
To address computational challenges associated with power flow nonconvexities, significant research efforts over the last decade have developed convex relaxations and approximations of optimal power flow (OPF) problems. However, benefits…
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…
Optimal Power Flow (OPF) is an important tool used to coordinate assets in electric power systems to ensure customer voltages are within pre-defined tolerances and to improve distribution system operations. While convex relaxations of…
Optimal power flow (OPF) is a key problem in power system operations. OPF problems that use the nonlinear AC power flow equations to accurately model the network physics have inherent challenges associated with non-convexity. To address…
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…
The Optimal Power Flow (OPF) problem is integral to the functioning of power systems, aiming to optimize generation dispatch while adhering to technical and operational constraints. These constraints are far from straightforward; they…
Distribution networks are usually multiphase and radial. To facilitate power flow computation and optimization, two semidefinite programming (SDP) relaxations of the optimal power flow problem and a linear approximation of the power flow…
This letter investigates properties of the second-order cone relaxation of the optimal power flow (OPF) problem, with emphasis on relaxation tightness, nodal voltage angles recovery, and alternating-current-OPF feasibility in meshed…
The branch flow based optimal power flow(OPF) problem in radianlly operated distribution networks can be exactly relazed to a second order cone programming (SOCP) model without considering transformers. However, the introdution of nonlinear…