The non-differentiability and implicit definition of boundary of production possibility set (PPS) in data envelopment analysis (DEA) are two important difficulties for obtaining directional characteristics, including different elasticity measures and marginal rates of substitution. Also, imposing weight restrictions in DEA models have some shortcomings and misunderstandings. In this paper we ut...

Data Envelopment Analysis (DEA) is one of the best methods for measuring the efficiency and productivity of Decision Making Units (DMU). Evaluating the efficiency of DMUs which have two or several stages by using the conventional DEA models, is equal to consider them as black box. This method, omits the effect of intermediate measure on efficiency. Therefore, just the first network inputs and t...

One of the important issues in data envelopment analysis (DEA) is sensitivity analysis. Heretofore the existent studies have considered the data modification of inputs and outputs in one or multiple DMUs. In this paper the number of DMUs is increased and a stability region is obtained in  by applying defining hyperplanes in which if the added DMU (only one DMU) is in this region then all of the...

In this study, we use Stochastic Frontier analysis approach to estimate cost efficiency, economies of scale, and technological progress among Iranian banks from 1999 to 2012. The results show that there is a marked difference in cost efficiency before and after the recent financial sanctions against Iranian banking industry. Moreover, the results indicate that specialized government-owned banks...

This paper examines inability of CCR and BCC models in improving DMU’s scale efficiency when a production possibility frontier is assumed as variable returns to scale. This paper also finds that DEA result can be more efficient than the Pareto-efficiency when a DMU is feasibly projected to be both technically and scale efficient. This feasible projection can only be achieved by a VRS DEA model ...

6+7+8 7+9 :<; :>= : 9 ? 8 @BA5=+CDA EFC A E/8HG0? 9 :IC J C 8 :>KLCLC M A 7 NPORQS:T? Q+NB:T8 A : U"A5NBU":FV>A = C @BC 8 :>= 8 NWJXG3M @BNB:Y8 M+: JZ? 9 :[9 7 =+= @B= ; \ ]^A_?5O+O 9 :>C C 8 M @BC

The aggregation of objectives in multiple criteria programming is one of the simplest and widely used approach. But it is well known that this technique sometimes fail in different aspects for determining the Pareto frontier. This paper proposes a new approach for multicriteria optimization which aggregates the objective functions and uses a line search method in order to locate an approximate ...

This paper investigates a mean-variance portfolio selection problem in continuous time with fixed and proportional transaction costs. Utilizing the dynamic programming, the Hamilton-Jacobi-Bellman (HJB) equation is derived, and the explicit closed form solution is obtained. Furthermore, the optimal strategies and efficient frontiers are also proposed for the original mean-variance problem. Nume...