A primal-dual method for linear programming problems with fuzzy variables

Linear programming problems with fuzzy variables have been investigated by many researchers in the recent literature. Some methods to solve these problems, such as the primal simplex method and the dual simplex method, are based on the concept of comparison of fuzzy numbers by using ranking functions. In this paper, we give a new primal-dual algorithm for solving linear programming problems with fuzzy variables by using duality results, which was proposed by Mahdavi-Amiri and Nasseri (2007). This algorithm will be useful for sensitivity analysis when the activity vectors change for basic columns. [Received 29 September 2008; Revised 16 March 2009; Accepted 17 April 2009]