eng
Islamic Azad University, Rasht Branch
Iranian Journal of Optimization
2588-5723
2008-5427
2010-09-01
06
1
536
554
514143
A statistical test for outlier identification in data envelopment analysis
Morteza Khodabin
m-kaodabin@kiau.ac.ir
1
Reza Kazemi Matin
2
Islamic Azad University, Karaj Branch, Department of Mathematics P.O.Box 31485-313, Karaj, Iran.
Islamic Azad University, Karaj Branch, Department of Mathematics P.O.Box 31485-313, Karaj, Iran.
<span>In the use of peer group data to assess individual, typical or best practice performance, the effective detection of outliers is critical for achieving useful </span><span>results. In these ‘‘deterministic’’ frontier models, statistical theory is now mostly </span><span>available. This paper deals with the statistical pared sample method and its capability of detecting outliers in data envelopment analysis. In the presented method, each observation is deleted from the sample once and the resulting linear program is solved, leading to a distribution of efficiency estimates. Based on the achieved distribution, a pared test is designed to identify the potential outlier(s). We illustrate the method through a real data set. The method could be used in a first step, as an exploratory data analysis, before using any frontier estimation. </span>
http://ijo.iaurasht.ac.ir/article_514143_4f79709b7cf61f8410e7cadbb07134ea.pdf
Data envelopment analysis (DEA)
Outlier
Efficiency
Paired Sample Test
eng
Islamic Azad University, Rasht Branch
Iranian Journal of Optimization
2588-5723
2008-5427
2010-09-01
06
1
555
566
514144
Obtaining a Unique Solution for the Cross Efficiency by Using the Lexicographic method
G. R. Jahanshahloo
1
R. Fallahnejad
r.fallahnejad@gmail.com
2
epartment of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran
epartment of Mathematics, Khorram Abad Branch, Islamic Azad University, Khorram Abad, Iran
<span>Cross efficiency is a method with the idea of peer evaluation instead of self-evaluation, and is used for evaluation and ranking Decision Making Units (DMUs) in Data Envelopment Analysis (DEA). Unlike most existing DEA ranking models which can only rank a subset of DMUs, for example non-efficient or extreme efficient DMUs, cross efficiency can rank all DMUs, even non-extreme ones. However, since DEA weights are generally not unique, cross-efficiency which uses optimal weights corresponding to evaluation of DMUs may not be unique either. This deficiency renders the cross efficiency method useless. However, the secondary goals proposed to deal with this deficiency of cross efficiency have such drawbacks themselves as well. In this paper we present a new secondary goal for cross efficiency method based on the lexicographic method. The main advantage of the proposed method is that with the possibility of existence of alternative optimal weights at the end of the secondary goal problem, the performance and the rank of DMUs will be constant, while the previous secondary goal methods don't offer any suggestions to deal with their alternative optimal weights. </span>
http://ijo.iaurasht.ac.ir/article_514144_c0babd5ab89c5f1d7d18c6f5dd0bc94f.pdf
Cross efficiency
Data Envelopment Analysis
Lexicographic Method
ranking
eng
Islamic Azad University, Rasht Branch
Iranian Journal of Optimization
2588-5723
2008-5427
2010-09-01
06
1
567
590
514145
Linear Programming, the Simplex Algorithm and Simple Polytopes
Das Bhusan
1
Biswal Bagaban
2
J.P Tripathy
jp_tripathy@yahoo.com
3
Department of Mathematics,Balasor college of Engg & Teach. Sergarh, Balasore, Orissa, India
Department of Mathematics F.M.Autonomous College, Balasore, Orissa, India
Department of Mathematics Gurukul Institute of Bhubaneswar,Orissa,India
<span>In the first part of the paper we survey some far reaching applications of the basis facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concurring the simplex algorithm. We describe sub-exponential randomized pivot roles and upper bounds on the diameter of graphs of polytopes. </span>
http://ijo.iaurasht.ac.ir/article_514145_ea1a75142f8b8780dbdd391fe7c2a870.pdf
simplex algorithm
Randomized Pivot rule complexity combinational theory of simple polytopes
eng
Islamic Azad University, Rasht Branch
Iranian Journal of Optimization
2588-5723
2008-5427
2010-09-01
06
1
603
613
514147
A new method for ordering triangular fuzzy numbers
S.H. Nasseri
nasseri@umz.ac.ir
1
S. Mizuno
2
Department of Mathematical Sciences, Mazandaran University, Babolsar, Iran
Department of Industrial Engineering and Management, Tokyo Institute of Technology, Tokyo, Japan
<span>Ranking fuzzy numbers plays a very important role in linguistic decision making and other fuzzy application systems. In spite of many ranking methods, no one can rank fuzzy numbers with human intuition consistently in all cases. Shortcoming are found in some of the convenient methods for ranking triangular fuzzy numbers such as the coefficient of variation (CV index), distance between fuzzy sets, centroid point and original point, and also weighted mean value. In this paper, we introduce a new method for ranking triangular fuzzy number to overcome the shortcomings of the previous techniques. Finally, we compare our method with some convenient methods for ranking fuzzy numbers to illustrate the advantage our method. </span>
http://ijo.iaurasht.ac.ir/article_514147_c6b92aaac83efba0eb5d155f24b46109.pdf
Linear order
ranking fuzzy numbers
triangular fuzzy number