New Tactics in Solving Catalyst Regeneration Problems and General Resource Allocation by Dynamic Programming

摘要

Two catalyst regeneration problems are described. The major concern is with the reduction of storage and computations when implementing a dynamic programming strategy. Finally, tactics used in applying dynamic programming to a general resource allocation model are described.