The summed start-up costs in a unit commitment problem

We consider the sum of the incurred start-up costs of a single unit in a Unit Commitment problem. Our major result is a correspondence between the facets of its epigraph and some binary trees for concave start-up cost functions CU, which is bijective if CU is strictly concave. We derive an exponential $${\mathcal{H}}$$H-representation of this epigraph, and provide an exact linear separation algorithm. These results significantly reduce the integrality gap of the Mixed Integer formulation of a Unit Commitment Problem compared to current literature.

[1]  Matthias Huber,et al.  Improving Accuracy and Efficiency of Start-Up Cost Formulations in MIP Unit Commitment by Modeling Power Plant Temperatures , 2016, IEEE Transactions on Power Systems.

[2]  Jarek Kurnitski,et al.  Hourly consumption profiles of domestic hot water for different occupant groups in dwellings , 2016 .

[3]  M. Anjos,et al.  Tight Mixed Integer Linear Programming Formulations for the Unit Commitment Problem , 2012, IEEE Transactions on Power Systems.

[4]  D. M. Hutton,et al.  Handbook of Discrete and Combinatorial Mathematics , 2001 .

[5]  Manfred W. Padberg,et al.  On the facial structure of set packing polyhedra , 1973, Math. Program..

[6]  Jean Vuillemin,et al.  A unifying look at data structures , 1980, CACM.

[7]  A. Conejo,et al.  Optimal response of a thermal unit to an electricity spot market , 2000 .

[8]  Matthias Silbernagl.  A Polyhedral Analysis of Start-up Process Models in Unit Commitment Problems , 2016 .

[9]  L. L. Garver,et al.  Power Generation Scheduling by Integer Programming-Development of Theory , 1962, Transactions of the American Institute of Electrical Engineers. Part III: Power Apparatus and Systems.

[10]  Matthias Huber,et al.  Modeling start-up times in unit commitment by limiting temperature increase and heating , 2015, 2015 12th International Conference on the European Energy Market (EEM).

[11]  Werner Römisch,et al.  Stochastic Lagrangian Relaxation Applied to Power Scheduling in a Hydro-Thermal System under Uncertainty , 2000, Ann. Oper. Res..

[12]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[13]  Dimitris Bertsimas,et al.  Optimization over integers , 2005 .

[14]  G. Sheblé,et al.  Power generation operation and control — 2nd edition , 1996 .

[15]  Allen J. Wood,et al.  Power Generation, Operation, and Control , 1984 .

[16]  Jesús María Latorre Canteli,et al.  Tight and compact MILP formulation for the thermal unit commitment problem , 2013 .

[17]  S. Schubert,et al.  MERRA: NASA’s Modern-Era Retrospective Analysis for Research and Applications , 2011 .

[18]  Robert E. Tarjan,et al.  Scaling and related techniques for geometry problems , 1984, STOC '84.

[19]  Douglas Hilleman,et al.  Power Plant Cycling Costs , 2012 .

[20]  A. Bakirtzis,et al.  Optimal Self-Scheduling of a Thermal Producer in Short-Term Electricity Markets by MILP , 2010, IEEE Transactions on Power Systems.

[21]  M. Carrion,et al.  A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem , 2006, IEEE Transactions on Power Systems.

[22]  F. Kunz,et al.  Electricity Sector Data for Policy-Relevant Modeling: Data Documentation and Applications to the German and European Electricity Markets , 2014 .

[23]  Richard C. Wilson,et al.  An Application of Mixed-Integer Programming Duality to Scheduling Thermal Generating Systems , 1968 .