Abstract
In previous work, the unit commitment problem has been formulated as a non-convex MINLP, which is computationally expensive to solve. To circumvent this problem, we reformulate in this paper the problem as a convex MIQCP and derive the relevant constraints using propositional logic. We consider a specific problem based on a network of gas and oil fired power generators. Numerical results are presented using several methods (e.g. CPLEX for MIQCP, and DICOPT, SBB for MINLP). It is shown that proposed convex MIQCP reformulation can be solved much faster than previous non-convex models reported in the literature.
Original language | English |
---|---|
Pages (from-to) | 931-936 |
Number of pages | 6 |
Journal | Computer Aided Chemical Engineering |
Volume | 28 |
Issue number | C |
DOIs | |
Publication status | Published - 2010 |
Externally published | Yes |
Event | 20th European Symposium on Computer Aided Process Engineering, ESCAPE 2010 - Ischia, Italy Duration: 6 Jun 2010 → 9 Jun 2010 Conference number: 20 |
Keywords
- Energy optimization
- MINLP
- Unit commitment problem