A Study on the Algorithms of Interpretive Structural Modeling
解释结构建模算法的研究

This paper discusses some aspects of the algorithms in the interpretive structural modeling process. First, it clarifies the mistake and paradox existed in a previous algorithm. Based upon the above analysis, the paper presents a new algorithm named as algorithm 1, by which the identification of cycle subsets can be made without the level partition. Then a theorem about cycle subsets and its corollary are proofed and the other algorithm named as algorithm 2 is put forward, which has many advantages to identify cycle subsets. The example shows that complexity in ISM can be reduced greatly by utilizing the proposed algorithms. Finally, some useful conclusions are reached.