The Ramping Polytope and Cut Generation for the Unit Commitment Problem

Knueven, Ben; Ostrowski, Jim; Wang, Jianhui

doi:10.1287/ijoc.2017.0802

The Ramping Polytope and Cut Generation for the Unit Commitment Problem

Journal Article · Wed Nov 28 23:00:00 EST 2018 · INFORMS Journal on Computing

DOI:https://doi.org/10.1287/ijoc.2017.0802· OSTI ID:2339862

^[1]; Ostrowski, Jim ^[2]; Wang, Jianhui ^[3]

University of Tennessee, Knoxville, TN (United States); University of Tennessee
University of Tennessee, Knoxville, TN (United States)
Argonne National Laboratory (ANL), Argonne, IL (United States)

We present a perfect formulation for a single generator in the unit commitment problem, inspired by the dynamic programming approach taken by Frangioni and Gentile. This generator can have characteristics such as ramp-up/ramp-down constraints, time-dependent start-up costs, and start-up/shut-down limits. To develop this perfect formulation, we extend the result of Balas on unions of polyhedra to present a framework allowing for flexible combinations of polyhedra using indicator variables. Here, we use this perfect formulation to create a cut-generating linear program, similar in spirit to lift-and-project cuts, and demonstrate computational efficacy of these cuts in a utility-scale unit commitment problem.

View Accepted Manuscript (DOE)

Research Organization:: University of Tennessee, Knoxville, TN (United States)

Sponsoring Organization:: USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR); USDOE Office of Science (SC), Office of Workforce Development for Teachers & Scientists (WDTS)

Grant/Contract Number:: SC0018175; AC05-06OR23100

OSTI ID:: 2339862

Journal Information:: INFORMS Journal on Computing, Journal Name: INFORMS Journal on Computing Journal Issue: 4 Vol. 30; ISSN 1091-9856

Publisher:: Institute for Operations Research and the Management Sciences (INFORMS)Copyright Statement

Country of Publication:: United States

Language:: English

References (14)

A lift-and-project cutting plane algorithm for mixed 0–1 programs Balas, Egon; Ceria, Sebastián; Cornuéjols, Gérard Mathematical Programming, Vol. 58, Issue 1-3 https://doi.org/10.1007/BF01581273	journal	January 1993
Tight MIP formulations of the power-based unit commitment problem Morales-España, Germán; Gentile, Claudio; Ramos, Andres OR Spectrum, Vol. 37, Issue 4 https://doi.org/10.1007/s00291-015-0400-4	journal	May 2015
Modified orbital branching for structured symmetry with an application to unit commitment Ostrowski, James; Anjos, Miguel F.; Vannelli, Anthony Mathematical Programming, Vol. 150, Issue 1 https://doi.org/10.1007/s10107-014-0812-y	journal	September 2014
A polyhedral study of production ramping Damcı-Kurt, Pelin; Küçükyavuz, Simge; Rajan, Deepak Mathematical Programming, Vol. 158, Issue 1-2 https://doi.org/10.1007/s10107-015-0919-9	journal	June 2015
A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints Gentile, C.; Morales-España, G.; Ramos, A. EURO Journal on Computational Optimization, Vol. 5, Issue 1-2 https://doi.org/10.1007/s13675-016-0066-y	journal	April 2016
Disjunctive programming: Properties of the convex hull of feasible points Balas, Egon Discrete Applied Mathematics, Vol. 89, Issue 1-3 https://doi.org/10.1016/S0166-218X(98)00136-X	journal	December 1998
Min-up/min-down polytopes Lee, Jon; Leung, Janny; Margot, François Discrete Optimization, Vol. 1, Issue 1 https://doi.org/10.1016/j.disopt.2003.12.001	journal	June 2004
Power Generation Scheduling by Integer Programming-Development of Theory Garver, L. L. Transactions of the American Institute of Electrical Engineers. Part III: Power Apparatus and Systems, Vol. 81, Issue 3 https://doi.org/10.1109/AIEEPAS.1962.4501405	journal	April 1962
A Computationally Efficient Mixed-Integer Linear Formulation for the Thermal Unit Commitment Problem Carrion, M.; Arroyo, J. M. IEEE Transactions on Power Systems, Vol. 21, Issue 3 https://doi.org/10.1109/TPWRS.2006.876672	journal	August 2006
Tight Mixed Integer Linear Programming Formulations for the Unit Commitment Problem Ostrowski, James; Anjos, Miguel F.; Vannelli, Anthony IEEE Transactions on Power Systems, Vol. 27, Issue 1 https://doi.org/10.1109/TPWRS.2011.2162008	journal	February 2012
Tight and Compact MILP Formulation of Start-Up and Shut-Down Ramping in Unit Commitment Morales-Espana, German; Latorre, Jesus M.; Ramos, Andres IEEE Transactions on Power Systems, Vol. 28, Issue 2 https://doi.org/10.1109/TPWRS.2012.2222938	journal	May 2013
The Matching Polytope has Exponential Extension Complexity Rothvoss, Thomas Journal of the ACM, Vol. 64, Issue 6 https://doi.org/10.1145/3127497	journal	September 2017
MISO Unlocks Billions in Savings Through the Application of Operations Research for Energy and Ancillary Services Markets Carlson, Brian; Chen, Yonghong; Hong, Mingguo Interfaces, Vol. 42, Issue 1 https://doi.org/10.1287/inte.1110.0601	journal	February 2012
Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints Frangioni, Antonio; Gentile, Claudio Operations Research, Vol. 54, Issue 4 https://doi.org/10.1287/opre.1060.0309	journal	August 2006

Similar Records

Cutting planes for the multistage stochastic unit commitment problem

Journal Article · Wed Apr 20 00:00:00 EDT 2016 · Mathematical Programming · OSTI ID:1062274

Effects of ramp-rate limits on unit commitment and economic dispatch

Journal Article · Sun Aug 01 00:00:00 EDT 1993 · IEEE Transactions on Power Systems (Institute of Electrical and Electronics Engineers); (United States) · OSTI ID:5738893

Related Subjects

97 MATHEMATICS AND COMPUTING
cut generation
extended formulations
unit commitment

The Ramping Polytope and Cut Generation for the Unit Commitment Problem

Citation Formats

References (14)

Similar Records

Related Subjects