Related papers: Equivalent relaxations of optimal power flow
We consider the strictly correlated electron (SCE) limit of the fermionic quantum many-body problem in the second-quantized formalism. This limit gives rise to a multi-marginal optimal transport (MMOT) problem. Here the marginal state space…
Convex relaxations and approximations of the optimal power flow (OPF) problem have gained significant research and industrial interest for planning and operations in electric power networks. One approach for reducing their solve times is…
The Alternating Current Optimal Power Flow (ACOPF) problem remains one of the most fundamental yet computationally challenging tasks in power systems operation and planning due to its nonconvex, nonlinear, and multimodal nature. This paper…
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.…
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…
This paper proposes an input convex neural network (ICNN)-Assisted optimal power flow (OPF) in distribution networks. Instead of relying purely on optimization or machine learning, the ICNN-Assisted OPF is a combination of optimization and…
We first formulate the problem of optimally scheduling air traffic low with sector capacity constraints as a mixed integer linear program. We then use semidefinite relaxation techniques to form a convex relaxation of that problem. Finally,…
This two-part paper is concerned with the problem of minimizing a linear objective function subject to a bilinear matrix inequality (BMI) constraint. In this part, we first consider a family of convex relaxations which transform BMI…
This paper investigates the impact of the changes in the demand of power systems on the quality of the solution procured by the convex relaxation methods for the AC optimal power flow (ACOPF) problem. This investigation needs various…
With the potential to find global solutions, significant research interest has focused on convex relaxations of the non-convex OPF problem. Recently, "moment-based" relaxations from the Lasserre hierarchy for polynomial optimization have…
Linear approximations of the AC power flow equations are of great significance for the computational efficiency of large-scale optimal power flow (OPF) problems. Put differently, the feasibility of the obtained solution is essential for…
This paper proposes a two-level distributed algorithmic framework for solving the AC optimal power flow (OPF) problem with convergence guarantees. The presence of highly nonconvex constraints in OPF poses significant challenges to…
This paper presents a method to obtain a convex inner approximation that aims to improve the feasibility of optimal power flow (OPF) models in distribution feeders. For a resistive distribution network, both real and reactive power effect…
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…
In this note we introduce a new model for the mailing problem in branched transportation in order to allow the cost functional to take into account the orientation of the moving particles. This gives an effective answer to [Problem 15.9] of…
The existence of strictly positive lower bounds on voltage magnitude is taken for granted in optimal power flow problems. Nevertheless, it is not possible to rely on such bounds for a variety of real-world network optimization problems.…
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…
This paper proposes a component-based dual decomposition of the nonconvex AC optimal power flow (OPF) problem, where the modified dual function is solved in a distributed fashion. The main contribution of this work is that is demonstrates…
Linear optimal power flow (LOPF) algorithms use a linearization of the alternating current (AC) load flow equations to optimize generator dispatch in a network subject to the loading constraints of the network branches. Common algorithms…
The affine inverse eigenvalue problem consists of identifying a real symmetric matrix with a prescribed set of eigenvalues in an affine space. Due to its ubiquity in applications, various instances of the problem have been widely studied in…