Dynamic Programming

  • Raúl Poler
  • Josefa Mula
  • Manuel Díaz-Madroñero
Chapter

Abstract

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.

Keywords

Marketing Expense Egypt 

References

  1. Aumann RJ (1995) Backward induction and common knowledge of rationality. Game Econ Behav 8(1):6–19MathSciNetCrossRefMATHGoogle Scholar
  2. Bellman R (1954) The theory of dynamic programming. Bull American Math Soc 60:503–516CrossRefMATHGoogle Scholar
  3. Bellman R (1957) Dynamic programming, Princeton University Press, Princeton Google Scholar
  4. Cocke J, Schwartz JT (1970). Programming languages and their compilers: Preliminary notes. Technical report, Courant Institute of Mathematical Sciences, New York UniversityGoogle Scholar
  5. Earley J (1970) An efficient context-free parsing algorithm. Commun ACM 13(2):94–102CrossRefMATHGoogle Scholar
  6. 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
  7. 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
  8. Needleman SB, Wunsch CD (1970) A general method applicable to the search for similarities in the amino acid sequence of two proteins. J Mol Biol 48(3):443–453CrossRefGoogle Scholar
  9. Viterbi AJ (1967) Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Trans Inf Theory 13(2):260–269CrossRefMATHGoogle Scholar
  10. Younger DH (1967) Recognition and parsing of context-free languages in time n3. Inf Control 10(2):189–208CrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag London 2014

Authors and Affiliations

  • Raúl Poler
    • 1
  • Josefa Mula
    • 1
  • Manuel Díaz-Madroñero
    • 1
  1. 1.Research Centre on Production Management and Engineering (CIGIP)Department of Business Management, Universitat Politècnica de ValènciaAlcoySpain

Personalised recommendations