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

DOI10.1007/S13675-016-0078-7zbMATH Open1368.90112OpenAlexW2511786441MaRDI QIDQ2397760FDOQ2397760

Authors: 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

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

zbMATH Keywords

polyhedronmixed integer programmingOR in energyunit commitment problemconstraint reformulationramping constraints

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• The Ramping Polytope and Cut Generation for the Unit Commitment Problem
• Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints

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)