A Polyhedral Study on Fuel-Constrained Unit Commitment

DOI10.1287/IJOC.2022.1235MaRDI QIDQ5060802zbMATH OpenOpenAlexFDO

Authors

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)

Cites work

• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• A polyhedral study of production ramping
• A polyhedral study of the semi-continuous knapsack problem
• A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
• Extreme Ray Feasibility Cuts for Unit Commitment with Uncertainty
• Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems
• Min-up/min-down polytopes
• Multistage stochastic power generation scheduling co-optimizing energy and ancillary services
• On Mixed-Integer Programming Formulations for the Unit Commitment Problem
• Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
• Stochastic dual dynamic integer programming
• Strong formulations for multistage stochastic self-scheduling unit commitment
• Tight MIP formulations for bounded up/down times and interval-dependent start-ups

Cited in

(4)

• Modified orbital branching for structured symmetry with an application to unit commitment
• Optimal unit commitment by branch-and-bound exploiting dual optimization conditions
• Algorithm for calculating the analytic solution for economic dispatch with multiple fuel units
• The Ramping Polytope and Cut Generation for the Unit Commitment Problem

Describes a project that uses

Uses Software

• GitHub

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5060802)