An $O(N^3 )$ Algorithm for Optimal Replacement Problems

DOI10.1137/0322058zbMath0556.90023OpenAlexW1970401740MaRDI QIDQ3220052

Shmuel Gal

Publication date: 1984

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0322058

zbMATH Keywords

computational complexityoptimal replacement policypolicy iterationsMarkovian deterioration

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Reliability, availability, maintenance, inspection in operations research (90B25) Markov and semi-Markov decision processes (90C40)

Related Items (2)

Derman's book as inspiration: some results on LP for MDPs ⋮ Optimal replacement policy for multicomponent systems: An application to a dairy herd

This page was built for publication: An $O(N^3 )$ Algorithm for Optimal Replacement Problems