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

DOI10.1137/0322058MaRDI QIDQ3220052zbMATH OpenOpenAlexFDO

Authors 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 complexityMarkovian deteriorationoptimal replacement policypolicy iterations

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)

Recommendations

• scientific article; zbMATH DE number 3843469
• Optimal replacement for fault-tolerant systems
• An improved algorithm for the computation of the optimal repair/replacement policy under general repairs
• scientific article; zbMATH DE number 4064435
• Optimal cost and policy for a Markovian replacement problem

Cited in

(6)

• Optimal replacement policy for multicomponent systems: An application to a dairy herd
• Linear programming solution for Markovian deterioration with uncertain information
• scientific article; zbMATH DE number 3843469 (Why is no real title available?)
• scientific article; zbMATH DE number 4020821 (Why is no real title available?)
• A note on the optimal replacement problem
• Derman's book as inspiration: some results on LP for MDPs

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

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