期刊
MATHEMATICAL PROGRAMMING
卷 158, 期 1-2, 页码 175-205出版社
SPRINGER HEIDELBERG
DOI: 10.1007/s10107-015-0919-9
关键词
Ramping; Unit commitment; Co-generation; Production smoothing; Convex hull; Polytope; Valid inequalities; Facets; Computation
类别
资金
- National Science Foundation [1055668, 0970180]
- U.S. Department of Energy by Lawrence Livermore National Laboratory [DE-AC52-07NA27344]
- Office of Assistant Secretary of Defense for Research and Engineering
- Directorate For Engineering
- Div Of Civil, Mechanical, & Manufact Inn [0970180, 1732364] Funding Source: National Science Foundation
- Div Of Civil, Mechanical, & Manufact Inn
- Directorate For Engineering [1055668] Funding Source: National Science Foundation
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据