Dynamic programming is optimal for certain sequential decision processes

DOI10.1016/0022-247X(80)90025-6MaRDI QIDQ1139505zbMATH OpenFDO

Authors Arnon Rosenthal

Publication date 1980

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(80)90025-6

zbMATH Keywords

dynamic programmingminimum-cost pathmonotone loop-free sequential decision processsequential decision processes

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Programming involving graphs or networks (90C35) Dynamic programming (90C39) Minimax problems in mathematical programming (90C47)

Cites work

• A note upon minimal path problem
• Dynamic Programming is Optimal for Nonserial Optimization Problems
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• On the optimality of algorithms for finite state sequential decision processes
• Solvable classes of discrete dynamic programming

Cited in

(1)

• The principle of optimality in the design of efficient algorithms

This page was built for publication: Dynamic programming is optimal for certain sequential decision processes

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