DOE OSTI · 1821617
A Computationally Efficient Algorithm for Computing Convex Hull Prices
Abstract
Electricity markets worldwide allow participants to bid non-convex production offers. While non-convex offers can more accurately reflect a resource's capabilities, they create challenges for market clearing processes. For example, system operators may execute side payments when a participant’s cost is not covered through energy sale settlements from locational marginal pricing schemes, or when a participant incurs lost opportunity costs to follow the dispatch signal. Convex hull pricing minimizes these and other types of side payments while providing uniform (i.e., locationally and temporally consistent) prices. However, computing convex hull prices involves solving either a large-scale linear program - which in turn requires explicit descriptions of market participants’ convex hulls -or the Lagrangian dual of the corresponding non-convex scheduling problem. Here, we propose a computationally feasible and industrially scalable Benders decomposition approach to computing convex hull prices at least an order of magnitude faster than the current state-of-the-art while leveraging recent advances in convex hull formulations for thermal generating units.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Knueven, Bernard, Ostrowski, James, Castillo, Anya, Watson, Jean-Paul. 2021-09-20. A Computationally Efficient Algorithm for Computing Convex Hull Prices. https://searchnasa.com/record/osti%3A1821617/a-computationally-efficient-algorithm-for-computing-convex-hull-prices
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Search NASA by Indiciae: BibTeX · RIS.