Abstract
We develop a series of polyhedral results for the widely used discrete-time mixed-integer programming (MIP) formulations for production planning and scheduling of continuous processes. We show that for a set of special cases, the incidence matrices of these problems are totally unimodular or network matrices. We also present how these results can be used to facilitate the effective solution of a wide range of practical problems.
Original language | English (US) |
---|---|
Pages (from-to) | 343-348 |
Number of pages | 6 |
Journal | Computer Aided Chemical Engineering |
Volume | 28 |
Issue number | C |
DOIs | |
State | Published - 2010 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- General Chemical Engineering
- Computer Science Applications
Keywords
- Mixed-integer programming
- Polyhedral theory
- Production planning