- Full text PDF available (17)
- This year (2)
- Last 5 years (18)
- Last 10 years (21)
Journals and Conferences
This paper studies the problem of optimally placing large-scale energy storage in power grids with both conventional and wind generation. The solution technique for this infinite horizon problem assumes cyclic demand and generation profiles using a semidefinite relaxation of AC optimal power flow. Changes in storage allocation in the network are studied as… (More)
This paper proves that nonconvex quadratically constrained quadratic programs can be solved in polynomial time when their underlying graph is acyclic, provided the constraints satisfy a certain technical condition. We demonstrate this theory on optimal power-flow problems over tree networks.
A branch flow model has recently been proposed for the analysis and optimization of power flows. In this paper we show that the model is equivalent to the more popular bus injection model. Moreover, we prove the equivalence of various relaxations of these two models.
In this paper we quantify the total economic impact of an epidemic over a complex network using tools from random matrix theory. Incorporating the direct and indirect costs of infection, we calculate the disease cost in the large graph limit for an SIS (Susceptible – Infected – Susceptible) infection process. We also give an upper bound on this cost for… (More)
The optimal power flow (OPF) problem is critical to power system operation but it is generally non-convex and therefore hard to solve. Recently, a sufficient condition has been found under which OPF has zero duality gap, which means that its solution can be computed efficiently by solving the convex dual problem. In this paper we simplify this sufficient… (More)
We formulate the optimal placement, sizing and control of<lb>storage devices in a power network to minimize generation costs with<lb>the intent of load shifting. We assume deterministic demand, a linearized<lb>DC approximated power flow model and a fixed available storage budget.<lb>Our main result proves that when the generation costs are convex… (More)
We consider the problem of finding the minimum sampling frequency required for N non-overlapping, bandpass signals. Recently a novel algorithm with a significantly reduced computational cost has been proposed for this problem. By exploiting a redundancy in this algorithm, we propose a method which further reduces the cost significantly. We use the fact that… (More)
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 relaxation that computes a full matrix, a chordal relaxation based on a chordal extension of the network graph, and a… (More)
We study the role of a market maker (or market operator) in a transmission constrained electricity market. We model the market as a one-shot networked Cournot competition where generators supply quantity bids and load serving entities provide downward sloping inverse demand functions. This mimics the operation of a spot market in a deregulated market… (More)
Market power assessment is a prime concern when designing a deregulated electricity market. In this paper, we propose a new functional market power measure, termed transmission constrained network flow (TCNF), that unifies three large classes of long-term transmission constrained market power indices in the literature: residual supply based, network flow… (More)