Generalized min-up/min-down polytopes

DOI10.1016/J.DISOPT.2024.100866MaRDI QIDQ6962506zbMATH OpenFDO

Authors Cécile Rottner

Publication date 8 July 2025

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISOPT.2024.100866

zbMATH Keywords

linear descriptionmin-up/min-downminimum dwell timepolytopeunit commitment

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites work

• A comparison of alternative models for solving a non-linear single plant hydro unit commitment problem
• A strengthened mixed-integer linear programming formulation for combined-cycle units
• An efficient MPC algorithm for switched systems with minimum dwell time constraints
• Large-scale unit commitment under uncertainty: an updated literature survey
• Min-up/min-down polytopes
• Mixed-integer optimal control under minimum dwell time constraints
• Optimal switching with minimum dwell time constraint
• Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
• The min-up/min-down unit commitment polytope
• The Ramping Polytope and Cut Generation for the Unit Commitment Problem
• Tight MIP formulations for bounded up/down times and interval-dependent start-ups
• Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints

This page was built for publication: Generalized min-up/min-down polytopes

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