Related papers: Approximations for Generalized Unsplittable Flow o…
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…
Optimal Power Flow (OPF) refers to a wide range of related optimization problems with the goal of operating power systems efficiently and securely. In the simplest setting, OPF determines how much power to generate in order to minimize…
Alternating-Current Optimal Power Flow (AC-OPF) is framed as a NP-hard non-convex optimization problem that solves for the most economical dispatch of grid generation given the AC-network and device constraints. Although there are no…
Traditional optimal power flow (OPF) describes the system performance only in a single snapshot while the resulting decisions are applied to an entire time period. Therefore, how well the selected snapshot can represent the entire time…
We propose a GPU accelerated proximal message passing algorithm for solving contingency-constrained DC optimal power flow problems (OPF). We consider a highly general formulation of OPF that uses a sparse device-node model and supports a…
We consider the numerical approximation of compressible flow in a pipe network. Appropriate coupling conditions are formulated that allow us to derive a variational characterization of solutions and to prove global balance laws for the…
We propose an algorithm for solving the time-dependent shortest path problem in flow fields where the FIFO (first-in-first-out) assumption is violated. This problem variant is important for autonomous vehicles in the ocean, for example,…
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…
In this work, we consider two-stage quadratic optimization problems under ellipsoidal uncertainty. In the first stage, one needs to decide upon the values of a subset of optimization variables (control variables). In the second stage, the…
In this paper, we propose a general framework to design {efficient} polynomial time approximation schemes (EPTAS) for fundamental stochastic combinatorial optimization problems. Given an error parameter $\epsilon>0$, such algorithmic…
The large-scale integration of renewable energy sources introduces significant operational uncertainty into power systems. Although Polynomial Chaos Expansion (PCE) provides an efficient tool for uncertainty quantification (UQ) in power…
Stepwise controllable devices, such as switched capacitors or stepwise controllable loads and generators, transform the nonconvex AC optimal power flow (AC-OPF) problem into a nonconvex mixed-integer (MI) programming problem which is…
The optimal power flow (OPF) problem is fundamental in power system operations and planning. Large-scale renewable penetration in distribution networks calls for real-time feedback control, and hence the need for fast and distributed…
The Unit Commitment problem with AC power flow constraints (UC-ACOPF) is a non-convex mixed-integer nonlinear programming (MINLP) problem encountered in power systems. Its combination of combinatorial complexity and non-convex nonlinear…
DC power flow approximations are ubiquitous in the electricity industry. However, these linear approximations fail to capture important physical aspects of power flow, such as the reactive power and voltage magnitude, which are crucial in…
We give an $\widetilde{O}({m^{3/2 - 1/762} \log (U+W))}$ time algorithm for minimum cost flow with capacities bounded by $U$ and costs bounded by $W$. For sparse graphs with general capacities, this is the first algorithm to improve over…
Unit Commitment (UC) and Optimal Power Flow (OPF) are two fundamental problems in short-term electric power systems planning that are traditionally solved sequentially. The state-of-the-art mostly uses a direct current flow approximation of…
We present faster algorithms for approximate maximum flow in undirected graphs with good separator structures, such as bounded genus, minor free, and geometric graphs. Given such a graph with $n$ vertices, $m$ edges along with a recursive…
The AC Optimal Power Flow (AC-OPF) is a key building block in many power system applications. It determines generator setpoints at minimal cost that meet the power demands while satisfying the underlying physical and operational…
We consider the classic scheduling problem of minimizing the total weighted flow-time on a single machine (min-WPFT), when preemption is allowed. In this problem, we are given a set of $n$ jobs, each job having a release time $r_j$, a…