Optimal competence set expansion using deduction graphs

DOI10.1007/BF02196594zbMath0792.90002OpenAlexW1968602537MaRDI QIDQ1321446

V. Pereyra

Publication date: 25 July 1994

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02196594

zbMATH Keywords

branch-and-boundminimum spanning treehabitual domainscompetence setdeduction graphs

Mathematics Subject Classification ID

Decision theory (91B06) Applications of mathematical programming (90C90) Boolean programming (90C09)

Related Items (13)

Multicriteria-multistage planning for the optimal path selection using hybrid genetic algorithms ⋮ Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case ⋮ Multiobjective fuzzy competence set expansion problem by multistage decision-based hybrid genetic algorithms ⋮ Acquisition of compound skills and learning costs for expanding competence sets ⋮ Optimal expansion and design of competence sets with asymmetric acquiring costs ⋮ Grey relational analysis and radial basis function network for determining costs in learning sequences ⋮ Minimum spanning table and optimal expansion of competence set ⋮ Dynamic multiple criteria decision making in changeable spaces: from habitual domains to innovation dynamics ⋮ Dynamic MCDM, Habitual Domains and Competence Set Analysis for Effective Decision Making in Changeable Spaces ⋮ Optimal expansion of competence sets with intermediate skills and compound nodes ⋮ Optimal multiple stage expansion of competence set ⋮ Using competence sets to analyze the consumer decision problem ⋮ Expanding competence sets for the consumer decision problem

Uses Software

• LINDO

Cites Work

• A foundation for competence set analysis
• Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
• Marginal analysis for competence set expansion
• Deduction graphs: an algorithm and applications
• Optimal Expansion Of Competence Sets And Decision Support
• Solving Mixed Integer Programming Problems Using Automatic Reformulation

This page was built for publication: Optimal competence set expansion using deduction graphs