Title of article
A Revised Optimal Spanning Table Method for Expanding Competence Sets
Author/Authors
CHEN Jian-xun، نويسنده , , FENG Jun-wen، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
10
From page
73
To page
82
Abstract
The optimal expansion problem of competence sets can be solves by either mathematical programming method or table based method developed by Feng (2001). Compared to the mathematical programming method, table based method for competence set expansion is a more efficient algorithm in using relevant tableaus to solve the optimal expansion problems. This paper proposes a revised table based method to facilitate developing a computer code. A computer program, called TBM, based on the revised algorithm, was developed to solve the large scale problems of expanding competence sets. A numerical example is given, and some possible future research topics on the related theme are discussed.
Keywords
competence set expansion , spanning table method , Habitual domains
Journal title
Canadian Social Science
Serial Year
2010
Journal title
Canadian Social Science
Record number
656427
Link To Document