Advertisement

Unternehmensforschung

, Volume 3, Issue 2, pp 70–80 | Cite as

Grundzüge des Dynamic Programming

  • Franz Ferschl
Veröffentlichungen

Zusammenfassung

Es wird ein kurzer Überblick über einige Hauptprobleme des Dynamic Programming — einer speziellen Lösungsmethode zur Auffindung optimaler Lösungen bei mehrstufigen Extremwertsaufgaben — gegeben. Es wird gezeigt, wie in gewissen Fällen die Problemstellung des Linear Programming verallgemeinert und die Aufgabe mit Hilfe dieser Methode gelöst werden kann. Abschließend wird ein Optimalisierungsprinzip angegeben, das eine Kennzeichnung der Aufgaben gestattet, die einer Lösung durch die Methode des Dynamic Programming zugänglich sind.

Summary

A brief survey is given about several main problems of dynamic programming — a special procedure for finding optimal solutions of multi-stage extremal value problems. It is shown that in certain cases the approach of linear programming can be generalized and the problem be solved by means of this procedure. Finally a principle of optimization is stated which permits a characterization of the problems lending themselves to a solution by means of dynamic programming.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. [1]
    Barankin, E. W., andR. Dorfman: “On quadratic programming.” University of California Publication in Statistics 1958, Vol. 2, Nr. 13.Google Scholar
  2. [2]
    Dantzig, G. B.: “Discrete — Variable extremum problems.” Journal of the Operations Research Society of America, Vol. 5, Nr. 2, S. 275.Google Scholar
  3. [3]
    Vazsonyi, A.: “Scientific programming in business and industry.” New York 1958, John Wiley & Sons, Inc., London, Chapman & Hall Ltd.Google Scholar
  4. [4]
    Bellman, R.: “Dynamic programming.” Princeton University Press, June 1957.Google Scholar
  5. [5]
    Bellman, R.: “Some applications of the theory of dynamic programming — a review.” Journal of the Operations Research Society of America, Vol. 2, Nr. 3.Google Scholar
  6. [6]
    Bellman, R.: “Dynamic programming and the numerical solution of variationel problems.” Journal of the Operations Research Society of America, Vol. 5, Nr. 2.Google Scholar
  7. [7]
    Bellman, R.: “Bottleneck problems, functional equations and dynamic programming.” Econometrica 23, S. 73–87 (1955).Google Scholar
  8. [8]
    Bellman, R.: “Theory of dynamic programming” in “Modern mathematics for the engineer.” Chapt. 11, S. 243–278, edited byEdwin F. Beckenbach, u. a. New York, Toronto, London 1956. Mac Graw Hill Book Company, Inc.Google Scholar
  9. [9]
    Dreyfus, St. E.: “Computational aspects of dynamic programming.” Journal of the Operations Research Society of America, Vol. 5, Nr. 3.Google Scholar
  10. [10]
    Bishop, A. B., andTh. H. Rockwell: “A dynamic programming computational procedure for optimal manpower loading in a large aircraft company.” Journal of the Operations Research Society of America, Vol. 6, Nr. 6.Google Scholar
  11. [11]
    Churchman, C. W., R. L. Ackoff, E. L. Arnoff: “Introduction to operations research.” New York 1957, John Wiley & Sons Inc., London, Chapman & Hall, Ltd. — Chapt. 16, S. 473–475.Google Scholar

Copyright information

© Physica-Verlag 1959

Authors and Affiliations

  • Franz Ferschl
    • 1
  1. 1.Bundeskammer der gewerblichen WirtschaftWien I.

Personalised recommendations