Logic cuts for processing networks with fixed charges

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

Research output: Journal article publicationJournal articleAcademic researchpeer-review

39 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 languageEnglish
Pages (from-to)265-279
Number of pages15
JournalComputers and Operations Research
Volume21
Issue number3
DOIs
Publication statusPublished - 1 Jan 1994
Externally publishedYes

ASJC Scopus subject areas

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

Cite this