A revised minimum spanning table method for optimal expansion of competence sets

Abstract

Competence set analysis is a new approach to solve an import aspect of challenging MCDM problems. Thus, many researchers have developed efficient methods for solving the optimal expansion of competence sets (please see the references). The minimum spanning table method (MST) proposed by Feng and Yu (1997) is an efficient algorithm using spreadsheet tableaus to solve optimal expansion problems. In order to develop a computer program, in this paper, we propose the revised algorithm of MST, which can efficiently solve the optimal expansion problems. We develop a user-friendly program called MINST, which can solve fairly large-scale expanding problems even with PC of pentium 133.