Skip to main content
Power Systems Computation Conference 2024

Proceedings of the 23rd Power Systems Computation Conference - PSCC 2024 »

View File
PDF
0.4MB

Near-Optimal Solutions for Day-Ahead Unit Commitment

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.

James Ostrowski
University of Tennessee
United States

Dominic Yang
UCLA
United States

Bernard Knueven
NREL
United States

Jean Paul Watson
LLNL
United States

 


Powered by OpenConf®
Copyright ©2002-2024 Zakon Group LLC