AN AUTOMATED MODELING AND REFORMULATION SYSTEM FOR DESIGN OPTIMIZATION

被引:12
作者
AMARGER, RJ
BIEGLER, LT
GROSSMANN, IE
机构
[1] CARNEGIE MELLON UNIV, ENGN DESIGN RES CTR, PITTSBURGH, PA 15213 USA
[2] CARNEGIE MELLON UNIV, DEPT CHEM ENGN, PITTSBURGH, PA 15213 USA
基金
美国安德鲁·梅隆基金会;
关键词
D O I
10.1016/0098-1354(92)80011-W
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Many optimization problems in engineering rely on the use of computer algorithms for solving nonlinear programming (NLP), mixed-integer linear programming (MILP) and mixed-integer nonlinear programming (MINLP) models. Although a number of powerful optimization packages are currently available, it is still far from trivial for design engineers to properly formulate optimization models. Since a qualitative knowledge base does exist for expert modelling of optimization problems. there is an incentive to develop computer systems that can encode this knowledge. In this work we develop some of this qualitative knowledge and describe a knowledge-based implementation for automatic model reformulation. The resulting program, REFORM, symbolically reformulates nonlinear and mixed-integer models to increase the robustness and efficiency of the respective algorithms. Models specified in GAMS input files are automatically preprocessed by REFORM to generate a new, well-formulated model. Moreover, its capabilities include constraint reformulation to induce linearity and convexity, tightening of bounds, problem scaling and fixing binary (0-1) variables a priori. While some of these represent common knowledge in the area of optimization, the tight bounding procedure is a novel method that exploits monotonicity in the linear and nonlinear equations. and has applications for fixing binary variables. Computational results are presented to illustrate how the implementation of qualitative knowledge-based problem reformulation can improve the solution of poorly developed models.
引用
收藏
页码:623 / 636
页数:14
相关论文
共 32 条
[1]  
Benders J.F., 1962, NUMER MATH, V4, P252, DOI DOI 10.1007/BF01386316
[2]  
BIEGLER LT, 1984, 2ND P INT C F COMP A, P369
[3]  
BRACKEN, 1968, SELECTED APPLICATION
[4]  
Brooke A., 1988, GAMS USERS GUIDE
[5]   COMMENTS ON IMPROVEMENTS ON A REPLACEMENT FOR THE LOGARITHMIC MEAN [J].
CHEN, JJJ .
CHEMICAL ENGINEERING SCIENCE, 1987, 42 (10) :2488-2489
[6]  
CROWDER HEL, 1983, OPS RES, V31
[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]  
Edgar T. F., 1988, OPTIMIZATION CHEM PR
[9]  
FOURER R, 1987, 133 AT T BELL LABS C
[10]  
Geoffrion A. M., 1972, Journal of Optimization Theory and Applications, V10, P237, DOI 10.1007/BF00934810