Denumerable Undiscounted Semi-Markov Decision Processes with Unbounded Rewards
DOI10.1287/moor.8.2.298zbMath0513.90085OpenAlexW2107037985MaRDI QIDQ3659555
Awi Federgruen, Paul J. Schweitzer, Henk C. Tijms
Publication date: 1983
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/020c3d56efa52984f29da56397cc92dbc883bea4
inventory modelcountable state spaceoptimality equationsrecurrence conditionunbounded rewardsreplacement modelapplication of a fixed point theoremaverage return per unit timesolution existence proofundiscounted semi-Markov decision models
Applications of mathematical programming (90C90) Reliability, availability, maintenance, inspection in operations research (90B25) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39) Fixed-point and coincidence theorems (topological aspects) (54H25) Markov and semi-Markov decision processes (90C40)
Related Items
This page was built for publication: Denumerable Undiscounted Semi-Markov Decision Processes with Unbounded Rewards