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...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2017-03-01
|
| Series: | EURO Journal on Computational Optimization |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2192440621000770 |