Optimal competence set expansion using deduction graphs

Han-Lin Li*, P. L. Yu

*Corresponding author for this work

Research output: Contribution to journalArticle

38 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)75-91
Number of pages17
JournalJournal of Optimization Theory and Applications
Volume80
Issue number1
DOIs
StatePublished - 1 Jan 1994

Keywords

  • Branch-and-bound methods
  • competence sets
  • deduction graphs
  • habitual domains
  • minimum spanning trees

Fingerprint Dive into the research topics of 'Optimal competence set expansion using deduction graphs'. Together they form a unique fingerprint.

  • Cite this