FUZZY LINEAR FRACTIONAL SET COVERING PROBLEM WITH IMPRECISE COSTS

被引:0
|
作者
Gupta, Rashmi [1 ]
Saxena, Ratnesh Rajan [2 ]
机构
[1] Univ Delhi, Dept Math, Delhi 110007, India
[2] Univ Delhi, Deen Dayal Upadhyaya Coll, Dept Math, New Delhi 110015, India
关键词
Fuzzy fractional set covering problem; alpha-optimal solution; fuzzy solution;
D O I
10.1051/ro/2014015
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Set covering problems are in great use these days, these problems are applied in many disciplines such as crew scheduling problems, location problems, testing of VLSI circuits, artificial intelligence etc. In this paper alpha-acceptable optimal solution is given for the fuzzy linear fractional set covering problem where fuzziness involved in the objective function. At first the fuzzy linear fractional problem is being converted in to crisp parametric linear fractional set covering problem then a linearization technique is used to obtain an optimal solution to this parametric problem. This optimal solution will also be the fuzzy optimal solution for the original problem. An example is also provided to illustrate the algorithm.
引用
收藏
页码:415 / 427
页数:13
相关论文
共 50 条
  • [41] Solution Algorithm of the Fuzzy Fractional Bilevel Linear Programming Problem
    Amiri, Neda
    Hamidi, Farhad
    Nehi, Hassan Mishmast
    2015 4th Iranian Joint Congress on Fuzzy and Intelligent Systems (CFIS), 2015,
  • [42] A Solution Procedure for a Linear Fractional Programming Problem with Fuzzy Numbers
    Mehlawat, Mukesh Kumar
    Kumar, Santosh
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON SOFT COMPUTING FOR PROBLEM SOLVING (SOCPROS 2011), VOL 1, 2012, 130 : 1037 - 1049
  • [43] Sensitivity analysis in fuzzy multiobjective linear fractional programming problem
    Gupta, P
    Bhatia, D
    FUZZY SETS AND SYSTEMS, 2001, 122 (02) : 229 - 236
  • [44] SENSITIVITY ANALYSIS IN FUZZY LINEAR FRACTIONAL-PROGRAMMING PROBLEM
    DUTTA, D
    RAO, JR
    TIWARI, RN
    FUZZY SETS AND SYSTEMS, 1992, 48 (02) : 211 - 216
  • [45] Approximation of the quadratic set covering problem
    Escoffier, Bruno
    Hammer, Peter L.
    DISCRETE OPTIMIZATION, 2007, 4 (3-4) : 378 - 386
  • [46] A note on the Clustered Set Covering Problem
    Alfandari, Laurent
    Monnot, Jerome
    DISCRETE APPLIED MATHEMATICS, 2014, 164 : 13 - 19
  • [47] A rough set method for the unicost set covering problem
    Qingyuan Xu
    Anhui Tan
    Yaojin Lin
    International Journal of Machine Learning and Cybernetics, 2017, 8 : 781 - 792
  • [48] ENUMERATIVE TECHNIQUE FOR SET COVERING PROBLEM
    ARORA, SR
    SWARUP, K
    PURI, MC
    NEW ZEALAND OPERATIONAL RESEARCH, 1977, 5 (02): : 119 - 128
  • [49] A genetic algorithm for the set covering problem
    Beasley, JE
    Chu, PC
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 94 (02) : 392 - 404
  • [50] Relaxation heuristics for the set covering problem
    Umetani, Shunji
    Yagiura, Mutsunori
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 2007, 50 (04) : 350 - 375