A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
This paper provides the convex hull description of the single thermal Unit Commitment (UC) problem with the following basic operating constraints: (1) generation limits, (2) start-up and shut-down capabilities, and (3) minimum up and down times. The proposed constraints can be used as the core of an...
Guardado en:
Autores principales: | C. Gentile, G. Morales-España, A. Ramos |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Elsevier
2017
|
Materias: | |
Acceso en línea: | https://doaj.org/article/20335874ad3a49febec2eb25b8665fe8 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Tighter MIP formulations for the discretised unit commitment problem with min-stop ramping constraints
por: Nicolas Dupin
Publicado: (2017) -
Formulations and algorithms for the recoverable Γ-robust knapsack problem
por: Christina Büsing, et al.
Publicado: (2019) -
The summed start-up costs in a unit commitment problem
por: René Brandenberg, et al.
Publicado: (2017) -
Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
por: Thais Ávila, et al.
Publicado: (2017) -
Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
por: Luis Gouveia, et al.
Publicado: (2015)