Nondominated solutions in a fully fuzzy linear programming problem

In this work, a new method is presented for locating fuzzy optimal (nondominated) solutions of a fully fuzzy linear programming problem with inequality constraints and triangular fuzzy numbers, not necessarily symmetric, without ranking functions, by means of solving a multiobjective linear problem. An equivalence is proved between the set of nondominated solutions of the fully fuzzy linear programming problem and the set of weakly efficient solutions of the considered and related multiobjective linear problem. An algorithm is provided to generate nondominated solutions of a fully fuzzy linear programming problem, as well as an example to illustrate it.