نتایج جستجو برای: objective possibilistic programming
تعداد نتایج: 869300 فیلتر نتایج به سال:
we present a new model and a new approach for solving fuzzylinear programming (flp) problems with various utilities for the satisfactionof the fuzzy constraints. the model, constructed as a multi-objective linearprogramming problem, provides flexibility for the decision maker (dm), andallows for the assignment of distinct weights to the constraints and the objectivefunction. the desired solutio...
the problem of staff scheduling at a truck hub for loading and stripping of the trucks is an important and difficult problem to optimize the labor efficiency and cost. the trucks enter the hub at different hours a day, in different known time schedules and operating hours. in this paper, we propose a goal programming to maximize the labor efficiency via minimizing the allocation cost. the propo...
in this paper, the cost and income efficiency models have been considered with regard to the multiple objective programming structures. for finding the efficient points in purposed molp problem, some various methods like lexicography & the weighted sum can be used. so by introducing the molp problem the cost & income efficiencies will be achieved. in the present study, the molp problem ...
This paper uses the concept of possibilistic risk aversion to propose a new approach for portfolio selection in fuzzy environment. Using possibility theory, the possibilistic mean, variance, standard deviation and risk premium of a fuzzy number are established. Possibilistic Sharpe ratio is defined as the ratio of possibilistic risk premium and possibilistic standard deviation of a portfolio. T...
A generalized approach to possibilistic clustering algorithms was proposed in [19], where the memberships are evaluated directly according to the data information using the fuzzy set theory, and the cluster centers are updated via a performance index. The computational experiments based on the generalized possibilistic clustering algorithms in [19] revealed that these clustering algorithms coul...
The design of closed-loop supply chain networks has attracted more attention in recent years according to business and environmental factors. The significance of accounting for uncertainty and risk in such networks spurs an interest to develop appropriate decision making tools to cope with uncertain and imprecise parameters in closed-loop supply chain network design problems. This paper propose...
The knowledge about available resources during highlevel synthesis is usually imprecise. Previous methods seem to have ignored this fact, possibly to avoid an increase in the, already high, computational complexity. In this paper an approach based on so called “‘possibilistic” programming, a kind of fuzzy mathematical programming, is presented. Using this method we can improve existing mathemcl...
We show that possibilistic quadratic programs with crisp decision variables and continuous fuzzy number coefficients are well-posed, i.e. small changes in the membership function of the coefficients may cause only a small deviation in the possibility distribution of the objective function.
data envelopment analysis (dea) is a nonparametric approach to estimate relative efficiency of decision making units (dmus). dea and is one of the best quantitative approach and balanced scorecard (bsc) is one of the best qualitative method to measure efficiency of an organization. since simultaneous evaluation of network performance of the quad areas of bsc model is considered as a necessity a...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید