Min-up/min-down polytopes

Authors:
Jon Lee;Janny Leung;FrançOis Margot
Affiliations:
Department of Mathematical Sciences, IBM T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, New York 10598, USA;Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Hong Kong;Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA 15213, USA
Venue:
Discrete Optimization
Year:
2004

Citing 3
Cited 0

Integer and combinatorial optimization

Integer and combinatorial optimization
Geometric comparison of combinatorial polytopes

Discrete Applied Mathematics
Incorporating Fuel Constraints and Electricity Spot Prices into the Stochastic Unit Commitment Problem

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In power generation and other production settings, technological constraints force restrictions on the number of time periods that a machine must stay up once 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).