Optimization Online


A Study of Three-Period Ramp-Up Polytope

Sheng Liu (lius10***at***berkeley.edu)
Deepak Rajan (rdeepak***at***berkeley.edu)

Abstract: We study the polyhedron of the unit commitment problem, and consider a relaxation involving the ramping constraints. We study the three-period ramp-up polytope, and describe the convex-hull using a new class of inequalities.

Keywords: Unit commitment, polytope

Category 1: Integer Programming ((Mixed) Integer Linear Programming )

Category 2: Applications -- OR and Management Sciences (Scheduling )

Citation: [1] J. Ostrowski, M. F. Anjos, and A. Vannelli, \Tight mixed integer linear programming formulations for the unit commitment problem," Power Systems, IEEE Transactions on, vol. 27, no. 1, pp. 39{46, 2012. [2] P. Damc-Kurt, S. Kucukyavuz, D. Rajan, and A. Atamturk, \A polyhedral study of production ramping," Mathematical Programming, vol. First online, 2015. [3] K. Pan and Y. Guan, \A polyhedral study of the integrated minimum-up/-down time and ramping polytope," 2015.

Download: [PDF]

Entry Submitted: 09/28/2015
Entry Accepted: 09/29/2015
Entry Last Modified: 10/29/2015

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society