The Ramping Polytope and Cut Generation for the Unit Commitment Problem

References

• Balas E (1979) Disjunctive programming. Ann. Discrete Math. 5:3–51.Crossref, Google Scholar
• Balas E (1998) Disjunctive programming: Properties of the convex hull of feasible points. Discrete Appl. Math. 89(1):3–44.Crossref, Google Scholar
• Balas E, Ceria S, Cornuéjols G (1993) A lift-and-project cutting plane algorithm for mixed 0–1 programs. Math. Programming 58(1–3):295–324.Crossref, Google Scholar
• Carlson B, Chen Y, Hong M, Jones R, Larson K, Ma X, Nieuwesteeg Pet al. (2012) MISO unlocks billions in savings through the application of operations research for energy and ancillary services markets. Interfaces 42(1):58–73.Link, Google Scholar
• Carrion M, Arroyo JM (2006) A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem. IEEE Trans. Power Systems 21(3):1371–1378.Crossref, Google Scholar
• Damcı-Kurt P, Küçükyavuz S, Rajan D, Atamtürk A (2016) A polyhedral study of production ramping. Math. Programming 158(1–2):175–205.Crossref, Google Scholar
• Frangioni A, Gentile C (2006) Solving nonlinear single-unit commitment problems with ramping constraints. Oper. Res. 54(4):767–775.Link, Google Scholar
• Frangioni A, Gentile C (2015a) An extended MIP formulation for the single-unit commitment problem with ramping constraints. 17th British-French-German Conf. Optim., London, http://optimisation-old.doc.ic.ac.uk/bfg2015/bundles/quadscmswebsite/poster/BookOfAbstracts.pdf.Google Scholar
• Frangioni A, Gentile C (2015b) New MIP formulations for the single-unit commitment problems with ramping constraints. IASI Research Report 15-06, Institute for Systems Analysis and Computer Science, Rome.Google Scholar
• Garver LL (1962) Power generation scheduling by integer programming-development of theory. Power Apparatus and Systems, Part III. Trans. Amer. Inst. Electric. Engineers 81(3):730–734.Crossref, Google Scholar
• GE Energy (2014) PJM renewable integration study. Report, PJM Interconnection, Audubon, PA.Google Scholar
• Gentile C, Morales-España G, Ramos A (2017) A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints. EURO J. Comput. Optim. 5(1–2):177–201.Crossref, Google Scholar
• Krall E, Higgins M, O’Neill RP (2012) RTO unit commitment test system. Federal Energy Regulatory Commission. Accessed January 7, 2016, https://www.ferc.gov/industries/electric/indus-act/market-planning/rto-commit-test.asp.Google Scholar
• Lee J, Leung J, Margot F (2004) Discrete Optim. 1(1):77–85.Crossref, Google Scholar
• Malkin P (2003) Minimum runtime and stoptime polyhedra. CORE Report, Université Catholique de Louvain, Louvain-la-Neuve, Belgium.Google Scholar
• Morales-España G, Gentile C, Ramos A (2015) Tight MIP formulations of the power-based unit commitment problem. OR Spectrum 37(4):929–950.Crossref, Google Scholar
• Morales-España G, Latorre JM, Ramos A (2013) Tight and compact MILP formulation of start-up and shut-down ramping in unit commitment. IEEE Trans. Power Systems 28(2):1288–1296.Crossref, Google Scholar
• O’Neill RP (2007) It’s getting better all the time (with mixed integer programming). Presentation, HEPG Forty-Ninth Plenary Session, Harvard Kennedy School, Cambridge, MA.Google Scholar
• Ostrowski J, Anjos MF, Vannelli A (2012) Tight mixed integer linear programming formulations for the unit commitment problem. IEEE Trans. Power Systems 27(1):39–46.Crossref, Google Scholar
• Ostrowski J, Anjos MF, Vannelli A (2015) Modified orbital branching for structured symmetry with an application to unit commitment. Math. Programming 150(1):99–129.Crossref, Google Scholar
• Pan K, Guan Y (2016) A polyhedral study of the integrated minimum-up/-down time and ramping polytope. Working paper, University of Florida, Gainesville.Google Scholar
• PJM (2016a) PJM—Ancillary services. Accessed January 7, 2016, http://pjm.com/markets-and-operations/ancillary-services.aspx.Google Scholar
• PJM (2016b) PJM—System operations. Accessed January 7, 2016, http://www.pjm.com/markets-and-operations/ops-analysis.aspx.Google Scholar
• Rajan D, Takriti S (2005) Minimum up/down polytopes of the unit commitment problem with start-up costs. IBM Research Report, RC23628 (W0506-050), International Business Machines Corp, Armonk, NY.Google Scholar
• Rothvoß T (2017) The matching polytope has exponential extension complexity. J. ACM 64(6):41.Crossref, Google Scholar