Modeling and computing two-settlement oligopolistic equilibrium in a congested electricity network (2008)
| Venue: | Operations Research |
| Citations: | 5 - 2 self |
BibTeX
@ARTICLE{Yao08modelingand,
author = {Jian Yao and Ilan Adler and Shmuel S. Oren},
title = {Modeling and computing two-settlement oligopolistic equilibrium in a congested electricity network},
journal = {Operations Research},
year = {2008},
pages = {3447}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A model of two-settlement electricity markets is introduced, which accounts for flow congestion, demand uncertainty, system contingencies and market power. We formulate the subgame perfect Nash equilibrium for this model as an equilibrium problem with equilibrium constraints (EPEC), in which each firm solves a mathematical program with equilibrium constraints (MPEC). The model assumes linear demand functions, quadratic generation cost functions and a lossless DC network, resulting in equilibrium constraints as a parametric linear complementarity problem (LCP). We introduce an iterative procedure for solving this EPEC through repeated application of an MPEC algorithm. This MPEC algorithm is based on solving quadratic programming sub-problems and on parametric LCP pivoting. Numerical examples demonstrate the effectiveness of the MPEC and EPEC algorithms and the tractability of the model for realistic size power systems. 1
