solving fuzzy linear programming problems with linearmembership functions-revisited

Recently, gasimov and yenilmez proposed an approach for solving two kinds of fuzzy linear programming (flp) problems. through the approach, each flp problem is rst defuzzi ed into an equivalent crisp problem which is non-linear and even non-convex. then, the crisp problem is solved by the use of the modi ed subgra- dient method. in this paper we will have another look at the earlier defuzzi cation process developed by gasimov and yenilmez in view of a perfectly acceptable remark in fuzzy contexts. furthermore, it is shown that if the modi ed defuzzi cation process is used to solve flp problems, some interesting results are appeared.