Asset Details
Do you wish to reserve the book?
Tighter MIP formulations for the discretised unit commitment problem with min-stop ramping constraints
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Tighter MIP formulations for the discretised unit commitment problem with min-stop ramping constraints
Do you wish to request the book?
Tighter MIP formulations for the discretised unit commitment problem with min-stop ramping constraints
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Tighter MIP formulations for the discretised unit commitment problem with min-stop ramping constraints
2017
Overview
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.
Publisher
Elsevier Ltd,Springer Berlin Heidelberg,Springer Nature B.V,Springer,Elsevier
