Possibilistic linear programming with triangular fuzzy numbers (Q5903641)

A problem of fuzzy linear programming is studied: \[ (1)\quad \max /\min \quad Z=Cx,\quad s.t.\quad A_ ix\leq B_ i\quad (i=1,2,...,m), \] \(x=(x_ 1,x_ 2,...,x_ n)\in R^ n\), where \(C,A_{i1},A_{i2},...,A_{in}\) \((=A_ i)\), \(B_ i\) are viewed as triangular fuzzy numbers defined in R. Define \[ \pi (a_ i,b_ i):= \min A_{i1}(a_{i1}), A_{i2}(a_{i2}), ..., A_{in}(a_{in}), B_ i(b_ i)) \] and \[ \pi(c):= \min (C_ 1(c_ 1), C_ 2(c_ 2), ..., C_ n(c_ n)) \] with \(a_ i= (a_{i1}, a_{i2}, ..., a_{in})\in R^ n\), \(c=(c_ 1,c_ 2,...,c_ n)\in R^ n\). In the sequel the following possibilities are introduced: (2) \(Poss(x\in F_ i)=\sup (\pi (a_ i,b_ i)| a_ ix\leq b_ i)\) (2') \(Poss(x\in F)=\min_{1\leq i\leq m}Poss(x\in F_ i)\) (3) \(Poss(Z=z| x)=\sup (\pi (c)| cx=z)\), and (4) \(Poss(Z=z)=\sup (\min (Poss(Z=z| x)\), Poss(X\(\in F))).\) It is pointed out that for the programming problem (1) a determination of (2) and (3) can be achieved in an analytical fashion while (4) yields a nonlinear programming problem.