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...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autor principal:	Nicolas Dupin
Formato:	article
Lenguaje:	EN
Publicado:	Elsevier 2017
Materias:	90C11 Mixed integer programming 90C90 Applications of mathematical programming 90B30 Production models Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95
Acceso en línea:	https://doaj.org/article/14f18276d75446eaa19e0577a2527931
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:14f18276d75446eaa19e0577a2527931
record_format	dspace
spelling	oai:doaj.org-article:14f18276d75446eaa19e0577a25279312021-12-02T05:00:59ZTighter MIP formulations for the discretised unit commitment problem with min-stop ramping constraints2192-440610.1007/s13675-016-0078-7https://doaj.org/article/14f18276d75446eaa19e0577a25279312017-03-01T00:00:00Zhttp://www.sciencedirect.com/science/article/pii/S2192440621000770https://doaj.org/toc/2192-4406This 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 variable structure to the other allows to compare and tighten the MIP formulations. This leads to several equivalent formulations in terms of polyhedral descriptions and thus in LP relaxations. We analyse how MIP resolutions differ in the efficiency of the cuts, branching and primal heuristics. The resulting MIP implementation allows to tackle real size instances for an industrial application.Nicolas DupinElsevierarticle90C11 Mixed integer programming90C90 Applications of mathematical programming90B30 Production modelsApplied mathematics. Quantitative methodsT57-57.97Electronic computers. Computer scienceQA75.5-76.95ENEURO Journal on Computational Optimization, Vol 5, Iss 1, Pp 149-176 (2017)
institution	DOAJ
collection	DOAJ
language	EN
topic	90C11 Mixed integer programming 90C90 Applications of mathematical programming 90B30 Production models Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95
spellingShingle	90C11 Mixed integer programming 90C90 Applications of mathematical programming 90B30 Production models Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95 Nicolas Dupin Tighter MIP formulations for the discretised unit commitment problem with min-stop ramping constraints
description	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 variable structure to the other allows to compare and tighten the MIP formulations. This leads to several equivalent formulations in terms of polyhedral descriptions and thus in LP relaxations. We analyse how MIP resolutions differ in the efficiency of the cuts, branching and primal heuristics. The resulting MIP implementation allows to tackle real size instances for an industrial application.
format	article
author	Nicolas Dupin
author_facet	Nicolas Dupin
author_sort	Nicolas Dupin
title	Tighter MIP formulations for the discretised unit commitment problem with min-stop ramping constraints
title_short	Tighter MIP formulations for the discretised unit commitment problem with min-stop ramping constraints
title_full	Tighter MIP formulations for the discretised unit commitment problem with min-stop ramping constraints
title_fullStr	Tighter MIP formulations for the discretised unit commitment problem with min-stop ramping constraints
title_full_unstemmed	Tighter MIP formulations for the discretised unit commitment problem with min-stop ramping constraints
title_sort	tighter mip formulations for the discretised unit commitment problem with min-stop ramping constraints
publisher	Elsevier
publishDate	2017
url	https://doaj.org/article/14f18276d75446eaa19e0577a2527931
work_keys_str_mv	AT nicolasdupin tightermipformulationsforthediscretisedunitcommitmentproblemwithminstoprampingconstraints
_version_	1718400814625587200

Tighter MIP formulations for the discretised unit commitment problem with min-stop ramping constraints

Ejemplares similares