A new optimality criterion for discrete dynamic programming

DOI10.1016/0022-247X(72)90261-2MaRDI QIDQ2551744zbMATH OpenFDO

Authors Yoshio Tabata, Hisashi Mine

Publication date 1972

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(72)90261-2

Mathematics Subject Classification ID

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

Cites work

• An Optimality Condition for Discrete Dynamic Programming with no Discounting
• Computing a Bias-Optimal Policy in a Discrete-Time Markov Decision Problem
• Discrete Dynamic Programming
• scientific article; zbMATH DE number 3148886 (Why is no real title available?)
• Letter to the Editor—Criterion Equivalence in Discrete Dynamic Programming
• Linear Programming in a Markov Chain
• On Finding Optimal Policies in Discrete Dynamic Programming with No Discounting
• On Linear Programming in a Markov Decision Problem
• On sequential decisions and Markov chains
• On the set of optimal policies in discrete dynamic programming

Cited in

(1)

• Some remarks on the new optimality criterion of Mine and Tabata

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

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