Start-up/Shut-Down MINLP Formulations for the Unit Commitment with Ramp Constraints

[1]  Sara Lumbreras,et al.  Which Unit-Commitment Formulation is Best? A Comparison Framework , 2020, IEEE Transactions on Power Systems.

[2]  Jean-Paul Watson,et al.  On Mixed-Integer Programming Formulations for the Unit Commitment Problem , 2020, INFORMS J. Comput..

[3]  Jianhui Wang,et al.  The Ramping Polytope and Cut Generation for the Unit Commitment Problem , 2018, INFORMS J. Comput..

[4]  Antonio Frangioni,et al.  Comparing Spatial and Scenario Decomposition for Stochastic Hydrothermal Unit Commitment Problems , 2018, IEEE Transactions on Sustainable Energy.

[5]  Antonio Frangioni,et al.  Large-scale unit commitment under uncertainty: an updated literature survey , 2018, Annals of Operations Research.

[6]  Raouia Taktak,et al.  An overview on mathematical programming approaches for the deterministic unit commitment problem in hydro valleys , 2017 .

[7]  Yongpei Guan,et al.  Polynomial time algorithms and extended formulations for unit commitment problems , 2016, 1608.00042.

[8]  Antonio Frangioni,et al.  A stabilized structured Dantzig–Wolfe decomposition method , 2012, Mathematical Programming.

[9]  Claudio Gentile,et al.  Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints , 2006, Oper. Res..

[10]  C. Gentile,et al.  Perspective cuts for a class of convex 0–1 mixed integer programs , 2006, Math. Program..

[11]  A. Borghetti,et al.  Lagrangian Heuristics Based on Disaggregated Bundle Methods for Hydrothermal Unit Commitment , 2002, IEEE Power Engineering Review.

[12]  Deepak Rajan,et al.  IBM Research Report Minimum Up/Down Polytopes of the Unit Commitment Problem with Start-Up Costs , 2005 .