Article ID: | iaor2005389 |
Country: | Netherlands |
Volume: | 1 |
Issue: | 1 |
Start Page Number: | 77 |
End Page Number: | 85 |
Publication Date: | Jun 2004 |
Journal: | Discrete Optimization |
Authors: | Leung Janny, Margot Franois, Lee John |
Keywords: | energy |
In power generation and other production settings, technological constraints force restrictions on the number of time periods that a machine must stay up one activated, and stay down once deactivated. We characterize the polyhedral structure of a model representing these restrictions. We also describe a cutting-plane method for solving integer programs involving such min-up and min-down times for machines. Finally,we demonstrate how the polytope of our study generalizes the well-known cross polytope (i.e., generalized octahedron).