Global optimization of bilinear process networks with multicomponent flows

[1]  C. A. Haverly.  Studies of the behavior of recursion for the pooling problem , 1978, SMAP.

[2]  Ignacio E. Grossmann,et al.  A modelling and decomposition strategy for the MINLP optimization of process flowsheets , 1989 .

[3]  Hanif D. Sherali,et al.  A new reformulation-linearization technique for bilinear programming problems , 1992, J. Glob. Optim..

[4]  C. Floudas,et al.  A global optimization algorithm (GOP) for certain classes of nonconvex NLPs—I. Theory , 1990 .

[5]  R. L. Motard,et al.  Evolutionary search for an optimal limiting process flowsheet , 1977 .

[6]  F. Al-Khayyal.  Generalized bilinear programming: Part I. Models, applications and linear programming relaxation , 1992 .

[7]  Christodoulos A. Floudas,et al.  A Decomposition Strategy for Global Optimum Search in the Pooling Problem , 1990, INFORMS J. Comput..

[8]  Christodoulos A. Floudas,et al.  Synthesis of distillation sequences with several multicomponent feed and product streams , 1988 .

[9]  Arthur W. Westerberg,et al.  An algorithmic procedure for the synthesis of distillation sequences with bypass , 1987 .

[10]  Ignacio E. Grossmann,et al.  A global optimization algorithm for linear fractional and bilinear programs , 1995, J. Glob. Optim..

[11]  David Kendrick,et al.  GAMS, a user's guide , 1988, SGNM.

[12]  Garth P. McCormick,et al.  Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems , 1976, Math. Program..

[13]  Christodoulos A. Floudas.  Separation synthesis of multicomponent feed streams into multicomponent product streams , 1987 .