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

DOI10.1007/S13675-016-0078-7MaRDI QIDQ2397760zbMATH OpenOpenAlexFDO

Authors Nicolas Dupin

Publication date 23 May 2017

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

constraint reformulationmixed integer programmingOR in energypolyhedronramping constraintsunit commitment problem

Mathematics Subject Classification ID

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

Recommendations

• Start-up/shut-down MINLP formulations for the unit commitment with ramp constraints
• 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
• The Ramping Polytope and Cut Generation for the Unit Commitment Problem
• A polyhedral study of production ramping

Cites work

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

Cited in

(10)

• Start-up/shut-down MINLP formulations for the unit commitment with ramp constraints
• Tight MIP formulations for bounded up/down times and interval-dependent start-ups
• A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
• A polyhedral study of production ramping
• The Ramping Polytope and Cut Generation for the Unit Commitment Problem
• On Mixed-Integer Programming Formulations for the Unit Commitment Problem
• Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints
• Generalized min-up/min-down polytopes
• Enhancing matheuristics for a thermal unit commitment problem through kernel search and local branching
• Tight MIP formulations of the power-based unit commitment problem

Describes a project that uses

Uses Software

• FEASPUMP

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

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