Satisfying solutions for a possibilistic linear program (Q1091956): Difference between revisions

In section 1 the author defines a possibilistic variable, X, the most possible values for X, the \(\alpha\)-possible variable \(X^ 0\) and a \(\gamma\)-possible optimal \(x'\in X\), for the program: \(\max \tilde cx\), \(x\in X\), associated to the following program: \[ \max \sum_{j}\tilde c_ jx_ j,\quad \sum_{j}\tilde a_{ij}x_ j\leq \tilde b_ i,\quad x_ j\geq 0\quad (i=1,...,m,\quad j=1,...,n) \] where \(\tilde c,\tilde a,\tilde b\) are possibilistic (fuzzy) variables. A new technique to solve a possibilistic linear program with a ``satisfying solution'', is given. It is mentioned that the new strategy is a good approximation to realistic situations in the economic sciences and industrial management.