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.
This is a preview of subscription content, log in via an institution to check access.
Explore related subjects
Discover the latest articles and news from researchers in related subjects, suggested using machine learning.Literatur
Barankin, E. W., andR. Dorfman: “On quadratic programming.” University of California Publication in Statistics 1958, Vol. 2, Nr. 13.
Dantzig, G. B.: “Discrete — Variable extremum problems.” Journal of the Operations Research Society of America, Vol. 5, Nr. 2, S. 275.
Vazsonyi, A.: “Scientific programming in business and industry.” New York 1958, John Wiley & Sons, Inc., London, Chapman & Hall Ltd.
Bellman, R.: “Dynamic programming.” Princeton University Press, June 1957.
Bellman, R.: “Some applications of the theory of dynamic programming — a review.” Journal of the Operations Research Society of America, Vol. 2, Nr. 3.
Bellman, R.: “Dynamic programming and the numerical solution of variationel problems.” Journal of the Operations Research Society of America, Vol. 5, Nr. 2.
Bellman, R.: “Bottleneck problems, functional equations and dynamic programming.” Econometrica 23, S. 73–87 (1955).
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.
Dreyfus, St. E.: “Computational aspects of dynamic programming.” Journal of the Operations Research Society of America, Vol. 5, Nr. 3.
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.
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.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ferschl, F. Grundzüge des Dynamic Programming. Unternehmensforschung Operations Research 3, 70–80 (1959). https://doi.org/10.1007/BF01962868
Issue Date:
DOI: https://doi.org/10.1007/BF01962868