期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Ranking Method for Complementary Judgment Matrixes with Fuzzy Numbers Based on Hausdorff Metric Distance 被引量:1
1
作者 侯福均 吴祈宗 《Journal of Beijing Institute of Technology》 EI CAS 2005年第4期458-461,共4页
A method for ranking complementary judgment matrixes with traspezoidal fuzzy numbers based on Hausdorff metric distance and fuzzy compromise decision approach is proposed. With regard to fuzzy number complementary jud... A method for ranking complementary judgment matrixes with traspezoidal fuzzy numbers based on Hausdorff metric distance and fuzzy compromise decision approach is proposed. With regard to fuzzy number complementary judgment matrixes given by a decider group whose members have various weights, the expert's information was aggregated first by means of simple weight average(SWA) method and Bonissone calculational method. Hence a matrix including all the experts' preference information was got. Then the matrix' column members were added up and the fuzzy evaluation values of the alternatives were got. Lastly, the Hausdorff metric distance and fuzzy compromise decision approach were used to rank the fuzzy evaluation values and then the ranking values of all the alternatives were got. Because exact numbers and triangular fuzzy numbers could all be transformed into trapezoidal fuzzy numbers, the method developed can rank complementary judgment matrixes with trapezoidal fuzzy numbers, triangular fuzzy numbers and exact numbers as well. An illustrative example is also given to verify the developed method and to demonstrate its feasibility and practicality. 展开更多
关键词 complementary judgment matrix trapezoidal fuzzy number Bonissone calculational method fuzzy compromise decision approach Hausdorff metric distance
下载PDF
A Compromise Approach to Lexicographic Optimal Solution in Multiple Objective Programming
2
作者 XU Jiuping Department of Applied Mathematics, Chengdu University of Science and Technology, Chengdu, 610065 SHI Yong College of Business Administration, University of Nebraska at Omaha,Omaha, NE 68182, USA 《Systems Science and Systems Engineering》 CSCD 1997年第3期62-67,共6页
In this paper we use a compromise approach to identify a lexicographic optimal solution of a multiple objective programming (MOP) problem. With this solution concept, we first find the maximization of each objection f... In this paper we use a compromise approach to identify a lexicographic optimal solution of a multiple objective programming (MOP) problem. With this solution concept, we first find the maximization of each objection function as the ideal value. Then, we construct a lexicographic order for the compromise (differences) between the ideal values and objective functions. Based on the usually lexicographic optimality structure, we discuss some theoretical properties about our approach and derive a constructing algorithm to compute such a lexicographic optimal solution. 展开更多
关键词 multiple objective programming compromise approach lexicographic optimal solution algorithm
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部