FUZZY SOFT SET AND ITS APPLICATION IN SELECTING BEST CANDIDATE(S) FOR A JOB USING AGGREGATE FUZZY SET APPROACH
Keywords:
Fuzzy set, Soft set, Fuzzy soft set, AND Operation, OR Operation, Aggregation.Abstract
Molodtsov in 1999 introduced the concept of soft set theory as a general mathematical tool for handling uncertainties about vague concepts. In this paper, we recalled the definitions of soft set, fuzzy set and some basic operations in soft set. We presented the definition of fuzzy soft set and contributed some related algebraic properties with illustrative examples. We also defined extended intersection, restricted union, AND product, OR product and proved that associative laws holds with respect to AND and OR products. De Morgan’s laws and inclusions were stated and proved in the background of fuzzy soft set with respect to various operations with some relevant examples. Finally, we presented the application of fuzzy soft set in multicriteria decision making in choosing a best candidate for a job using aggregate fuzzy set technique.
2010 AMS Classification: 03E70, 03E04.
References
Balogun, F. and Tella, Y. (2017). Some aspects of partially ordered multisets. Theoretical Mathematics & Applications, 7(4):1-16.
Blizard, W. (1989). Multiset theory. Notre Dame Journal of Formal Logic, 30: 36-66.
Conder, M., Marshall, S., and Slinko, A. (2007). Orders on multisets and discrete cones. Order, 24:277-296.
Dilworth, R.P. (1950). A decomposition theorem for partially ordered sets. Annals of Mathematics, 51(1): 161-166. doi: 10.2307/1969503.
Dushnik, B., and Miller, E.W. (1941). Partially ordered sets. American Journal of Mathematics, 63: 600-610.
Felsner, S., Trotter, W. T., and Wiechert, V. (2015). The dimension of posets with planar cover graphs. Graphs and Combinatorics, 31(4): 927-939.
Girish, K. P, and Sunil, J. J. (2009). General relationship between partially ordered multisets and their chains and antichains. Mathematical communications, 14(2): 193-205.
Hiraguchi, T. (1951). On the dimension of partially ordered sets. Science Report of Kanazawa University, 1: 77-94.
Joret, G., Micek, P., Milans, K. G., Trotter, W. T., Walczak, B., and Wang, R. (2016). Tree-Width and Dimension. Combinatorica, 36(4):431-450.
Kelly, D. (1981). On the dimension of partially ordered sets. Discrete Math., 35:135-156.
Kierstead, H. A., and Trotter, W. T. (1985). Inequalities for the greedy dimensions of ordered sets. Order, 2: 145-164.
Kierstead, H. A., Trotter, W. T., and Zhou, B. (1987). Representing an ordered set as the intersection of super greedy linear extensions. Order, 4: 293-311.
Kilibarda, G., and Jovovic, V. (2004). Antichains of multisets. Journal of integer sequences, 7(1), Article 04.1.5
Singh, D., and Isah, A. I. (2016). Mathematics of multisets: a unified approach. Afri. Mat., 27(1): 1139-1146.
Singh, D., Ibrahim, A.M., Yohanna, T., and Singh, J.N. (2007). An overview of the applications of multisets. Novi Sad Journal of Mathematics, 37(2): 73-92.
Streib, N., and Trotter, W. T. (2014). Dimension and height for posets with planar cover graphs. European Journal of Combinatorics, 35: 474-489.
Szpilrajn E., (1930). Sur’l extension de l’order partiel. Fund. Math, 16: 386-389.
Published
How to Cite
Issue
Section
FUDMA Journal of Sciences
