Dynamic programming
Date of Publication
1978
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Abstract/Summary
Dynamic programming is a mathematical technique which provides a systematic procedure for determining the combination of decisions that maximizes overall effectiveness. In this paper, the author introduces the general idea of the dynamic programming. Specifically, it analyzes the nature of dynamic programming and models, the nature of the solution procedure of the dynamic programming and its areas of application, and the advantages and the disadvantages of the dynamic programming. The thesis includes such topics as the stagecoach problem and the principle of optimality as well as the deterministic and the probabilistic dynamic programming.
Abstract Format
html
Language
English
Format
Accession Number
TU02245
Shelf Location
Archives, The Learning Commons, 12F Henry Sy Sr. Hall
Physical Description
45 leaves
Keywords
Programming
Recommended Citation
Modelo, C. Y. (1978). Dynamic programming. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/15029
