Related papers: On linear relaxations of OPF problems
We propose an approach to lifted approximate inference for first-order probabilistic models, such as Markov logic networks. It is based on performing exact lifted inference in a simplified first-order model, which is found by relaxing…
Recently, we proposed a class of inequalities called lifted bilinear cover inequalities, which are second-order cone representable convex inequalities, and are valid for a set described by a separable bilinear constraint together with…
We present here algorithms for efficient computation of linear algebra problems over finite fields.
We present a novel method for mixed-integer optimization problems with multivariate and Lipschitz continuous nonlinearities. In particular, we do not assume that the nonlinear constraints are explicitly given but that we can only evaluate…
A polynomial algorithm is obtained for the NP-complete linear ordering problem.
The exact solution of the Cauchy problem of the linear theory of elasticity is given in the paper, when the initial data belong to a specific class of functions.
We give an overview of new and existing cut- and flow-based ILP formulations for the two-stage stochastic Steiner tree problem and compare the strength of the LP relaxations.
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…
This paper focuses on the AC Optimal Power Flow (OPF) problem for multi-phase systems. Particular emphasis is given to systems with high integration of renewables, where adjustments of the real and reactive output powers from renewable…
A semidefinite programming (SDP) relaxation globally solves many optimal power flow (OPF) problems. For other OPF problems where the SDP relaxation only provides a lower bound on the objective value rather than the globally optimal decision…
Optimal power flow (OPF) is a central problem in the operation of electric power systems. An OPF problem optimizes a specified objective function subject to constraints imposed by both the non-linear power flow equations and engineering…
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 describe a technique to obtain linear descriptions for polytopes from extended formulations. The simple idea is to first define a suitable lifting function and then to find linear constraints that are valid for the polytope and guarantee…
We solve the bi-linear quantum oscillator H=v|p|+F|x| both quasi-classically and numerically.
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,…
The optimal power flow (OPF) problem is one of the most fundamental problems in power system operations. The non-linear alternating current (AC) power flow equations that model different physical laws (together with operational constraints)…
In this paper, we investigate optimal control problems governed by semilinear elliptic variational inequalities involving constraints on the state, and more precisely the obstacle problem. Since we adopt a numerical point of view, we first…
In this paper, we examine linear programming (LP) relaxations based on Bernstein polynomials for polynomial optimization problems (POPs). We present a progression of increasingly more precise LP relaxations based on expressing the given…
We prove an improved form of an expectation of Polya and discuss several related questions
We present a method for the resolution of (oscillatory) nonlinear problems. It is based on the application of the Linear Delta Expansion to the Lindstedt-Poincar\'e method. By applying it to the Duffing equation, we show that our method…