DECOMPOSITION STRATEGIES FOR LARGE-SCALE DYNAMIC OPTIMIZATION PROBLEMS

被引:58
作者
LOGSDON, JS
BIEGLER, LT
机构
[1] Department of Chemical Engineering, Carnegie-Mellon University, Pittsburgh
关键词
D O I
10.1016/0009-2509(92)80272-E
中图分类号
TQ [化学工业];
学科分类号
0817 ;
摘要
Recently, efficient strategies have been developed to solve dynamic simulation and optimization problems in a simultaneous manner. These rely on the ability to obtain an accurate algebraic discretization of the differential equations as well as the ability to solve large optimization problems in an efficient manner. These concerns have been addressed by applying orthogonal collocation on finite elements to these systems and solving the nonlinear program (NLP) with a reduced space successive quadratic programming (SQP) approach. In a recent study we discussed theoretical properties of these differential algebraic equation (DAE) systems and cautioned that application of orthogonal collocation may not yield a stable discretization nor an accurate solution to the control problem. As a result of this, preanalysis of the DAE system is required and appropriate approximation error criteria must be embedded within the nonlinear program. In this paper we tailor this approach to the accurate solution of optimal control problems. The optimal control problem has a natural partitioning of control variables and state variables for the NLP. Note here that partitioned spaces are not orthogonal. We develop a decomposition strategy to: (1) exploit the block matrix form of the discretized differential equations which results from using collocation on finite elements, and (2) allow us to perform the optimization in the control space. Here the state variables for each finite element are determined by linearized differential equations, and a coordination step is used to update the control variables and integration length. Information is passed from element to element by chainruling the state information. While the approach has much in common with earlier quasilinearization approaches, the nonlinear programming strategy has a great deal of flexibility in determining control variable discontinuities, enforcing a wide variety of state and control variable constraints and ensuring the accurate determination of both state and control variable profiles. Two classes of problems are investigated; first we consider problems where the differential equations are linear in the state variables and then we consider the general nonlinear (states and controls) problem. Example problems are illustrated for both classes of problems.
引用
收藏
页码:851 / 864
页数:14
相关论文
共 26 条
[1]   SOLUTION OF DYNAMIC OPTIMIZATION PROBLEMS BY SUCCESSIVE QUADRATIC-PROGRAMMING AND ORTHOGONAL COLLOCATION [J].
BIEGLER, LT .
COMPUTERS & CHEMICAL ENGINEERING, 1984, 8 (3-4) :243-247
[2]   IMPROVED INFEASIBLE PATH OPTIMIZATION FOR SEQUENTIAL MODULAR SIMULATORS .2. THE OPTIMIZATION ALGORITHM [J].
BIEGLER, LT ;
CUTHRELL, JE .
COMPUTERS & CHEMICAL ENGINEERING, 1985, 9 (03) :257-267
[3]   SIMULTANEOUS-OPTIMIZATION AND SOLUTION METHODS FOR BATCH REACTOR CONTROL PROFILES [J].
CUTHRELL, JE ;
BIEGLER, LT .
COMPUTERS & CHEMICAL ENGINEERING, 1989, 13 (1-2) :49-62
[4]   ON THE OPTIMIZATION OF DIFFERENTIAL-ALGEBRAIC PROCESS SYSTEMS [J].
CUTHRELL, JE ;
BIEGLER, LT .
AICHE JOURNAL, 1987, 33 (08) :1257-1270
[5]  
CUTLER CR, 1979, AICHE NATIONAL M HOU
[6]  
EATON JW, 1989, P IFAC WORKSHOP MODE, P129
[7]  
HINDMARSH AC, 1980, ACM SIGNUM NEWSLETTE, V15, P10, DOI DOI 10.1145/1218052.1218054
[9]  
LI WC, 1989, CHEM ENG RES DES, V67, P562
[10]  
LIU DC, 1988, NAM03 NW U TECHN REP