Abstract
This paper provides a method for finding the optimal expansion process of the competence set in generalized situations in which the cost functions are asymmetric and the directed graphs, which depict all possible expansion processes, have cycles and contain intermediate skills and compound nodes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Yu, P. L., Forming Winning Strategies: An Integrated Theory of Habitual Domains, Springer Verlag, Berlin, Germany, 1990.
Yu, P. L., and Zhang, D., A Foundation for Competence Set Analysis, Mathematical Social Sciences, Vol. 20, pp. 251–299, 1990.
Yu, P. L., and Zhang, D., Optimal Expansion of Competence Set and Decision Support, Information Systems and Operational Research, Vol. 30, pp. 68–84, 1992.
Yu, P. L., and Zhang, D., A Marginal Analysis for Competence Set Expansion, Journal of Optimization Theory and Applications, Vol. 76, pp. 87–109, 1993.
Shi, D. S., and Yu, P. L., Optimal Expansion and Design of Competence Sets with Asymmetric Acquiring Costs, Journal of Optimization Theory and Applications, Vol. 88, pp. 643–658, 1996.
Li, H. L., and Yu, P. L., Optimal Competence Set Expansion Using Deduction Graphs, Journal of Optimization Theory and Applications, Vol. 80, pp. 75–91, 1994.
Taha, H. A., Integer Programming Theory, Applications, and Computations, Academic Press, New York, New York, 1975.
Schrahe, L., Linear, Integer, and Quadratic Programming with LINDO, Scientific Press, Palo Alto, California, 1984.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Shi, D.S., Yu, P.L. Optimal Expansion of Competence Sets with Intermediate Skills and Compound Nodes. Journal of Optimization Theory and Applications 102, 643–657 (1999). https://doi.org/10.1023/A:1022654207989
Issue Date:
DOI: https://doi.org/10.1023/A:1022654207989