Polyhedral results for discrete-time production planning MIP formulations

Christos T. Maravelias; Konstantinos Papalamprou

doi:10.1016/S1570-7946(10)28058-6

Polyhedral results for discrete-time production planning MIP formulations

Christos T. Maravelias, Konstantinos Papalamprou

Research output: Contribution to journal › Article › peer-review

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	https://doi.org/10.1016/S1570-7946(10)28058-6
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

Access to Document

10.1016/S1570-7946(10)28058-6

Cite this

@article{5658d22c95d64f61a46aaa5eb9080e19,

title = "Polyhedral results for discrete-time production planning MIP formulations",

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.",

keywords = "Mixed-integer programming, Polyhedral theory, Production planning",

author = "Maravelias, {Christos T.} and Konstantinos Papalamprou",

note = "Funding Information: Maravelias would like to gratefully acknowledge financial support from the National Science Foundation, under Grant No. CTS-0547443.",

year = "2010",

doi = "10.1016/S1570-7946(10)28058-6",

language = "English (US)",

volume = "28",

pages = "343--348",

journal = "Computer Aided Chemical Engineering",

issn = "1570-7946",

publisher = "Elsevier B.V.",

number = "C",

}

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 -

Polyhedral results for discrete-time production planning MIP formulations

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this