Some new results on semi fully fuzzy linear programming problems

Abstract

There are two interesting methods, in the literature, for solving fuzzy linear programming <br />problems in which the elements of coefficient matrix of the constraints are represented by <br />real numbers and rest of the parameters are represented by symmetric trapezoidal fuzzy <br />numbers. The first method, named as fuzzy primal simplex method, assumes an initial <br />primal basic feasible solution is at hand. The second method, named as fuzzy dual simplex <br />method, assumes an initial dual basic feasible solution is at hand. In this paper, the <br />shortcomings of these methods are pointed out and to overcome these shortcomings, a new <br />method is proposed to determine the fuzzy optimal solution of such fuzzy problems. The <br />advantages of the proposed method over existing methods are discussed. To illustrate the <br />proposed method a numerical example is solved by using the proposed method and the <br />obtained results are discussed.