Global optimisation of nonconvex MINLPs

被引:73
作者
Smith, EMB [1 ]
Pantelides, C [1 ]
机构
[1] UNIV LONDON IMPERIAL COLL SCI TECHNOL & MED,CTR PROC SYST ENGN,LONDON SW7 2BY,ENGLAND
关键词
D O I
10.1016/S0098-1354(97)87599-0
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The recent advances in mathematical programming approaches applied to process design and operation problems have produced a need for the ability to find the global optimum of a nonconvex problem containing discrete: variables (a nonconvex MINLP). This paper presents a modified version of the reformulation/spatial branch-and-bound algorithm of Smith and Pantelides (1996) for the solution of such problems. The algorithm is implemented within the gPROMS modelling environment (Barton and Pantelides, 1994) and tested on several MINLP problems arising from process engineering applications.
引用
收藏
页码:S791 / S796
页数:6
相关论文
共 21 条
[1]  
[Anonymous], MATH PROGR
[2]  
[Anonymous], 1994, MPI MESS PASS INT ST
[3]   MODELING OF COMBINED DISCRETE-CONTINUOUS PROCESSES [J].
BARTON, PI ;
PANTELIDES, CC .
AICHE JOURNAL, 1994, 40 (06) :966-979
[4]   APPLICATION OF THE GENERALIZED STREAM STRUCTURE IN HEN SYNTHESIS [J].
CHANG, CT ;
CHU, KK ;
HWANG, JR .
COMPUTERS & CHEMICAL ENGINEERING, 1994, 18 (04) :345-368
[5]  
CPLEX Optimization Inc, 1993, US CPLEX CALL LIB CP
[6]  
Drud Arne Stolbjerg, 1995, CONOPT SYSTEM LARGE CONOPT SYSTEM LARGE
[7]   AN OUTER-APPROXIMATION ALGORITHM FOR A CLASS OF MIXED-INTEGER NONLINEAR PROGRAMS [J].
DURAN, MA ;
GROSSMANN, IE .
MATHEMATICAL PROGRAMMING, 1986, 36 (03) :307-339
[8]   A GLOBAL OPTIMIZATION ALGORITHM (GOP) FOR CERTAIN CLASSES OF NONCONVEX NLPS .1. THEORY [J].
FLOUDAS, CA ;
VISWESWARAN, V .
COMPUTERS & CHEMICAL ENGINEERING, 1990, 14 (12) :1397-1417
[9]  
Hansen E., 1992, GLOBAL OPTIMIZATION, V165
[10]   A MODELING AND DECOMPOSITION STRATEGY FOR THE MINLP OPTIMIZATION OF PROCESS FLOWSHEETS [J].
KOCIS, GR ;
GROSSMANN, IE .
COMPUTERS & CHEMICAL ENGINEERING, 1989, 13 (07) :797-819