No label defined (Q3798199)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4064435
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4064435 |
Statements
1987
0 references
Markov renewal processes
0 references
optimal inspection and replacement problem
0 references
discrete-time Markovian deterioration system
0 references
finite Markov chain
0 references
fractional programming
0 references
Newton method
0 references
numerical examples
0 references
0.9060045480728148
0 references
0.88250732421875
0 references
0.8376727104187012
0 references
0.8323804140090942
0 references
[For the entire collection see Zbl 0642.00016.] An optimal inspection and replacement problem for a discrete-time Markovian deterioration system is studied. The system can pass through \(m+n\) states numbered from 1 (``the best'') to \(m+n\) (the most deteriorated state). When the system is in one of the last m deterioration states, its current state is known without inspection. A finite Markov chain, having \(m+n\) states and an upper-triangular transition probability matrix, models the deterioration process. The problem is to devise an inspection and replacement policy minimizing the sum of inspection, replacement and operating costs per unit time averaged over the infinite time horizon. The authors solve this problem using a fractional programming technique. Two computational algorithms based on the Newton method are proposed. The efficiency of these algorithms is examined for several numerical examples with different parameters.
0 references