A polynomial-time algorithm for finding ε in DEA models

被引：84
|
作者：
Amin, GR [1 ]
Toloo, M [1 ]
机构：
[1] Islamic Azad Univ, Sci & Res Branch, Dept Math, Tehran, Iran
来源：
COMPUTERS & OPERATIONS RESEARCH | 2004年 / 31卷 / 05期
关键词：
data envelopment analysis; non-Archimedean epsilon; polynomial time algorithm;
D O I：
10.1016/S0305-0548(03)00072-8
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
This paper presents a new algorithm for computing the non-Archimedean epsilon in DEA models. It is shown that this algorithm is polynomial-time of 0(n), where n is the number of decision making units (DMUs). Also it is proved that using only inputs and outputs of DMUs, the non-Archimedean epsilon can be found such that, the optimal values of all CCR models, which are corresponding to all DMUs, are bounded and an assurance value is obtained. (C) 2003 Elsevier Ltd. All rights reserved.
引用
收藏
页码：803 / 805
页数：3
相关论文
共 50 条
  • [31] A Polynomial-Time Algorithm for Memory Space Reduction
    Yonghong Song
    Cheng Wang
    Zhiyuan Li
    International Journal of Parallel Programming, 2005, 33 : 1 - 33
  • [32] A Polynomial-Time Algorithm for Pliable Index Coding
    Song, Linqi
    Fragouli, Christina
    2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2016, : 120 - 124
  • [33] A POLYNOMIAL-TIME ALGORITHM RECOGNIZING LINK TREES
    BUGATA, P
    NAGY, A
    VAVRA, R
    JOURNAL OF GRAPH THEORY, 1995, 19 (03) : 417 - 433
  • [34] Polynomial-Time Algorithm for the Leafage of Chordal Graphs
    Habib, Michel
    Stacho, Juraj
    ALGORITHMS - ESA 2009, PROCEEDINGS, 2009, 5757 : 290 - +
  • [35] A POLYNOMIAL-TIME ALGORITHM FOR UNIDIMENSIONAL UNFOLDING REPRESENTATIONS
    DOIGNON, JP
    FALMAGNE, JC
    JOURNAL OF ALGORITHMS, 1994, 16 (02) : 218 - 233
  • [36] A polynomial-time algorithm for deciding Markov equivalence of directed cyclic graphical models
    Richardson, T
    UNCERTAINTY IN ARTIFICIAL INTELLIGENCE, 1996, : 462 - 469
  • [37] Algorithm with central line neighbourhood of polynomial-time
    Ai, Wen-bao
    Wei, Ping
    Zhengzhou Daxue Xuebao/Journal of Zhengzhou University, 2000, 32 (01): : 30 - 33
  • [38] A polynomial-time algorithm for the bistable roommates problem
    Sethuraman, J
    Teo, CP
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2001, 63 (03) : 486 - 497
  • [39] A polynomial-time algorithm for global value numbering
    Gulwani, Sumit
    Necula, George C.
    SCIENCE OF COMPUTER PROGRAMMING, 2007, 64 (01) : 97 - 114
  • [40] Polynomial-time algorithm for computing bound sets
    Krenz, R.
    Dubrova, E.
    IEE PROCEEDINGS-CIRCUITS DEVICES AND SYSTEMS, 2006, 153 (02): : 179 - 184
12345