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 条

[21] POLYNOMIAL-TIME COMPUTATIONS IN MODELS OF ET
JOSEPH, D
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1983, 26 (03) : 311 - 338
[22] Polynomial-time computable stable models
Palopoli, L.
Zaniolo, C.
Annals of Mathematics and Artificial Intelligence, 17 (3-4):
[23] A POLYNOMIAL-TIME ALGORITHM FOR FINDING A LARGEST COMMON SUBGRAPH OF ALMOST TREES OF BOUNDED DEGREE
AKUTSU, T
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1993, E76A (09) : 1488 - 1493
[24] Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality
Joshua A. Grochow
Theory of Computing Systems, 2023, 67 : 627 - 669
[25] Polynomial-Time Algorithm for Sorting by Generalized Translocations
Yin, Xiao
Zhu, Daming
THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, 2009, 5532 : 440 - 449
[26] A polynomial-time algorithm for global value numbering
Gulwani, S
Necula, GC
STATIC ANALYSIS, PROCEEDINGS, 2004, 3148 : 212 - 227
[27] A Polynomial-Time Algorithm for the Maximum Clique Problem
Akbari, Zohreh O.
2013 IEEE/ACIS 12TH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCE (ICIS), 2013, : 503 - 507
[28] Polynomial-Time Algorithm for Sliding Tokens on Trees
Demaine, Erik D.
Demaine, Martin L.
Fox-Epstein, Eli
Hoang, Duc A.
Ito, Takehiro
Ono, Hirotaka
Otachi, Yota
Uehara, Ryuhei
Yamada, Takeshi
ALGORITHMS AND COMPUTATION, ISAAC 2014, 2014, 8889 : 389 - 400
[29] A stable, polynomial-time algorithm for the eigenpair problem
Armentano, Diego
Beltran, Carlos
Buergisser, Peter
Cucker, Felipe
Shub, Michael
JOURNAL OF THE EUROPEAN MATHEMATICAL SOCIETY, 2018, 20 (06) : 1375 - 1437
[30] A polynomial-time algorithm for memory space reduction
Song, YH
Wang, C
Li, ZY
INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 2005, 33 (01) : 1 - 33

← 1 2 3 4 5 →