A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
The replacement problem can be modeled as a finite, irreducible, homogeneous Markov Chain. In our proposal, we modeled the problem using a Markov decision process and then, the instance is optimized using linear programming. Our goal is to analyze the sensitivity and robustness of the optimal solution across the perturbation of the optimal basis ( ) * B obtained from the simplex algorithm. The perturbation ( ) B can be approximated by a given matrix H such that * = + B kB H . Some algebraicdoi:10.4236/ica.2014.52006 fatcat:pt6vd72ctzcgxiwpwvmmg5qvom