Analyzing the computational performance of balance constraints in the medium-term unit commitment problem: Tightness, compactness, and arduousness

Abstract

Este artículo analiza la implicación computacional de diferentes restricciones de balance en el unit commitment problem. Estudia su tightness and compactness y propone ‘arduousness’ como nueva métrica para mejorar las predicciones sobre procesos de resolución MIP. Además, estudia la repercusión de utilizar curvas de demandas estables o altamente intermitentes.

This article analyzes the computational performance of balance constraints in the unit commitment problem. Tightness and compactness are studied in-depth, and 'arduousness' is introduced as a new metric to enhance predictions of MIP resolution processes. Moreover, the implications of using stable or intermittent thermal-load profiles are addressed.