Teaching dynamic programming using APL

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 s...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of mathematical education in science and technology Vol. 23; no. 3; pp. 433 - 411
Main Authors Bricker, Dennis L., Lin, Edward Y. H.
Format Journal Article
LanguageEnglish
Published Taylor & Francis Group 01.05.1992
Online AccessGet full text

Cover

More Information
Summary: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).
ISSN:0020-739X
1464-5211
DOI:10.1080/0020739920230313