Optimization and perturbation analysis in the stationary distribution of a Markov Chain

We consider a stationery distribution of a finite, irreducible, homogeneous Markov Chain. Our aim is to pertub the transition probabilities matrix using approximations to fin regions of feasibility and oiptimality for a given basis when the chain is optimized using linear programming. We also explore the application of perturbations bonds and analyze the effects of these on the construction of optimal policies.