Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

Optimisation dynamic programming

In general, dynamic programming is an algorithmic scheme for solving discrete optimisation problems that have overlapping subproblems. In a dynamic... [Pg.454]

Dynamic programming is a technique developed for the optimisation of large systems see Nemhauser (1966), Bellman (1957) and Aris (1963). [Pg.29]

The problem of choosing whether and when to recycle each off-cut and the size of the cut is a difficult one. Liles (1966) considered dynamic programming approach and Luyben (1988) considered repetitive simulation approach to tackle this problem. Mayur et al. (1970) and Christensen and Jorgensen (1987) tackled it as a dynamic optimisation problem using Pontryagin s Maximum Principle applied to very simplified column models as mentioned in Chapters 4 and 5. [Pg.233]

Genetic algorithms Annealing techniques Dynamic programming Collocation methods Stochastic optimisation Agent-based computations Disjunctive programming Tabu search... [Pg.520]

An adaptive control system can automatically modify its behaviour according to the changes in the system dynamics and disturbances. They are applied especially to systems with non-linear and unsteady characteristics. There are a number of actual adaptive control systems. Programmed or scheduled adaptive control uses an auxiliary measured variable to identify different process phases for which the control parameters can be either programmed or scheduled. The "best" values of these parameters for each process state must be known a priori. Sometimes adaptive controllers are used to optimise two or more process outputs, by measuring the outputs and fitting the data with empirical functions. [Pg.107]

Nonlinear Programming (NLP) Based Dynamic Optimisation Problem-Feasible Path Approach... [Pg.136]

For C programmers, it is possible to write programs in C, compile them into dynamic link libraries and use these from Excel, normally via VBA. This has advantages for numerically intensive calculations such as PCA on large datasets which are slow in VBA but which can be optimised in C. A good strategy is to employ Excel as die front end, then VBA to communicate witit die user and also for control of dialog boxes, and finally a C DLL for the intensive numeric calculations. [Pg.446]

In Computer Aided Operation we can mention the real time monitoring of material and energy balance, managed nowadays by means of data reconciliation programs. The plant operation can be adapted and optimised in real time by means of computerised tools based on dynamic flowsheeting. Other advanced applications are simulators for safety studies and operator training. [Pg.51]

The theoretical models proposed in Chapters 2-4 for the description of equilibrium and dynamics of individual and mixed solutions are by part rather complicated. The application of these models to experimental data, with the final aim to reveal the molecular mechanism of the adsorption process, to determine the adsorption characteristics of the individual surfactant or non-additive contributions in case of mixtures, requires the development of a problem-oriented software. In Chapter 7 four programs are presented, which deal with the equilibrium adsorption from individual solutions, mixtures of non-ionic surfactants, mixtures of ionic surfactants and adsorption kinetics. Here the mathematics used in solving the problems is presented for particular models, along with the principles of the optimisation of model parameters, and input/output data conventions. For each program, examples are given based on experimental data for systems considered in the previous chapters. This Chapter ean be regarded as an introduction into the problem software which is supplied with the book an a CD. [Pg.672]

CHARMM is the first program system published which deserves the designation "molecular mechanics , in the sense that it treats static, kinematic and dynamic properties. All other programs available are much more limited in scope. A few warnings for the uninitiated are in place The more complicated a system is, and here I mean only modern well-structured and well-documented systems, the more attention is required to maintain and operate it, and that cannot be left solely to the computer people. Also, know-how does not come by itself or on a tape. For many prospective applications, potential energy function parameters, or even the functions themselves, are lacking, just as for the simpler systems. Parameters must be found by trial and error, as is usual, or, preferably, by optimisation, which cannot be done in CHARMM a program of the consistent force field family is necessary. [Pg.27]


See other pages where Optimisation dynamic programming is mentioned: [Pg.547]    [Pg.454]    [Pg.29]    [Pg.389]    [Pg.454]    [Pg.29]    [Pg.55]    [Pg.531]    [Pg.1068]    [Pg.4]    [Pg.557]    [Pg.634]    [Pg.263]    [Pg.31]    [Pg.124]    [Pg.164]    [Pg.386]    [Pg.5]    [Pg.111]    [Pg.563]    [Pg.563]    [Pg.651]    [Pg.541]    [Pg.130]    [Pg.596]    [Pg.75]    [Pg.833]    [Pg.262]    [Pg.165]    [Pg.374]    [Pg.183]    [Pg.209]   
See also in sourсe #XX -- [ Pg.29 ]




SEARCH



Dynamic program

Dynamic programing

Dynamic programming

Optimisation

Optimisation Dynamic

Optimisation Optimise

Optimisation Optimised

© 2024 chempedia.info