The reverse problem of discrete time Markov chains analysis was defined. During the problem solution it is needed to restore the transition probabilities matrix based on the final system probabilities of being in each state. It is proposed to consider the problem as incorrect inverse problem. The smallest module method was selected as criterion of solution quality. A computational procedure for finding the solution based on a combination of research method parameter space and flexible polyhedron method. Paper contains examples of proposed procedure application.
discrete time Markov chainsfinal states, states distribution, Markov process transition matrix, incorrect reverse problem, smallest module method, method of states parameters reserach, flexible polyhedron method