A polyhedral study of production ramping

• 成果类型: Article
• 署名作者: Damci-Kurt, Pelin; Kucukyavuz, Simge; Rajan, Deepak; Atamturk, Alper
• 署名单位: University System of Ohio; Ohio State University; United States Department of Energy (DOE); Lawrence Livermore National Laboratory; University of California System; University of California Berkeley
• 刊物名称: MATHEMATICAL PROGRAMMING
• ISSN/ISSBN: 0025-5610
• DOI: 10.1007/s10107-015-0919-9
• 发表日期: 2016
• 页码: 175-205
• 关键词: unit commitment problems; algorithm

摘要

We give strong formulations of ramping constraints-used to model the maximum change in production level for a generator or machine from one time period to the next-and production limits. For the two-period case, we give a complete description of the convex hull of the feasible solutions. The two-period inequalities can be readily used to strengthen ramping formulations without the need for separation. For the general case, we define exponential classes of multi-period variable upper bound and multi-period ramping inequalities, and give conditions under which these inequalities define facets of ramping polyhedra. Finally, we present exact polynomial separation algorithms for the inequalities and report computational experiments on using them in a branch-and-cut algorithm to solve unit commitment problems in power generation.