A Polyhedral Study on Fuel-Constrained Unit Commitment

DOI10.1287/ijoc.2022.1235OpenAlexW4298140649MaRDI QIDQ5060802

No author found.

Publication date: 11 January 2023

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2022.1235

zbMATH Keywords

convex hullcutting planesunit commitmentfuel supply constraint

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Uses Software

• GitHub

Cites Work

• A polyhedral study of production ramping
• Tight MIP formulations for bounded up/down times and interval-dependent start-ups
• Min-up/min-down polytopes
• A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
• Stochastic dual dynamic integer programming
• A polyhedral study of the semi-continuous knapsack problem
• Strong Formulations for Multistage Stochastic Self-Scheduling Unit Commitment
• Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
• Multistage Stochastic Power Generation Scheduling Co-Optimizing Energy and Ancillary Services
• Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems
• Extreme Ray Feasibility Cuts for Unit Commitment with Uncertainty
• On Mixed-Integer Programming Formulations for the Unit Commitment Problem
• Unnamed Item

This page was built for publication: A Polyhedral Study on Fuel-Constrained Unit Commitment