Applicability of the Functional Equation in Multi Criteria Dynamic Programming

  • Mordechai I. Henig
Part of the International Centre for Mechanical Sciences book series (CISM, volume 289)


Dynamic programming (DP) is associated with mathematical techniques to optimize decision problems by recursively solving a functional equation. When a problem is sequential over time, such an equation arises naturally. In other cases, stages are introduced to faciltate such an equation, although the stages have no natural order. An example of the latter case is the allocation of a resource to the production of several items, where each stage is associated with an item.


Decision Maker Utility Function Functional Equation Optimal Policy Optimal Path 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bellman R., Dynamic Programming, Princeton University Press, Princeton, New Jersey, 1957.Google Scholar
  2. 2.
    Denardo E.V., Dynamic Programming, Theory and Applications Prentice Hall, 1982..Google Scholar
  3. 3.
    Heyman D. and M. Sobel, Stochastic Models in Operations Research, Vol. II, McGraw-Hill, 1984.MATHGoogle Scholar
  4. 4.
    Keeney R. and H. Raiffa, Decisions With Multiple Objectives: Preferences and Value Tradeoffs, John Wiley Sons, 1976.Google Scholar
  5. 5.
    Goicoechea A., D. Hansen and L. Duchstein, Multiple Decision Analysis With Engineering and Business Applications, John Wiley Sons, 1982.Google Scholar
  6. 6.
    Furukawa N., Characterization of optimal policies in vector valued Markovian decision processes, Mathematics of Operations Research 5 (2), 271, 1980.CrossRefMATHMathSciNetGoogle Scholar
  7. 7.
    Hartley R., Finite, discounted vector Markov decisions processes, Notes in Decision Theory, Note 85, University of Manchester, 1979.Google Scholar
  8. 8.
    Henig M., Vector-valued dynamic programming, SIAM Journal of Control and Optimization, 420, 1983.Google Scholar
  9. 9.
    Viswanathan B., V.V. Aggarwal and K.P.K. Nair, Multiple criteria Markov decision processes, TIMS Studies in the Management Sciences 6, North-Holland Publishing Company, 263, 1977.Google Scholar
  10. 10.
    Shin M., Computational methods for Markov decision problems, Ph.D. Dissertation, University of British Columbia, 1980.Google Scholar
  11. 11.
    White C. and K. Kim, Solution procedures for vector criterion Markov decision processes, Large Scale Systems 129, 1980.Google Scholar
  12. 12.
    Megido N., Combinatorial optimization with rational objective function, Mathematics of Operations Research, 4, 414, 1979.CrossRefMathSciNetGoogle Scholar
  13. 13.
    Chandrasekaran R., Minimal ratio spanning trees, Networks, 335, 1977.Google Scholar
  14. 14.
    Handler G. and I. Zang, A dual algorithm for the constrained shortest path problem, Networks 10, 293, 1980.CrossRefMathSciNetGoogle Scholar
  15. 15.
    Hansen P., Bicriterion path problems, in Multiple Criteria Decision Making Theory and Application Proceedings, 1979 by Fandel G. and Gal T., eds., Saringer Verlag, 1980, 109.Google Scholar
  16. 16.
    Hartley R., Dynamic programming in vector networks, Notes in Decision Theory, Note 86, University of Manchester, 1979.Google Scholar
  17. 17.
    Daellenbach H.G. and D.C.D. De Kluyrer, Note on multiple objective dynamic programming, Journal of Operational Research Society 31, 591, 1980.MATHGoogle Scholar
  18. 18.
    Climaco J. and E. Martins, A bicriterion shortest path algorithm. European Journal of Operations Research, 11, 399, 1982.CrossRefMATHMathSciNetGoogle Scholar
  19. 19.
    Henig M., The shortest path problem with two objective functions, Working Paper 743/82, Tel Aviv University, 1982.Google Scholar
  20. 20.
    Warburton A., Exact and approximate solution of multiple objective shortest path problems. Working Paper 83–74, University of Ottowa, 1983.Google Scholar
  21. 21.
    Fishburn P.C., Utility Theory for Decision Making John Wiley Sons, 1970.Google Scholar
  22. 22.
    Chankong V. and Y. Haimes, Multiobjective Decision Making Theory and Methodology, North-Holland, 1983.Google Scholar
  23. 23.
    Zoints S., Multiple criteria decision making: An overview and several approaches, Working Paper 454, State University of New York at Buffalo, 1980.Google Scholar
  24. 24.
    White D.J., The foundation of multi-objective interactive programming - Some questions, Notes in Decision Theory, Note 126, 1982.Google Scholar
  25. 25.
    Kreps D., Decision problems with expected utility criteria I: Upper and lower convergent utility, Mathematics of Operations Research, 2, 45, 1977.CrossRefMATHMathSciNetGoogle Scholar
  26. 26.
    Hinderer K., Foundations of Non-Stationary Dynamic Programming with Discrete Time Parameter, Springer-Verlag, Berlin, 1970.CrossRefMATHGoogle Scholar
  27. 27.
    Jaquette S., Markov decision processes with a new optimality criterion: Discrete time, The Annals of Statistics, 1 (3), 496, 1977.CrossRefMathSciNetGoogle Scholar
  28. 28.
    Sobel M., The variance of discounted Markov decision processes. Journal of Applied Probability 9, 794, 1983.MathSciNetGoogle Scholar
  29. 29.
    Miller B.L., Letter to the editor. Management Science, 24, 1979, 1978.Google Scholar
  30. 30.
    Rossman L., Reliability-constrained dynamic programming and randomized release rules in reservoir management, Water Resources Research, 13 (2), 247, 1970.CrossRefGoogle Scholar
  31. 31.
    Derman C., Optimal replacement and maintenance under Markovian deterioration with probability bounds on failure, Management Science, 9 (3), 478, 1963.CrossRefMathSciNetGoogle Scholar
  32. 32.
    Sneidovich M., Chance constrained dynamic programming, RC 7459 IBM Thomas J. Watson Research Center, Yorktown Heights, N.Y. 1978.Google Scholar
  33. 33.
    Beja A., Probability bounds in replacement policies for Markov systems, Management Science, 16 (3), 253, 1969.CrossRefMATHMathSciNetGoogle Scholar
  34. 34.
    Zionts S. and J. Wallenius, On interactive methods for solving the multiple criteria problem, Management Science, 22 (6), 652, 1976.CrossRefMATHGoogle Scholar
  35. 35.
    Geoffrion A.M., J.S. Dyer and A. Feinberg, An interactive approach for multicriterion optimization with an application to the operation of an academic department, Management Science 19 (4), 357, 1972.CrossRefMATHGoogle Scholar
  36. 36.
    Lawler E., Combinatorial Optimization, Holt, Rinehart and Winston, 1976.MATHGoogle Scholar

Copyright information

© Springer-Verlag Wien 1985

Authors and Affiliations

  • Mordechai I. Henig
    • 1
  1. 1.Faculty of ManagementTel Aviv UniversityIsrael

Personalised recommendations