Show simple item record

dc.contributor.authorHernández Gress, Eva Selenees
dc.date.accessioned2014-06-24T21:33:26Z
dc.date.available2014-06-24T21:33:26Z
dc.date.issued2011es
dc.identifier.citationEva Selene Hernández Gress, Gilberto Pérez Lechugaes
dc.identifier.urihttps://repository.uaeh.edu.mx/bitstream/handle/123456789/15264
dc.description.abstractThe 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 algebraic relations between the optimal solution and the solution of the perturbed instance are obtained.es
dc.languageeses
dc.subjectAnálisis, Diseño y Optimización de Sistemas Sociotécnicoses
dc.titleSensitivity Analysis of the Replacement Problemes
dc.typeBook chapteres


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record