A Study of Three-Period Ramp-Up Polytope

  • Deepak Rajan
  • Liu Sheng
    • Categories (Mixed) Integer Linear Programming, Scheduling Tags , Short URL: https://optimization-online.org/?p=13644

    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.

    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.

    Article

    Download

    View PDF