A new optimality criterion for discrete dynamic programming

DOI10.1016/0022-247X(72)90261-2zbMath0234.90064MaRDI QIDQ2551744

Yoshio Tabata, Hisashi Mine

Publication date: 1972

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

Mathematics Subject Classification ID

Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)

Related Items (1)

Some remarks on the new optimality criterion of Mine and Tabata

Cites Work

• Unnamed Item
• On the set of optimal policies in discrete dynamic programming
• On Sequential Decisions and Markov Chains
• Linear Programming in a Markov Chain
• Discrete Dynamic Programming
• On Finding Optimal Policies in Discrete Dynamic Programming with No Discounting
• An Optimality Condition for Discrete Dynamic Programming with no Discounting
• Letter to the Editor—Criterion Equivalence in Discrete Dynamic Programming
• On Linear Programming in a Markov Decision Problem
• Computing a Bias-Optimal Policy in a Discrete-Time Markov Decision Problem

This page was built for publication: A new optimality criterion for discrete dynamic programming