Polyhedral results for discrete-time production planning MIP formulations for continuous processes

Christos T. Maravelias, Konstantinos Papalamprou

Research output: Contribution to journalArticlepeer-review

18 Scopus citations

Abstract

We derive polyhedral results for discrete-time mixed-integer programming (MIP) formulations for the production planning of multi-stage continuous chemical processes. We express the feasible region of the LP-relaxation as the intersection of two sets. The constraints describing the first set yield the convex hull of its integer points. For the second set, we show that for integral data the constraint matrix is κ-regular, and that the corresponding polyhedron is integral if the length of the planning period is selected appropriately. We use this result to show that for rational data, integer variables can also assume integral values at the vertices of the polyhedron. We also discuss how these results provide insight and can be used to effectively address large-scale problems. Finally, we present computational results for a series of example problems.

Original languageEnglish (US)
Pages (from-to)1890-1904
Number of pages15
JournalComputers and Chemical Engineering
Volume33
Issue number11
DOIs
StatePublished - Nov 12 2009
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Chemical Engineering(all)
  • Computer Science Applications

Keywords

  • κ-Regularity
  • Mixed-integer programming
  • Polyhedral results
  • Production planning
  • Scheduling

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

Cite this