A Polyhedral Study on Fuel-Constrained Unit Commitment
From MaRDI portal
Publication:5060802
DOI10.1287/IJOC.2022.1235OpenAlexW4298140649MaRDI QIDQ5060802FDOQ5060802
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
Cites Work
- Title not available (Why is that?)
- Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
- A polyhedral study of the semi-continuous knapsack problem
- A polyhedral study of production ramping
- Min-up/min-down polytopes
- On Mixed-Integer Programming Formulations for the Unit Commitment Problem
- A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
- Stochastic dual dynamic integer programming
- Multistage stochastic power generation scheduling co-optimizing energy and ancillary services
- Strong formulations for multistage stochastic self-scheduling unit commitment
- Tight MIP formulations for bounded up/down times and interval-dependent start-ups
- Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems
- Extreme Ray Feasibility Cuts for Unit Commitment with Uncertainty
Cited In (4)
- Optimal unit commitment by branch-and-bound exploiting dual optimization conditions
- Modified orbital branching for structured symmetry with an application to unit commitment
- The Ramping Polytope and Cut Generation for the Unit Commitment Problem
- Algorithm for calculating the analytic solution for economic dispatch with multiple fuel units
Uses Software
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)
