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.
All Science Journal Classification (ASJC) codes
- Chemical Engineering(all)
- Computer Science Applications
- Mixed-integer programming
- Polyhedral theory
- Production planning