LOGIC CUTS FOR PROCESSING NETWORKS WITH FIXED CHARGES

被引：31

作者：

HOOKER, JN

YAN, H

GROSSMANN, IE

RAMAN, R

机构：

[1] Engineering Design Research Center, Carnegie Mellon University, Pittsburgh

来源：

COMPUTERS & OPERATIONS RESEARCH | 1994年 / 21卷 / 03期

基金：

美国安德鲁·梅隆基金会; 美国国家科学基金会;

关键词：

D O I：

10.1016/0305-0548(94)90089-2

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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.

引用

页码：265 / 279

页数：15

共 14 条

[1] AN MILP FORMULATION FOR HEAT-INTEGRATED DISTILLATION SEQUENCE SYNTHESIS [J].