• DocumentCode
    1296938
  • Title

    Tight Mixed Integer Linear Programming Formulations for the Unit Commitment Problem

  • Author

    Ostrowski, James ; Anjos, Miguel F. ; Vannelli, Anthony

  • Author_Institution
    Dept. of Manage. Sci., Univ. of Waterloo, Waterloo, ON, Canada
  • Volume
    27
  • Issue
    1
  • fYear
    2012
  • Firstpage
    39
  • Lastpage
    46
  • Abstract
    This paper examines the polytope of feasible power generation schedules in the unit commitment (UC) problem. We provide computational results comparing formulations for the UC problem commonly found in the literature. We introduce a new class of inequalities, giving a tighter description of feasible operating schedules for generators. Computational results show that these inequalities can significantly reduce overall solution times.
  • Keywords
    integer programming; linear programming; power generation scheduling; UC problem; mixed integer linear programming formulations; power generation schedules; unit commitment problem; Cost function; Generators; Mixed integer linear programming; Production; Schedules; Upper bound; Integer-programming; optimization; unit commitment;
  • fLanguage
    English
  • Journal_Title
    Power Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0885-8950
  • Type

    jour

  • DOI
    10.1109/TPWRS.2011.2162008
  • Filename
    5983423
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1296938