In this paper, the fuzzy dual matrix system as AX + B = CX + D in which A, B, C, D, X are LR fuzzy matrices is studied. At first we solve 1-cut system in order to find the core of LR fuzzy solution; then to obtain the spreads of the LR fuzzy solution, we discuss in several cases. The spreads are obtained by using multiplication, quasi norm and minimization problem with a special objective funct...

in this paper we present a method for solving fuzzy linear systemsby two crisp linear systems. also necessary and sufficient conditions for existenceof solution are given. some numerical examples illustrate the efficiencyof the method.

in this paper, the notions of $(t,s)$-composition matrix and$(t,s)$-interval-valued intuitionistic fuzzy equivalence matrix areintroduced where $(t,s)$ is a dual pair of triangular module. theyare the generalization of composition matrix and interval-valuedintuitionistic fuzzy equivalence matrix. furthermore, theirproperties and characterizations are presented. then a new methodbased on $tilde{...

In this paper, the notions of $(T,S)$-composition matrix and$(T,S)$-interval-valued intuitionistic fuzzy equivalence matrix areintroduced where $(T,S)$ is a dual pair of triangular module. Theyare the generalization of composition matrix and interval-valuedintuitionistic fuzzy equivalence matrix. Furthermore, theirproperties and characterizations are presented. Then a new methodbased on $tilde{...

there are two interesting methods, in the literature, for solving fuzzy linear programming problems in which the elements of coefficient matrix of the constraints are represented by real numbers and rest of the parameters are represented by symmetric trapezoidal fuzzy numbers. the first method, named as fuzzy primal simplex method, assumes an initial primal basic feasible solution is at hand. t...

this paper analyzes a linear system of equations when the righthandside is a fuzzy vector and the coefficient matrix is a crisp m-matrix. thefuzzy linear system (fls) is converted to the equivalent crisp system withcoefficient matrix of dimension 2n × 2n. however, solving this crisp system isdifficult for large n because of dimensionality problems . it is shown that thisdifficulty may be avoide...

To tackle the problem with inexact, uncertainty and vague knowl- edge, constructive method is utilized to formulate lower and upper approx- imation sets. Rough set model over dual-universes in fuzzy approximation space is constructed. In this paper, we introduce the concept of rough set over dual-universes in fuzzy approximation space by means of cut set. Then, we discuss properties of rough se...

There are two interesting methods, in the literature, for solving fuzzy linear programming problems in which the elements of coefficient matrix of the constraints are represented by real numbers and rest of the parameters are represented by symmetric trapezoidal fuzzy numbers. The first method, named as fuzzy primal simplex method, assumes an initial primal basic feasible solution is at hand. T...

The main aim of this paper intends to discuss the solution of general dual fuzzy linear system (GDFLS) C BX F AX + = + where A , B are real n m× matrix , F and C are fuzzy vectors, and the unknown vector X is a vector consisting of n fuzzy numbers, by a special algorithm based on a class of ABS algorithms called Huang algorithm. In special case, we apply the proposed algorithm for the solution ...