Computing multiple steady states in homogeneous azeotropic and ideal two-product distillation

Ali Baharev, Lubomir Kolev, Endre Rév

Research output: Contribution to journalArticle

12 Citations (Scopus)


Multiple steady states are typically discovered by tracing a solution path, including turning points. A new technique is presented here that does not follow this approach. The original problem is solved directly, without tracing a solution path. The proposed branch-and-prune algorithm is guaranteed to find all solutions automatically. Core components of the framework are affine arithmetic, constraint propagation, and linear programming. The C++ implementation is available as an open-source solver and has an interface to the AMPL® modeling environment. In certain difficult cases, only continuation methods have been reported to find the unstable solution automatically. The proposed method seems to be the first published alternative method in those cases. Although this article focuses mainly on distillation, the presented framework is fairly general and applicable to a wide variety of problems. Further, computational results are given to demonstrate this.

Original languageEnglish
Pages (from-to)1485-1495
Number of pages11
JournalAIChE Journal
Issue number6
Publication statusPublished - Jun 1 2011


  • Bifurcation
  • Interval methods
  • MSS
  • Multiple solutions
  • Output multiplicities

ASJC Scopus subject areas

  • Biotechnology
  • Environmental Engineering
  • Chemical Engineering(all)

Fingerprint Dive into the research topics of 'Computing multiple steady states in homogeneous azeotropic and ideal two-product distillation'. Together they form a unique fingerprint.

  • Cite this