Key Features:
Format: PDF
Pages: 26
Content: Lagos State University Project Topic (Mathematics)
Date: December 2021
Abstract:
This article reviews the history and theory of dynamic programming (DP).a
recursive method of solving sequential decision problems under uncertainty.it
discusses computational algorithms for the numerical solution of DP prob-
lems, and an important limitation in our ability to solve realistic large-scale
dynamic programming problems, the ’curse of dimensionality’. It is also
summarizes recent research in complexity theory that delineates situations
where the curse can be broken (allowing us to solves DPs using fast polyno-
mial time algorithms), and situations where it is insuperable.the literature on
econometric estimation and testing of DP models is reviewed, as in another
’scientific limit to knowledge’,namely,the identification problem.
Table of Content:
Contents
Certification i
ABSTRACT ii
ii
1 INTRODUCTION 1
1.1 Background of study . . . . . . . . . . . . . . . . . . . . . . . 2
1.2 STATEMENT OF PROBLEM . . . . . . . . . . . . . . . . . . 3
1.3 OBJECTIVE OF STUDY . . . . . . . . . . . . . . . . . . . . 4
1.4 SIGNIFICANT OF STUDY . . . . . . . . . . . . . . . . . . . 4
1.5 SCOPE OF STUDY . . . . . . . . . . . . . . . . . . . . . . . 5
2 LITERATURE REVIEW 6
2.1 REVIEW OF RELATED LITERATURE . . . . . . . . . . . . 6
3 LINEAR PROGRAMMING PROBLEM (LPP) 9
3.1 FORMULATION . . . . . . . . . . . . . . . . . . . . . . . . . 10
3.2 SIMPLEX METHOD . . . . . . . . . . . . . . . . . . . . . . . 13
3.3 Dynamic Programming . . . . . . . . . . . . . . . . . . . . . . 19
3.4 LINEAR PROGRAMMING PROBLEMS BY DYNAMIC AP-
PROACH . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21
4 Summary and Conclusion 25
4.1 summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25
4.2 conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25
4.3 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26
Introduction:
1 INTRODUCTION
Dynamic programming is both a mathematical optimization and computer programming method developed by an American mathematician Richard Bellman. The term dynamic programming was coined by Richard Bellam in 1950s. He used this algorithm to describe the process of solving problem where one is asked to find best decision at each stage.He used the word dynamic to show the time varying aspect of the problems and also it sounded impressive for him.
Buy Now
