Solving fully fuzzy Linear Programming Problem using Breaking Points

In this paper we have investigated a fuzzy linear programming problem with fuzzy quantities which are LR triangular fuzzy numbers. The given linear programming problem is rearranged according to the satisfactory level of constraints using breaking point method. By considering the constraints, the arranged problem has been investigated for all optimal solutions connected with satisfactory level of quantities on all intervals that constituted from breaking points of the constraints. Optimal solution could be obtained on the constructed [g p-1 , g p] intervals for p=1,2… Here the fuzzy primal simplex algorithm is designed based on revised TSAO’s ranking method.