期刊论文详细信息
Mathematics
A New Method to Optimize the Satisfaction Level of the Decision Maker in Fuzzy Geometric Programming Problems
Hadi Nasseri1  Bing-Yuan Cao2  Armita Khorsandi2 
[1] Department of Mathematics, University of Mazandaran, 47419-134767 Babolsar, Iran;Key Laboratory of Mathematics and Interdisciplinary Sciences of Guangdong, Higher Education Institutes, School of Mathematics and Information Science, Guangzhou University, Guangzhou 510006, China;
关键词: fuzzy geometric programming;    decision making;    ranking function;    trapezoidal fuzzy number;    α-efficiency;    multi-parameter confidence level;   
DOI  :  10.3390/math7050464
来源: DOAJ
【 摘 要 】

Geometric programming problems are well-known in mathematical modeling. They are broadly used in diverse practical fields that are contemplated through an appropriate methodology. In this paper, a multi-parametric vector α is proposed for approaching the highest decision maker satisfaction. Hitherto, the simple parameter α , which has a scalar role, has been considered in the problem. The parameter α is a vector whose range is within the region of the satisfaction area. Conventionally, it is assumed that the decision maker is sure about the parameters, but, in reality, it is mostly hesitant about them, so the parameters are presented in fuzzy numbers. In this method, the decision maker can attain different satisfaction levels in each constraint, and even full satisfaction can be reached in some constraints. The goal is to find the highest satisfaction degree to maintain an optimal solution. Moreover, the objective function is turned into a constraint, i.e., one more dimension is added to n-dimensional multi-parametric α . Thus, the fuzzy geometric programming problem under this multi-parametric vector α ( 0 , 1 ] n + 1 gives a maximum satisfaction level to the decision maker. A numerical example is presented to illustrate the proposed method and the superiority of this multi-parametric α over the simple one.

【 授权许可】

Unknown   

  文献评价指标  
  下载次数:0次 浏览次数:1次