Schlagwort(e):
Programming (Mathematics)
;
Process control
;
Automatic control
;
Dynamic programming
;
Dynamic programming
;
Process control
;
Chemical engineering
;
Dynamic programming
;
Process control
;
Chemical engineering
;
Electronic books
;
Electronic books
Beschreibung / Inhaltsverzeichnis:
Introduction -- Replacement problems -- Allocation problems -- Dynamic programming and the calculus of variations -- Computational aspects of dynamic programming -- Control problems -- Chemical engineering control problems -- Inventory problems -- Stochastic problems
Materialart:
Online-Ressource
Seiten:
Online Ressource (viii, 457 pages)
Ausgabe:
Online-Ausg.
ISBN:
0125894503
,
9780125894500
Serie:
Mathematics in Science and Engineering v. 12
URL:
https://www.sciencedirect.com/science/bookseries/00765392/12
URL:
http://www.sciencedirect.com/science/bookseries/00765392/12
URL:
http://www.sciencedirect.com/science/book/9780125894500
DDC:
519.703
Sprache:
Englisch
Anmerkung:
Includes indexes. - Print version record
,
Front Cover; Dynamic Programming in Chemical Engineering and Process Control; Copyright Page; Contents; Preface; Chapter 1. Introduction; 1. Introduction; 2. Definition of Dynamic Programming; 3. Examples of Multi-Stage Processes; 4. Definitions; 5. Method of Attack; 6. Advantages of Dynamic Programming; 7. Disadvantage of Dynamic Programming; Reference; Chapter 2. Replacement Problems; 1. Introduction; 2. Equipment Replacement; 3. Numerical Example; 4. Infinitely Long Process Equipment Replacement; 5. Catalyst Replacement Problems; 6. Model I-Simplest Case; 7. Model II-N-Stage Process
,
8. Computational Aspects for Model II9. Numerical Example, Model II; References; Problems; Chapter 3. Allocation Problems; 1. Introduction; 2. Parallel Reactors, Catalyst Activity Constant; 3. Parallel Reactors with Feed Forward; 4. Series Reactor System; 5. Single Reactor, Catalyst Activity Variable; 6. Alternate Formulation; 7. Feed Rate Distribution over Multiple Reactors and over Time, Variable Catalyst Activity; 8. Cross-Current Extraction; 9. Alternate Formulation of Cross-Current Extraction; 10. Multi-Unit Chemical Plant; 11. Minimization of Liquid Pipeline Pumping Costs
,
12. Generalization of Minimization of Liquid Pipeline Pumping Costs13. Efficiency of Units in Tandem; References; Problems; Chapter 4. Dynamic Programming and the Calculus of Variations; 1. Introduction; 2. Calculus of Variations Problems; 3. Ordinary Maxima and Minima and the Calculus of Variations; 4. Difficulties in the Calculus of Variations; 5. Equality Constraints; 6. Inequality Constraints; 7. Devices for Handling Inequality Constraints; 8. Two-Point Boundary Value Problems; 9. Linearity; 10. Nonanalytic Functions; 11. Example: Inequality Constrained Problem
,
12. Dynamic Programming Point of View13. Derivation of Dynamic Programming Equations; 14. Max ?T0 F(x,y) dt; 15. Max ?80 F(x,y) dt; 16. Max ?80 F(x,y,t) dt; 17. Classical Method for Max ?80 F(x,y) dt; 18. Euler-Lagrange Equation Derivation by Dynamic Programming; 19. Numerical Evaluation of FT = Max [F(c, v ) + G(c, v) fc]; 20. Alternate Approach. Finite Analog to Max ?8T F(x,y) dt; 21. Finite Analog to Min ?T0 F(y,y',t) dt; 22. Control of Chemical Reactor; 23. Example: Smoothing Problems as Variational Problems; 24. Example: Brachistochrone; 25. Batch Reaction Control, Time Minimization
,
26. Comparison of Methods of Solution of the Brachistochrone Problem27. Dynamic Programming and Calculus of Variations-Summing Up; References; Problems; Chapter 5. Computational Aspects of Dynamic Programming; 1. Introduction; 2. Computational Aspects. Raison d'Etre; Untitled; 3. Numerical Example. Combinatorial Method versus Dynamic Programming; 4. General Computation Process; 5. Expanding Grid Problem; 6. Two-Dimensional Problems; 7. Multi-Dimensional Problems; 8. Step-by-Step Grid Generation; 9. Example of Step-by-Step Grid Generation. Control of Batch Reaction
,
10. Allocation Problems, Dynamic Programming., Differential Calculus
Permalink
