Structural multiplicity and redundancy in chemical process synthesis with MINLP

Tivadar Farkas, E. Rév, Z. Lelkés

Research output: Contribution to journalArticle

Abstract

How easy the solution of an MINLP model of a superstructure is usually analyzed according to the shape (linearity, convexity, relaxation, etc) of the equations, see e.g. Grossmann (1996). Here relations between the (super)structures and their MINLP representation are studied. In order to analyze this relation, we have defined ideal MINLP and binarily minimal MINLP representations. The effect of ideality and the number of binary variables on the solution time are compared on test examples. The first example is the synthesis problem of Kocis and Grossmann (1987). An ideal and, in the same time, binarily minimal MINLP representation has been constructed and solved. The second example is the membrane train of an industrial ethanol dehydration problem (Lelkes et al., 2000). The representations, solved on a Sun Sparc station using GAMS DICOPT++ solver, are compared according to the maximal size of solvable problems.

Original languageEnglish
Pages (from-to)403-408
Number of pages6
JournalComputer Aided Chemical Engineering
Volume18
Issue numberC
DOIs
Publication statusPublished - 2004

Fingerprint

Redundancy
Dehydration
Sun
Ethanol
Membranes
gamma-glutamylaminomethylsulfonic acid

Keywords

  • ideality
  • MINLP
  • multiplicity
  • redundancy
  • representation

ASJC Scopus subject areas

  • Chemical Engineering(all)
  • Computer Science Applications

Cite this

Structural multiplicity and redundancy in chemical process synthesis with MINLP. / Farkas, Tivadar; Rév, E.; Lelkés, Z.

In: Computer Aided Chemical Engineering, Vol. 18, No. C, 2004, p. 403-408.

Research output: Contribution to journalArticle

@article{c30bf8006b24410b885244bd246a9402,
title = "Structural multiplicity and redundancy in chemical process synthesis with MINLP",
abstract = "How easy the solution of an MINLP model of a superstructure is usually analyzed according to the shape (linearity, convexity, relaxation, etc) of the equations, see e.g. Grossmann (1996). Here relations between the (super)structures and their MINLP representation are studied. In order to analyze this relation, we have defined ideal MINLP and binarily minimal MINLP representations. The effect of ideality and the number of binary variables on the solution time are compared on test examples. The first example is the synthesis problem of Kocis and Grossmann (1987). An ideal and, in the same time, binarily minimal MINLP representation has been constructed and solved. The second example is the membrane train of an industrial ethanol dehydration problem (Lelkes et al., 2000). The representations, solved on a Sun Sparc station using GAMS DICOPT++ solver, are compared according to the maximal size of solvable problems.",
keywords = "ideality, MINLP, multiplicity, redundancy, representation",
author = "Tivadar Farkas and E. R{\'e}v and Z. Lelk{\'e}s",
year = "2004",
doi = "10.1016/S1570-7946(04)80133-0",
language = "English",
volume = "18",
pages = "403--408",
journal = "Computer Aided Chemical Engineering",
issn = "1570-7946",
publisher = "Elsevier",
number = "C",

}

TY - JOUR

T1 - Structural multiplicity and redundancy in chemical process synthesis with MINLP

AU - Farkas, Tivadar

AU - Rév, E.

AU - Lelkés, Z.

PY - 2004

Y1 - 2004

N2 - How easy the solution of an MINLP model of a superstructure is usually analyzed according to the shape (linearity, convexity, relaxation, etc) of the equations, see e.g. Grossmann (1996). Here relations between the (super)structures and their MINLP representation are studied. In order to analyze this relation, we have defined ideal MINLP and binarily minimal MINLP representations. The effect of ideality and the number of binary variables on the solution time are compared on test examples. The first example is the synthesis problem of Kocis and Grossmann (1987). An ideal and, in the same time, binarily minimal MINLP representation has been constructed and solved. The second example is the membrane train of an industrial ethanol dehydration problem (Lelkes et al., 2000). The representations, solved on a Sun Sparc station using GAMS DICOPT++ solver, are compared according to the maximal size of solvable problems.

AB - How easy the solution of an MINLP model of a superstructure is usually analyzed according to the shape (linearity, convexity, relaxation, etc) of the equations, see e.g. Grossmann (1996). Here relations between the (super)structures and their MINLP representation are studied. In order to analyze this relation, we have defined ideal MINLP and binarily minimal MINLP representations. The effect of ideality and the number of binary variables on the solution time are compared on test examples. The first example is the synthesis problem of Kocis and Grossmann (1987). An ideal and, in the same time, binarily minimal MINLP representation has been constructed and solved. The second example is the membrane train of an industrial ethanol dehydration problem (Lelkes et al., 2000). The representations, solved on a Sun Sparc station using GAMS DICOPT++ solver, are compared according to the maximal size of solvable problems.

KW - ideality

KW - MINLP

KW - multiplicity

KW - redundancy

KW - representation

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

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

U2 - 10.1016/S1570-7946(04)80133-0

DO - 10.1016/S1570-7946(04)80133-0

M3 - Article

AN - SCOPUS:77955644591

VL - 18

SP - 403

EP - 408

JO - Computer Aided Chemical Engineering

JF - Computer Aided Chemical Engineering

SN - 1570-7946

IS - C

ER -