Near-Optimal Solutions for Day-Ahead Unit Commitment: Article No. 110678

Dominic Yang, Bernard Knueven, Jean-Paul Watson, James Ostrowski

Research output: Contribution to journalArticlepeer-review

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.
Original languageAmerican English
Number of pages7
JournalElectric Power Systems Research
Volume234
DOIs
StatePublished - 2024

NREL Publication Number

  • NREL/JA-2C00-90475

Keywords

  • market-clearing
  • mixed-integer linear programming (MILP)
  • symmetry
  • unit commitment (UC)

Fingerprint

Dive into the research topics of 'Near-Optimal Solutions for Day-Ahead Unit Commitment: Article No. 110678'. Together they form a unique fingerprint.

Cite this