A new approach for global optimization of a class of MINLP problems with applications to water management and pooling problems

被引:47
作者
Faria, Debora C. [1 ]
Bagajewicz, Miguel J. [1 ]
机构
[1] Univ Oklahoma, Norman, OK 73019 USA
关键词
mathematical programming; optimization; global optimization; OUTER-APPROXIMATION; ALGORITHM; CONCAVE; PROGRAMS; BRANCH; MODELS;
D O I
10.1002/aic.12754
中图分类号
TQ [化学工业];
学科分类号
0817 ;
摘要
One of the biggest challenges in solving optimization engineering problems is rooted in the nonlinearities and nonconvexities, which arise from bilinear terms corresponding to component material balances and/or concave functions used to estimate capital cost of equipments. The procedure proposed uses an MILP lower bound constructed using partitioning of certain variables, similar to the one used by other approaches. The core of the method is to bound contract a set of variables that are not necessarily the ones being partitioned. The procedure for bound contraction consists of a novel interval elimination procedure that has several variants. Once bound contraction is exhausted the method increases the number of intervals or resorts to a branch and bound strategy where bound contraction takes place at each node. The procedure is illustrated with examples of water management and pooling problems. (C) 2011 American Institute of Chemical Engineers AIChE J, 58: 23202335, 2012
引用
收藏
页码:2320 / 2335
页数:16
相关论文
共 44 条
[1]   A Lagrangian approach to the pooling problem [J].
Adhya, N ;
Tawarmalani, M ;
Sahinidis, NV .
INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH, 1999, 38 (05) :1956-1972
[2]  
[Anonymous], 2000, NONCON OPTIM ITS APP, DOI 10.1007/978-1-4757-4949-6
[3]  
[Anonymous], J GLOBAL OPTIM
[4]  
[Anonymous], J GLOBAL OPTIM
[5]  
[Anonymous], COMMUNICATION NOV
[6]  
[Anonymous], COMPUT AIDED CHEM EN
[7]  
[Anonymous], LOGIC BASED OUTER AP
[8]  
[Anonymous], J GLOBAL OPTIMIZ
[9]   CANONICAL CUTS ON UNIT HYPERCUBE [J].
BALAS, E ;
JEROSLOW, R .
SIAM JOURNAL ON APPLIED MATHEMATICS, 1972, 23 (01) :61-&
[10]   GLOBAL MINIMIZATION BY REDUCING THE DUALITY GAP [J].
BENTAL, A ;
EIGER, G ;
GERSHOVITZ, V .
MATHEMATICAL PROGRAMMING, 1994, 63 (02) :193-212