Polyhedral results for discrete-time production planning MIP formulations

Christos T. Maravelias, Konstantinos Papalamprou

Research output: Contribution to journalArticlepeer-review


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 languageEnglish (US)
Pages (from-to)343-348
Number of pages6
JournalComputer Aided Chemical Engineering
Issue numberC
StatePublished - 2010
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • General Chemical Engineering
  • Computer Science Applications


  • Mixed-integer programming
  • Polyhedral theory
  • Production planning


Dive into the research topics of 'Polyhedral results for discrete-time production planning MIP formulations'. Together they form a unique fingerprint.

Cite this