The summed start-up costs in a unit commitment problem
We consider the sum of the incurred start-up costs of a single unit in a Unit Commitment problem. Our major result is a correspondence between the facets of its epigraph and some binary trees for concave start-up cost functions CU, which is bijective if CU is strictly concave. We derive an exponenti...
Guardado en:
Autores principales: | René Brandenberg, Matthias Huber, Matthias Silbernagl |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Elsevier
2017
|
Materias: | |
Acceso en línea: | https://doaj.org/article/81334a3e739a41808fcb7a90146d887d |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
por: C. Gentile, et al.
Publicado: (2017) -
Improving strong branching by domain propagation
por: Gerald Gamrath
Publicado: (2014) -
An exploratory computational analysis of dual degeneracy in mixed-integer programming
por: Gerald Gamrath, et al.
Publicado: (2020) -
Ten years of feasibility pump, and counting
por: Timo Berthold, et al.
Publicado: (2019) -
Bilevel programming for price-based electricity auctions: a revenue-constrained case
por: Ricardo Fernández-Blanco, et al.
Publicado: (2015)