The Ramping Polytope and Cut Generation for the Unit Commitment Problem
From MaRDI portal
Publication:5137957
DOI10.1287/ijoc.2017.0802zbMath1448.90042OpenAlexW2902351935WikidataQ128864463 ScholiaQ128864463MaRDI QIDQ5137957
Ben Knueven, Jim Ostrowski, Jianhui Wang
Publication date: 3 December 2020
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/ec744ceab2e9e11c9450f12225b4d136edb82bfd
Related Items (8)
Tight MIP formulations for bounded up/down times and interval-dependent start-ups ⋮ A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints ⋮ Symmetry-breaking inequalities for ILP with structured sub-symmetry ⋮ On the complexity of the unit commitment problem ⋮ On Mixed-Integer Programming Formulations for the Unit Commitment Problem ⋮ Start-up/shut-down MINLP formulations for the unit commitment with ramp constraints ⋮ Multistage Stochastic Power Generation Scheduling Co-Optimizing Energy and Ancillary Services ⋮ Operations research in optimal power flow: a guide to recent and emerging methodologies and applications
Cites Work
- A polyhedral study of production ramping
- Tight MIP formulations of the power-based unit commitment problem
- Disjunctive programming: Properties of the convex hull of feasible points
- Modified orbital branching for structured symmetry with an application to unit commitment
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Min-up/min-down polytopes
- A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
- Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
- Disjunctive Programming
- The Matching Polytope has Exponential Extension Complexity
This page was built for publication: The Ramping Polytope and Cut Generation for the Unit Commitment Problem
