In the typical type of ANP with a matrix U evaluating alternatives by criteria and a matrix W evaluating criteria by alternatives in the so-called supermatrix S, W is often said to be unstable. Here, we propose a method to revise W into a stable (W) over tilde and to calculate the weights of criteria and alternatives at the same time under the revised supermatrix S. Our method is formulated as an optimization problem based on Bayes Theorem which T.L. Saaty claimed to be included in ANP scheme. Concurrent Convergence method developed by Kinoshita and Nakanishi also intends to be correct W, but this method includes some contradictions. We prove that our method has no such contradiction. We introduce some eigenvalue problems, which give a lower bound of our optimal value and their special cases coincide with our problem. Furthermore, we clear what perturbations of W preserve weights of criteria and alternatives to be invariant under the concept of inactive alternatives.