نتایج جستجو برای: multiple objective fractional programming
تعداد نتایج: 1607300 فیلتر نتایج به سال:
This paper deals with priority based fuzzy goal programming approach for solving multi-objective linear fractional programming problem. In the model formulation of the problem, we construct the fractional membership functions by determining the optimal solution of the objective functions subject to the system constraints. The fractional membership functions are then transformed into equivalent ...
Traditional Data Envelopment Analysis (DEA) models evaluate the efficiency of decision making units (DMUs) with common crisp input and output data. However, the data in real applications are often imprecise or ambiguous. This paper transforms fuzzy fractional DEA model constructed using fuzzy arithmetic, into the conventional crisp model. This transformation is performed considering the goal pr...
In this paper, a quadratic programming (FFQP) problem is considered in which all of the cost coefficients, constraints coefficients, and right hand side of the constraints are characterized by L-R fuzzy numbers. Through this paper, the concept of α- level of fuzzy numbers for the objective function, and the order relations on the fuzzy numbers for the constraints are considered. To optimize th...
When a fractional criterion is to be described by linguistic variables two kinds of approaches are possible: to treat it as a unity (nominator/denominator) and to construct a classic membership function or to aggregate the membership functions separately associated to nominator and denominator respectively. In the paper, two propositions are formulated related to choosing possibilities of aggre...
a characteristic of data envelopment analysis (dea) is to allow individual decision making units (dmus) to select the factor weights which are the most advantageous for them in calculating their efficiency scores. this flexibility in selecting the weights, on the other hand, deters the comparison among dmus on a common base. for dealing with this difficulty and assessing all the dmus on the sam...
a characteristic of data envelopment analysis (dea) is to allow individual decision making units (dmus) to select the factor weights that are the most advantages for them in calculating their efficiency scores. this flexibility in selecting the weights, on the other hand, deters the comparison among dmus on a common base. for dealing with this difficulty and assessing all the dmus on the same s...
In this paper, we integrate goal programming (GP), Taylor Series, Kuhn-Tucker conditions and Penalty Function approaches to solve linear fractional bi-level programming (LFBLP)problems. As we know, the Taylor Series is having the property of transforming fractional functions to a polynomial. In the present article by Taylor Series we obtain polynomial objective functions which are equivalent to...
a characteristic of data envelopment analysis (dea) is to allow individual decision making units (dmus) to select the factor weights which are the most advantageous for them in calculating their efficiency scores. this flexibility in selecting the weights, on the other hand, deters the comparison among dmus on a common base. for dealing with this difficulty and assessing all the dmus on the sam...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید