Logic cuts for processing networks with fixed charges

J. N. Hooker; Hong Yan; I. E. Grossmann; R. Raman

doi:10.1016/0305-0548(94)90089-2

Logic cuts for processing networks with fixed charges

J. N. Hooker, Hong Yan, I. E. Grossmann, R. Raman

Research output: Journal article publication › Journal article › Academic research › peer-review

42 Citations (Scopus)

Abstract

We show how some simple logical constraints can substantially accelerate the solution of mixed integer linear programming (MILP) models for the design of chemical processing networks. These constraints are easily generated in a preprocessing stage and can be applied symbolically. They represent a new class of cuts, "logic cuts", that cut off 0-1 solutions without changing the optimal objective function value. We establish their elementary properties and identify all possible logic cuts for the processing network problems. Preliminary computational results are presented, using OSL.

Original language	English
Pages (from-to)	265-279
Number of pages	15
Journal	Computers and Operations Research
Volume	21
Issue number	3
DOIs	https://doi.org/10.1016/0305-0548(94)90089-2
Publication status	Published - 1 Jan 1994
Externally published	Yes

ASJC Scopus subject areas

Information Systems and Management
Management Science and Operations Research
Applied Mathematics
Modelling and Simulation
Transportation

More information

10.1016/0305-0548(94)90089-2

Cite this

@article{dbd13194e0ab47d8b89312bc32d8e9ae,

title = "Logic cuts for processing networks with fixed charges",

abstract = "We show how some simple logical constraints can substantially accelerate the solution of mixed integer linear programming (MILP) models for the design of chemical processing networks. These constraints are easily generated in a preprocessing stage and can be applied symbolically. They represent a new class of cuts, {"}logic cuts{"}, that cut off 0-1 solutions without changing the optimal objective function value. We establish their elementary properties and identify all possible logic cuts for the processing network problems. Preliminary computational results are presented, using OSL.",

author = "Hooker, {J. N.} and Hong Yan and Grossmann, {I. E.} and R. Raman",

year = "1994",

month = jan,

day = "1",

doi = "10.1016/0305-0548(94)90089-2",

language = "English",

volume = "21",

pages = "265--279",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier Ltd",

number = "3",

}

TY - JOUR

T1 - Logic cuts for processing networks with fixed charges

AU - Hooker, J. N.

AU - Yan, Hong

AU - Grossmann, I. E.

AU - Raman, R.

PY - 1994/1/1

Y1 - 1994/1/1

N2 - We show how some simple logical constraints can substantially accelerate the solution of mixed integer linear programming (MILP) models for the design of chemical processing networks. These constraints are easily generated in a preprocessing stage and can be applied symbolically. They represent a new class of cuts, "logic cuts", that cut off 0-1 solutions without changing the optimal objective function value. We establish their elementary properties and identify all possible logic cuts for the processing network problems. Preliminary computational results are presented, using OSL.

AB - We show how some simple logical constraints can substantially accelerate the solution of mixed integer linear programming (MILP) models for the design of chemical processing networks. These constraints are easily generated in a preprocessing stage and can be applied symbolically. They represent a new class of cuts, "logic cuts", that cut off 0-1 solutions without changing the optimal objective function value. We establish their elementary properties and identify all possible logic cuts for the processing network problems. Preliminary computational results are presented, using OSL.

UR - http://www.scopus.com/inward/record.url?scp=0028391849&partnerID=8YFLogxK

U2 - 10.1016/0305-0548(94)90089-2

DO - 10.1016/0305-0548(94)90089-2

M3 - Journal article

SN - 0305-0548

VL - 21

SP - 265

EP - 279

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 3

ER -

Logic cuts for processing networks with fixed charges

Abstract

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this