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 program- ming 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 al- gorithm 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Pure and Apllied Mathematics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
