A strengthened mixed-integer linear programming formulation for combined-cycle units

DOI10.1016/J.EJOR.2018.12.020zbMath1430.90576OpenAlexW2904101665WikidataQ128777857 ScholiaQ128777857MaRDI QIDQ1719619

Kai Pan, Yongpei Guan, Lei Fan

Publication date: 11 February 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.12.020

zbMATH Keywords

unit commitmentOR in energystrong valid inequalitiescombined-cycle unitsstrong mixed-integer linear programming (MILP) formulation

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11)

Cites Work

• Unnamed Item
• A polyhedral study of production ramping
• A floating-point genetic algorithm for solving the unit commitment problem
• A variant of the dynamic programming algorithm for unit commitment of combined heat and power systems
• Hydro-electric unit commitment subject to uncertain demand
• An improved unit decommitment algorithm for combined heat and power systems
• Two-stage network constrained robust unit commitment problem

This page was built for publication: A strengthened mixed-integer linear programming formulation for combined-cycle units