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)
By: Jonathan Lee, Janny Leung, FRANCOIS MARGOT
Published in: RC22731 in 2003
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .