Fractional programming approach to fuzzy weighted average

被引:159
作者
Kao, C [1 ]
Liu, ST
机构
[1] Natl Cheng Kung Univ, Dept Ind Management, Tainan 70101, Taiwan
[2] Van Nung Inst Technol, Dept Ind Management, Chungli 320, Taiwan
关键词
fuzzy weighted average; fractional programming; parametric programming; decision analysis;
D O I
10.1016/S0165-0114(99)00137-2
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper proposes a fractional programming approach to construct the membership function for fuzzy weighted average. Based on the alpha -cut representation of fuzzy sets and the extension principle, a pair of fractional programs is formulated to find the alpha -cut of fuzzy weighted average. Owing to the special structure of the fractional programs, in most cases, the optimal solution can be found analytically. Consequently, the exact form of the membership function can be derived by taking the inverse function of the alpha -cut. For other cases, a discrete but exact solution to fuzzy weighted average is provided via an efficient solution method. Examples are given for illustration. (C) 2001 Elsevier Science BY. All rights reserved.
引用
收藏
页码:435 / 444
页数:10
相关论文
共 15 条
[1]  
[Anonymous], 1979, DECISION MAKING UNCE
[2]  
[Anonymous], 1991, FUZZY SET THEORY ITS
[3]   RATING AND RANKING OF MULTIPLE-ASPECT ALTERNATIVES USING FUZZY SETS [J].
BAAS, SM ;
KWAKERNAAK, H .
AUTOMATICA, 1977, 13 (01) :47-58
[4]  
Bazaraa M.S., 2013, Nonlinear Programming-Theory and Algorithms, V3rd
[5]  
BAZARAA MS, 1990, LINEAR PROGRAMMING N
[6]  
Charnes A., 1962, Naval Res Logist Quart, V9, P181, DOI [10.1002/nav.3800090303, DOI 10.1002/NAV.3800090303]
[7]  
Cleland D.I., 1981, ENG MANAGEMENT
[8]  
Dantzig G. B., 1963, LINEAR PROGRAMMING E
[9]   FUZZY WEIGHTED AVERAGES AND IMPLEMENTATION OF THE EXTENSION PRINCIPLE [J].
DONG, WM ;
WONG, FS .
FUZZY SETS AND SYSTEMS, 1987, 21 (02) :183-199
[10]   Fuzzy weighted average: A max-min paired elimination method [J].
Guh, YY ;
Hon, CC ;
Wang, KM ;
Lee, ES .
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1996, 32 (08) :115-123