標題: OPTIMAL COMPETENCE SET EXPANSION USING DEDUCTION GRAPHS
作者: LI, HL
YU, PL
資訊管理與財務金融系 註:原資管所+財金所
Department of Information Management and Finance
關鍵字: BRANCH-AND-BOUND METHODS;COMPETENCE SETS;DEDUCTION GRAPHS;MINIMUM SPANNING TREES;HABITUAL DOMAINS
公開日期: 1-一月-1994
摘要: A competence set is a collection of skills used to solve a problem. Based on deduction graph concepts, this paper proposes a method of finding an optimal process so as to expand a decision maker's competence set to enable him to solve his problem confidently. Using the concept of minimum spanning tree, Yu and Zhang addressed the problem of the optimal expansion of competence sets. In contrast, the method proposed here enjoys the following advantages: it can deal with more general problems involving intermediate skills and compound skills; it can find the optimal solution by utilizing a 0-1 integer program; and it can be directly extended to treat multilevel competence set problems, and thus is more practically useful.
URI: http://dx.doi.org/10.1007/BF02196594
http://hdl.handle.net/11536/2665
ISSN: 0022-3239
DOI: 10.1007/BF02196594
期刊: JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
Volume: 80
Issue: 1
起始頁: 75
結束頁: 91
顯示於類別:期刊論文


文件中的檔案:

  1. A1994MU75700006.pdf