This paper presents a novel approach for performance appraisal and ranking of decision-making units (DMUs) with two-stage network structure in the presence imprecise vague data. In order to achieve this goal, data envelopment analysis (DEA) model, adjustable possibilistic programming (APP), chance-constrained (CCP) are applied propose new fuzzy (FNDEA) approach. The main advantages proposed FND...

convexity theory and duality theory are important issues in math- ematical programming. within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. finally,...

abstract it is the purpose of this article to introduce a linear approximation technique for solving a fractional chance constrained programming (cc) problem. for this purpose, a fuzzy goal programming model of the equivalent deterministic form of the fractional chance constrained programming is provided and then the process of defuzzification and linearization of the problem is started. a samp...

It is well known that Data Envelopment Analysis (DEA) is a relative efficiency measurement tool, which uses optimization techniques to automatically calculate the weights assigned to the crisp deterministic multiple inputs and outputs of a set of the Decision Making Units (DMUs) being assessed. However, crisp deterministic data requirement delimits an application to the real world problems wher...

Convexity theory and duality theory are important issues in math- ematical programming. Within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. Furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. Finally,...

in this paper, a model of an optimal control problem with chance constraints is introduced. the parametersof the constraints are fuzzy, random or fuzzy random variables. todefuzzify the constraints, we consider possibility levels.  bychance-constrained programming the chance constraints are converted to crisp constraints which are neither fuzzy nor stochastic and then the resulting classical op...

Abstract It is the purpose of this article to introduce a linear approximation technique for solving a fractional chance constrained programming (CC) problem. For this purpose, a fuzzy goal programming model of the equivalent deterministic form of the fractional chance constrained programming is provided and then the process of defuzzification and linearization of the problem is started. A sam...

stochastic approach to vehicle routing problem: development and theories abstract in this article, a chance constrained (ccp) formulation of the vehicle routing problem (vrp) is proposed. the reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. knowing that reliable computer software for lar...