Dynamic programming is optimal for certain sequential decision processes

DOI10.1016/0022-247X(80)90025-6zbMath0433.90082MaRDI QIDQ1139505

Arnon Rosenthal

Publication date: 1980

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

zbMATH Keywords

dynamic programmingsequential decision processesminimum-cost pathmonotone loop-free sequential decision process

Mathematics Subject Classification ID

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

Related Items (1)

The principle of optimality in the design of efficient algorithms

Cites Work

• Unnamed Item
• On the optimality of algorithms for finite state sequential decision processes
• A note upon minimal path problem
• Solvable classes of discrete dynamic programming
• Dynamic Programming is Optimal for Nonserial Optimization Problems

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