•  
  •  
 

Abstract

In this paper, we concentrate on linear programming problems in which both the right-hand side and the technological coefficients are fuzzy numbers. We consider here only the case of fuzzy numbers with linear membership functions. The symmetric method of Bellman and Zadeh (1970) is used for a defuzzification of these problems. The crisp problems obtained after the defuzzification are non-linear and even non-convex in general. We propose here the "modified subgradient method" and "method of feasible directions" and uses for solving these problems see Bazaraa (1993). We also compare the new proposed methods with well known "fuzzy decisive set method". Finally, we give illustrative examples and their numerical solutions.

Share

COinS