Log in to save to my catalogue

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

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

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_doaj_primary_oai_doaj_org_article_14f18276d75446eaa19e0577a2527931

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

About this item

Full title

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

Author / Creator

Publisher

Berlin/Heidelberg: Elsevier Ltd

Journal title

EURO journal on computational optimization, 2017-03, Vol.5 (1-2), p.149-176

Language

English

Formats

Publication information

Publisher

Berlin/Heidelberg: Elsevier Ltd

More information

Scope and Contents

Contents

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

Alternative Titles

Full title

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

Authors, Artists and Contributors

Author / Creator

Identifiers

Primary Identifiers

Record Identifier

TN_cdi_doaj_primary_oai_doaj_org_article_14f18276d75446eaa19e0577a2527931

Permalink

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_doaj_primary_oai_doaj_org_article_14f18276d75446eaa19e0577a2527931

Other Identifiers

ISSN

2192-4406

E-ISSN

2192-4414

DOI

10.1007/s13675-016-0078-7

How to access this item