DOE OSTI · 2572330
Near-Optimal Solutions for Day-Ahead Unit Commitment
Also available from
Abstract
Given the difficulty and the time pressure of solving unit commitment problems, near -optimal solutions (those with 0.1 or 0.001% optimality gaps) are often used in practice. The choice in which of the near -optimal solutions is used, however, is random. We investigate the impact of solution choice on the revenues obtained by generator owners across a variety of pricing schemes and problem instances.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Yang, Dominic, Knueven, Bernard, Watson, Jean-Paul, Ostrowski, James. 2024-09-01. Near-Optimal Solutions for Day-Ahead Unit Commitment. https://doi.org/10.1016/j.epsr.2024.110678
Cite the original work for its findings. Save a collection to share your selection of sources.