Start-up/shut-down MINLP formulations for the unit commitment with ramp constraints

DOI10.1007/978-3-030-63072-0_26zbMath1481.90228OpenAlexW3135372125MaRDI QIDQ2056921

Claudio Gentile, Antonio Frangioni, Tiziano Bacci

Publication date: 8 December 2021

Full work available at URL: http://hdl.handle.net/11568/1084358

zbMATH Keywords

dynamic programmingunit commitment problemconvex costsMIP formulationsramp constraints

Mathematics Subject Classification ID

Mixed integer programming (90C11) Stochastic network models in operations research (90B15) Deterministic network models in operations research (90B10)

Cites Work

• A stabilized structured Dantzig-Wolfe decomposition method
• Large-scale unit commitment under uncertainty: an updated literature survey
• Perspective cuts for a class of convex 0-1 mixed integer programs
• Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
• The Ramping Polytope and Cut Generation for the Unit Commitment Problem