Tight MIP formulations for bounded up/down times and interval-dependent start-ups
From MaRDI portal
Publication:2364487
Recommendations
- A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
- Tight MIP formulations of the power-based unit commitment problem
- Start-up/shut-down MINLP formulations for the unit commitment with ramp constraints
- Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints
- The min-up/min-down unit commitment polytope
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- A polyhedral study of production ramping
- Integer Programming
- Min-up/min-down polytopes
- Production Planning by Mixed Integer Programming
- Separation, dimension, and facet algorithms for node flow polyhedra
- Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
- The Ramping Polytope and Cut Generation for the Unit Commitment Problem
- Tight MIP formulations of the power-based unit commitment problem
Cited in
(8)- On Mixed-Integer Programming Formulations for the Unit Commitment Problem
- Strategic planning with start-time dependent variable costs
- Integrated Stochastic Optimal Self-Scheduling for Two-Settlement Electricity Markets
- Min-up/min-down polytopes
- Start-up/shut-down MINLP formulations for the unit commitment with ramp constraints
- A Polyhedral Study on Fuel-Constrained Unit Commitment
- Modeling flexible generator operating regions via chance-constrained stochastic unit commitment
- Bounded variation in binary sequences
This page was built for publication: Tight MIP formulations for bounded up/down times and interval-dependent start-ups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364487)