Process flowsheet superstructures: Structural multiplicity and redundancy Part II: Ideal and binarily minimal MINLP representations

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

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

The essential problems, namely representativeness and uniqueness, in defining mixed integer non-linear programming (MINLP) representation (MR) is solved in Part I by first defining a basic MR (BMR) that: (1) can be automatically constructed from an easier formable standard GDP representation and (2) serves as a reference representation. Binary and continuous multiplicity of MR are also defined in Part I, and relation is given there between structural redundancy and binary multiplicity. Based on this results, ideal and binarily minimal MR-s are defined, and the different MR-s are compared from numerical point of view in the present (and final) part. Ideal MR represents all the considered structures and not any other structure. Supposing the process graphs are distincted using binary variables, binarily minimal MR uses the minimal number of them. Solvability of the different MR-s, including some combined versions, are tested on a middle scale and an industrial scale process synthesis problems. Total solution time, solution time for subproblems, number of iterations, non-ideality and scale of the solvable problems are compared. Idealization of the representation and decreasing the number of binary variables, as suggested in the article, both enhance the solvability and decrease the solution time in a great extent.

Original languageEnglish
Pages (from-to)2198-2214
Number of pages17
JournalComputers and Chemical Engineering
Volume29
Issue number10
DOIs
Publication statusPublished - Sep 15 2005

Fingerprint

Flowcharting
Nonlinear programming
Redundancy

Keywords

  • Ideality
  • MINLP
  • Multiplicity
  • Redundancy
  • Representation

ASJC Scopus subject areas

  • Chemical Engineering(all)
  • Control and Systems Engineering

Cite this

@article{51fa00a0db1848b98267654f939b8216,
title = "Process flowsheet superstructures: Structural multiplicity and redundancy Part II: Ideal and binarily minimal MINLP representations",
abstract = "The essential problems, namely representativeness and uniqueness, in defining mixed integer non-linear programming (MINLP) representation (MR) is solved in Part I by first defining a basic MR (BMR) that: (1) can be automatically constructed from an easier formable standard GDP representation and (2) serves as a reference representation. Binary and continuous multiplicity of MR are also defined in Part I, and relation is given there between structural redundancy and binary multiplicity. Based on this results, ideal and binarily minimal MR-s are defined, and the different MR-s are compared from numerical point of view in the present (and final) part. Ideal MR represents all the considered structures and not any other structure. Supposing the process graphs are distincted using binary variables, binarily minimal MR uses the minimal number of them. Solvability of the different MR-s, including some combined versions, are tested on a middle scale and an industrial scale process synthesis problems. Total solution time, solution time for subproblems, number of iterations, non-ideality and scale of the solvable problems are compared. Idealization of the representation and decreasing the number of binary variables, as suggested in the article, both enhance the solvability and decrease the solution time in a great extent.",
keywords = "Ideality, MINLP, Multiplicity, Redundancy, Representation",
author = "Tivadar Farkas and E. R{\'e}v and Z. Lelk{\'e}s",
year = "2005",
month = "9",
day = "15",
doi = "10.1016/j.compchemeng.2005.07.008",
language = "English",
volume = "29",
pages = "2198--2214",
journal = "Computers and Chemical Engineering",
issn = "0098-1354",
publisher = "Elsevier BV",
number = "10",

}

TY - JOUR

T1 - Process flowsheet superstructures

T2 - Structural multiplicity and redundancy Part II: Ideal and binarily minimal MINLP representations

AU - Farkas, Tivadar

AU - Rév, E.

AU - Lelkés, Z.

PY - 2005/9/15

Y1 - 2005/9/15

N2 - The essential problems, namely representativeness and uniqueness, in defining mixed integer non-linear programming (MINLP) representation (MR) is solved in Part I by first defining a basic MR (BMR) that: (1) can be automatically constructed from an easier formable standard GDP representation and (2) serves as a reference representation. Binary and continuous multiplicity of MR are also defined in Part I, and relation is given there between structural redundancy and binary multiplicity. Based on this results, ideal and binarily minimal MR-s are defined, and the different MR-s are compared from numerical point of view in the present (and final) part. Ideal MR represents all the considered structures and not any other structure. Supposing the process graphs are distincted using binary variables, binarily minimal MR uses the minimal number of them. Solvability of the different MR-s, including some combined versions, are tested on a middle scale and an industrial scale process synthesis problems. Total solution time, solution time for subproblems, number of iterations, non-ideality and scale of the solvable problems are compared. Idealization of the representation and decreasing the number of binary variables, as suggested in the article, both enhance the solvability and decrease the solution time in a great extent.

AB - The essential problems, namely representativeness and uniqueness, in defining mixed integer non-linear programming (MINLP) representation (MR) is solved in Part I by first defining a basic MR (BMR) that: (1) can be automatically constructed from an easier formable standard GDP representation and (2) serves as a reference representation. Binary and continuous multiplicity of MR are also defined in Part I, and relation is given there between structural redundancy and binary multiplicity. Based on this results, ideal and binarily minimal MR-s are defined, and the different MR-s are compared from numerical point of view in the present (and final) part. Ideal MR represents all the considered structures and not any other structure. Supposing the process graphs are distincted using binary variables, binarily minimal MR uses the minimal number of them. Solvability of the different MR-s, including some combined versions, are tested on a middle scale and an industrial scale process synthesis problems. Total solution time, solution time for subproblems, number of iterations, non-ideality and scale of the solvable problems are compared. Idealization of the representation and decreasing the number of binary variables, as suggested in the article, both enhance the solvability and decrease the solution time in a great extent.

KW - Ideality

KW - MINLP

KW - Multiplicity

KW - Redundancy

KW - Representation

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

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

U2 - 10.1016/j.compchemeng.2005.07.008

DO - 10.1016/j.compchemeng.2005.07.008

M3 - Article

AN - SCOPUS:25844451635

VL - 29

SP - 2198

EP - 2214

JO - Computers and Chemical Engineering

JF - Computers and Chemical Engineering

SN - 0098-1354

IS - 10

ER -