Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints

DOI10.1007/s13675-016-0078-7zbMath1368.90112OpenAlexW2511786441MaRDI QIDQ2397760

Nicolas Dupin

Publication date: 23 May 2017

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13675-016-0078-7

zbMATH Keywords

polyhedronmixed integer programmingunit commitment problemOR in energyconstraint reformulationramping constraints

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11) Production models (90B30)

Related Items (1)

Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints

Uses Software

• FEASPUMP

Cites Work

• A polyhedral study of production ramping
• Tight MIP formulations of the power-based unit commitment problem
• Local branching
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Branching rules revisited
• Conflict graphs in solving integer programming problems
• Min-up/min-down polytopes
• A solution approach based on Benders decomposition for the preventive maintenance scheduling problem of a stochastic large-scale energy system
• Incremental and encoding formulations for mixed integer programming
• A feasibility pump heuristic for general mixed-integer problems
• A primal-proximal heuristic applied to the French unit-commitment problem
• Mixed Integer Linear Programming Formulation Techniques
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems

This page was built for publication: Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints