Tighter MIP formulations for the discretised unit commitment problem with min-stop ramping constraints
This paper elaborates compact MIP formulations for a discrete unit commitment problem with minimum stop and ramping constraints. The variables can be defined in two different ways. Both MIP formulations are tightened with clique cuts and local constraints. The projection of constraints from one vari...
Guardado en:
Autor principal: | Nicolas Dupin |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Elsevier
2017
|
Materias: | |
Acceso en línea: | https://doaj.org/article/14f18276d75446eaa19e0577a2527931 |
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) -
Solving wind farm layout optimization with mixed integer programs and constraint programs
por: PeterY. Zhang, et al.
Publicado: (2014) -
Sufficient pruning conditions for MINLP in gas network design
por: Jesco Humpola, et al.
Publicado: (2017) -
A modification of the αBB method for box-constrained optimization and an application to inverse kinematics
por: Gabriele Eichfelder, et al.
Publicado: (2016) -
An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness
por: Martin Schmidt
Publicado: (2015)