The mathematical technique known as dynamic programming is here introduced as a tool in the optimization of chemical reactors. The structure of the optimal problem is first analysed and two of the simpler problems (optimal conditions for a single reaction in a sequence of stirred tanks and a tubular reactor) are solved. A more abstract presentation of the principles of dynamic programming is then given followed by an exposition of its application to quite general optimal problems with three of the principle types of reactor, namely the stirred tank, the adiabatic bed and the tubular or batch reactor.
No takes yet. Share an insight, caveat, or question.
Rutherford Aris (1961) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: