Abstract. In this paper a method for solving linear fuzzy set covering problem is defined. Set covering problems belong to the class of 0-1 integer programming problems that are NP-complete. Many applications arises having the set covering problems, switching theory, testing of VLSI circuits and line balancing often take on a set covering structure. Linear set covering problems involving coefficients in the objective function with some lack of precision are usual. To solve them several approaches have been proposed. In this paper a solution algorithm to fuzzy linear set covering problem is suggested. In order to defuzzify the problem the concept of vector ranking function is given and for obtaining efficient solution to the problem, an algorithm is constructed with a weighted sum approach.An example is illustrated to demonstrate the correctness of the proposed solution algorithm.

Received: December 26, 2011

AMS Subject Classification:

Key Words and Phrases: set covering, fuzzy number, vector ranking function

Download paper from here.