Parameter dynamic programming

Although the Arrhenius equation does not predict rate constants without parameters obtained from another source, it does predict the temperature dependence of reaction rates. The Arrhenius parameters are often obtained from experimental kinetics results since these are an easy way to compare reaction kinetics. The Arrhenius equation is also often used to describe chemical kinetics in computational fluid dynamics programs for the purposes of designing chemical manufacturing equipment, such as flow reactors. Many computational predictions are based on computing the Arrhenius parameters. 

Before discussing of the general method to solve problem (58)-(65) (joint optimization of x and Pbr it should be noted that tire pressure losses and pipe diameters in branched networks with different constraints, including those of type (62), can be effectively optimized by the dynamic programming method (Kaganovich, 1978 Merenkov and Khasilev, 1985 Merenkov et al., 1992). It is applicable to parameter optimization only in the tree-like schemes. For the closed multiloop networks Xi=f(x) and correspondingly, the cost characteristics of individual branches Ft = i//(x), i.e., the minimized economic characteristic of the network as a whole, prove to be nonadditive, which does not allow the use of dynamic programming. 

This volume has two appendices. The first is a compilation by Professors Fiji Osawa and Kenny B. Lipkowitz of published molecular mechanics parameters. All too frequently, it seems, a program employing an empirical force field chokes on a structure for which it has no parameters. The tabulation in Appendix 1 will help users of molecular mechanics and molecular dynamics programs track down supplemental parameters required for their calculations. 

B. Bojkov, R. Luus, 1992, Use of Random Admissible Values for Control in Iterative Dynamic Programming, Ind. Eng. Chem. Res., vol. 31, p.l308 B. Bojkov, R. Luus, 1993, Evaluation of the Parameters Used in Iterative Dynamic Programming, Can. J. Chem. Eng., vol. 71. p. 451... 

The final option is for people who want to explore dynamics, not computing. Dynamical systems software has recently become available for personal computers. AH you have to do is type in the equations and the parameters the program solves the equations numerically and plots the results. Some recommended programs are Phaser (Kocak 1989) for the IBM PC or MacMath (Hubbard and West... 

A second reason why distinguishing decision points is useful is that for many types of DP models it facilitates the computation of solutions. This seems to be the major reason why dynamic programming is used for deterministic decision problems. In this context, the time parameter in the model does not need to correspond to the notion of time in the application. The important feature is that a solution is decomposed into a sequence of distinct decisions. This facilitates computation of the solution if it is easier to compute the individual decisions and then put them together to form a solution than it is to compute a solution in a more direct way. 

The dynamic process changes from state to state over time. The transitions between states may be deterministic or random. The presentation here is for a dynamic program with discrete time parameter r = 0, 1,. . . , and with random transitions. 

Hinderer, K. (1970), Foundations of Non-stationary Dynamic Programming with Discrete Time Parameter. Springer, Berlin. 

For simplest cases the use of the dynamic programming method leads to analytical solutions. Meanwhile, for several phase variables and control parameters the search of optimal solutions is an extraordinarily complicated problem. Therefore, the application of the method of dynamic programming proves to be accurate in numerical computations where powerful computer techniques are used. 

Despite the obvious success of munerical methods for nonlinear mathematical programming, their weaknesses were discovered early on. Among them it should be highlighted the main one, namely, the absence of the physicochemical visualization. To some extent it relates also to Bellmann s dynamic programming method. Naturally, incomplete information about the nature of the studied process on a way to optimal result constrains strongly the creative capabilities of a researcher. In particular, identification of the most active control parameters from a variety of the candidates is complicated, thus also complicating the solution of the defined problem. 

---