This chapter begins with an introduction to dynamic programming, it describes the typology of the problems, which can be divided into subproblems, to be solved by dynamic programming and it explains the formulation to employ for modelling, which focuses on determining the recursive function. Then it proposes a varied set of dynamic programming problems and provides their corresponding solutions. The object of this chapter is to provide a better understanding of modelling multiphase complex problems by means of dynamic programming. Problems are put forward in which the phase, stage, decision, recursive function and the transition function should be defined to then go on to solve the problem to obtain the optimal solution.
KeywordsMarketing Expense Egypt
- Bellman R (1957) Dynamic programming, Princeton University Press, Princeton Google Scholar
- Cocke J, Schwartz JT (1970). Programming languages and their compilers: Preliminary notes. Technical report, Courant Institute of Mathematical Sciences, New York UniversityGoogle Scholar
- Kasami T (1965). An efficient recognition and syntax-analysis algorithm for context-free languages. Scientific report AFCRL-65-758, Air Force Cambridge Research Lab, Bedford, MAGoogle Scholar
- Lengauer T (1993). Algorithmic research problems in molecular bioinformatics. In: Theory and computing systems, 1993, proceedings of the 2nd Israel symposium on the (pp 177–192). IEEEGoogle Scholar