Dual simplex method for solving fully fuzzy linear programming problems

This study proposes a novel technique for solving linear programming problems in a fully fuzzy environment. A modified version of the well-known dual simplex method is used for solving fuzzy linear programming problems. The use of a ranking function together with the Gaussian elimination process helps in solving linear programming problems in a fully uncertain environment. The proposed algorithm is flexible, easy and reasonable.