IJPAM: Volume 84, No. 5 (2013)
FRACTIONAL FUZZY SET COVERING PROBLEM
1Department of Mathematics
Deen Dayal Upadhyaya College
University of Delhi
Delhi, 110015, INDIA
2Department of Mathematics
University of Delhi
Delhi, 110007, INDIA
Abstract. In this paper an enumeration technique for solving linear fractional
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 fractional 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 fractional set covering problem is suggested, in order to
defuzzify the problem the concept of vector ranking function is presented further for obtaining efficient solution to the
problem, a lexicographic approach is used. A linearization technique
is used to obtain the optimal solution for crisp linear fractional set covering problem. An
illustrative example is included to demonstrate the correctness of the proposed solution algorithm.
Received: February 18, 2012
AMS Subject Classification: 05C72
Key Words and Phrases: set covering, fuzzy number, vector ranking function
Download paper from here.
DOI: 10.12732/ijpam.v84i5.3 How to cite this paper?
Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Year: 2013
Volume: 84
Issue: 5