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 条

[41] Polynomial-time algorithm for computing bound sets
Krenz, R.
Dubrova, E.
IEE PROCEEDINGS-CIRCUITS DEVICES AND SYSTEMS, 2006, 153 (02): : 179 - 184
[42] Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality
Grochow, Joshua A.
THEORY OF COMPUTING SYSTEMS, 2023, 67 (03) : 627 - 669
[43] A Polynomial-Time Algorithm for Pliable Index Coding
Song, Linqi
Fragouli, Christina
IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (02) : 979 - 999
[44] A POLYNOMIAL-TIME ALGORITHM FOR LINEAR-PROGRAMMING
TURNOVEC, F
EKONOMICKO-MATEMATICKY OBZOR, 1980, 16 (04): : 468 - 470
[45] A POLYNOMIAL-TIME LEARNING ALGORITHM FOR RECOGNIZABLE SERIES
OHNISHI, H
SEKI, H
KASAMI, T
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1994, E77D (10) : 1077 - 1085
[46] A polynomial-time algorithm for Outerplanar Diameter Improvement
Cohen, Nathann
Goncalves, Daniel
Kim, Eun Jung
Paul, Christophe
Sau, Ignasi
Thilikos, Dimitrios M.
Weller, Mathias
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2017, 89 : 315 - 327
[47] NONDETERMINISTIC POLYNOMIAL-TIME COMPUTATIONS AND MODELS OF ARITHMETIC
MATE, A
JOURNAL OF THE ACM, 1990, 37 (01) : 175 - 193
[48] A POLYNOMIAL-TIME BOUND FOR HOWARDS POLICY IMPROVEMENT ALGORITHM
MEISTER, U
HOLZBAUR, U
OR SPEKTRUM, 1986, 8 (01) : 37 - 40
[49] An entire space polynomial-time algorithm for linear programming
Tian, Da Gang
JOURNAL OF GLOBAL OPTIMIZATION, 2014, 58 (01) : 109 - 135
[50] Polynomial-time quantum algorithm for the simulation of chemical dynamics
Kassal, Ivan
Jordan, Stephen P.
Love, Peter J.
Mohseni, Masoud
Aspuru-Guzik, Alan
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2008, 105 (48) : 18681 - 18686

← 1 2 3 4 5 →