A novel matching formulation for startup costs in unit commitment
| Autor: | Jean-Paul Watson, James Ostrowski, Bernard Knueven |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Matching (statistics)
Mathematical optimization 021103 operations research Linear programming Computer science Computation 0211 other engineering and technologies 010103 numerical & computational mathematics 02 engineering and technology 01 natural sciences Theoretical Computer Science Power system simulation Theory of computation 0101 mathematics Software |
| Zdroj: | Mathematical Programming Computation. 12:225-248 |
| ISSN: | 1867-2957 1867-2949 |
| Popis: | We present a novel formulation for startup cost computation in the unit commitment problem (UC). Both our proposed formulation and existing formulations in the literature are placed in a formal, theoretical dominance hierarchy based on their respective linear programming relaxations. Our proposed formulation is tested empirically against existing formulations on large-scale UC instances drawn from real-world data. While requiring more variables than the current state-of-the-art formulation, our proposed formulation requires fewer constraints, and is empirically demonstrated to be as tight as a perfect formulation for startup costs. This tightening can reduce the computational burden in comparison to existing formulations, especially for UC instances with large reserve margins and high penetration levels of renewables. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink