Abstract
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).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Mathematical Education in Science and Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
