Teaching dynamic programming using APL
Dennis L. Bricker, Edward Y. H. Lin · International Journal of Mathematical Education in Science and Technology · 1992
Unlike most other algorithms in optimization, such as the Simplex method in linear programming, dynamic programming is generally considered to be an approach to viewing an optimization problem rather than an algorithm which provides a step‐by‐step solution procedure converging to the optimum. This specificity of the dynamic programming technique often confuses its users both in classroom and in practice. In this paper we illustrate how this difficulty can be overcome with the aid of APL (A Programming Language).