Principle of dynamic programming as a natural law discovered by Richard Bellman

DOI10.1016/0022-247X(86)90143-5MaRDI QIDQ1104252zbMATH OpenOpenAlexFDO

Authors Hiroshi Sugiyama

Publication date 1986

Published in Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-247x(86)90143-5

zbMATH Keywords

Bellman's principle of dynamic programminghistorical reviewoptimal allocation

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Linear programming (90C05) Dynamic programming (90C39)

Review text

Bellman's principle of dynamic programming is reviewed. Applications to linear programming and an optimal allocation problem are given. A historical review is mentioned.

Cites work

• A Comparative Evaluation of Two Global Search Algorithms
• Applications of dynamic programming and scan-rescan processes to nuclear medicine and tumor detection
• scientific article; zbMATH DE number 3837821 (Why is no real title available?)
• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 3174053 (Why is no real title available?)
• scientific article; zbMATH DE number 3402409 (Why is no real title available?)
• scientific article; zbMATH DE number 3199442 (Why is no real title available?)
• The art and theory of dynamic programming

This page was built for publication: Principle of dynamic programming as a natural law discovered by Richard Bellman

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104252)