Application of Intuitionistic Fuzzy Soft Matrices in Decision Making Problems
Journal Title: INTERNATIONAL JOURNAL OF MATHEMATICS TRENDS AND TECHNOLOGY - Year 2013, Vol 4, Issue 11
Abstract
Fuzzy soft matrices and intuitionistic fuzzy soft matrices have recently been applied in many fields of real life scenario. Here we introduce different types of T-product of intuitionistic fuzzy soft matrices and study its properties. Then a new methodology has been developed involving T-product to solve intuitionistic fuzzy soft set based real life decision making problems which may involve more than one decision maker. Moreover, we have presented another example of decision making problem based on one of the products of intuitionistic fuzzy soft matrices.
Authors and Affiliations
B. K. Saikia , Hiteswar Boruah , P. K. Das
Keywords
Related Articles
- EP ID EP157165
- DOI -
- Views 86
- Downloads 0
On Strongly Multiplicative Graphs
A graph G with p vertices and q edges is said to be strongly multiplicative if the vertices are assigned distinct numbers 1, 2, 3, …, p such that the labels induced on the edges by the product of the end vertices a...
Pathos Vertex Semientire Block Graph
The pathos vertex semientire block graph denoted by Pvb(G) is the graph whose vertex set is V(T) bi r and the two vertices are adjacent if and only if they are adjacent vertices, vertices lie on the blocks, vertices lie...
Generalized Hyers-Ulam Stability of a Sextic Functional Equation in Paranormed Spaces
In this paper, we obtain the general solution and prove the generalized Hyers-Ulam stability of a new sextic functional equation in paranormed spaces. We also present a counter-example for singular case.
An Inventory Model for Time Varying Holding Cost and Weibull Distribution for Deterioration with Fully Backlogged Shortages
To find optimum order quantity deterioration plays crucial role in inventory management therefore handling of deterioration is in highlight and attracted of many researchers. In this model Economic Production P roblem u...
Equivalence Of Super Magic Labelings
Let G (V, E) be a graph with p vertices and q edges. A bijection f : V E {1,2,…., p+q} is called a super magic labeling of a graph G, if f(V) = {1, 2,…., p} and for any edge xyE, f(x)+f(y)+f(xy) = c(f), a const...