TY - JOUR
T1 - Polyhedral results for discrete-time production planning MIP formulations
AU - Maravelias, Christos T.
AU - Papalamprou, Konstantinos
N1 - Funding Information:
Maravelias would like to gratefully acknowledge financial support from the National Science Foundation, under Grant No. CTS-0547443.
PY - 2010
Y1 - 2010
N2 - 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.
AB - 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.
KW - Mixed-integer programming
KW - Polyhedral theory
KW - Production planning
UR - http://www.scopus.com/inward/record.url?scp=77955212382&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77955212382&partnerID=8YFLogxK
U2 - 10.1016/S1570-7946(10)28058-6
DO - 10.1016/S1570-7946(10)28058-6
M3 - Article
AN - SCOPUS:77955212382
SN - 1570-7946
VL - 28
SP - 343
EP - 348
JO - Computer Aided Chemical Engineering
JF - Computer Aided Chemical Engineering
IS - C
ER -