Computational studies using a novel simplicial-approximation based algorithm for MINLP optimization
- 作者：Goyal ; Vishal ; Ierapetritou ; Marianthi G.
- 关键词：MINLP optimization ; Simplicial-approximation ; Decomposition algorithm
- 刊名：Computers and Chemical Engineering
- 出版年：2004
- 期刊代码：35_00981354
- 类别：et
- 出版时间：August 15, 2004
- 卷：28
- 期：9
- 页码：1771-1780
- 文件大小：129 K
摘要
Significant advances have been made in the last two decades for the effective solution of mixed integer non-linear programming (MINLP) problems, mainly by exploiting the special structure of the problem that results under certain convexity assumptions. This paper discusses the computational experience with a novel decomposition algorithm which is based on the idea of closely approximating the feasible region defined by the set of constraints by a convex polytope using the simplicial approximation approach (Goyal and Ierapetritou, 2003b). A variety of problems are solved including structural flowsheet optimization, design of batch processes and trim-loss minimization to illustrate the applicability and efficiency of the proposed approach.