From dynamic programming to bynamic programming

DOI10.1006/jmaa.1993.1243zbMath0788.90074OpenAlexW2060791951MaRDI QIDQ1260896

Seiichi Iwamoto

Publication date: 5 September 1993

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

Full work available at URL: https://doi.org/10.1006/jmaa.1993.1243

zbMATH Keywords

sequential optimizationbynamic programming

Mathematics Subject Classification ID

Dynamic programming in optimal control and differential games (49L20) Dynamic programming (90C39)

Related Items (4)

On Markov policies for minimax decision processes ⋮ Shortest and longest path problems ⋮ On a negative-equivalency theorem in associative optimal path problems ⋮ STRONG REPRESENTATION OF A DISCRETE DECISION PROCESS BY POSITIVELY/NEGATIVELY BITONE SEQUENTIAL DECISION PROCESS

This page was built for publication: From dynamic programming to bynamic programming