DOE OSTI · 2339862
The Ramping Polytope and Cut Generation for the Unit Commitment Problem
Abstract
We present a perfect formulation for a single generator in the unit commitment problem, inspired by the dynamic programming approach taken by Frangioni and Gentile. This generator can have characteristics such as ramp-up/ramp-down constraints, time-dependent start-up costs, and start-up/shut-down limits. To develop this perfect formulation, we extend the result of Balas on unions of polyhedra to present a framework allowing for flexible combinations of polyhedra using indicator variables. Here, we use this perfect formulation to create a cut-generating linear program, similar in spirit to lift-and-project cuts, and demonstrate computational efficacy of these cuts in a utility-scale unit commitment problem.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Knueven, Ben, Ostrowski, Jim, Wang, Jianhui. 2018-11-29. The Ramping Polytope and Cut Generation for the Unit Commitment Problem. https://doi.org/10.1287/ijoc.2017.0802
Cite the original work for its findings. Save a collection to share your selection of sources.