Data Envelopment Analysis Problem

© All Rights Reserved

5 views

Data Envelopment Analysis Problem

© All Rights Reserved

- A-Super-Efficiency-Model-for-Evaluating-Efficiency-in-the-Presence-of-Time-Lag-Effect.pdf
- Chap
- Kirana Trade
- Introduction Productivity, Efficiency, and Economic Growth in Asia-Pacific Region
- can a biologist fix a radio
- Chapter 4 (1)
- 1.2 Quarter_Amplitude_Damping_-_Control_Notes.pdf
- RCM vs FMEA
- Innovative ECE Final Projects List
- Toc Quiz2 Sol
- Performance and Efficiency in Colombias Power Distribution System_Effects of the 1994 Reform
- Seminar 01
- 2nd Ord Cybernetics and Enaction Perception
- Syntax Does Not Mean Semantics
- Material Handling Eq
- ZAGATOWKA
- Control Sys Two Exp
- Series & Parallel Systems
- Dynamic Modelling.docx
- TRADUCCION CONTROL.docx

You are on page 1of 3

com

www.elsevier.com/locate/dsw

Gholam R. Amin , Mehdi Toloo

Department of Mathematics, Islamic Azad University, Science & Research Branch, Tehran, Iran

Abstract

This paper presents a new algorithm for computing the non-Archimedean in DEA models. It is shown

that this algorithm is polynomial-time of O(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 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.

? 2003 Elsevier Ltd. All rights reserved.

Keywords: Data envelopment analysis; Non-Archimedean ; Polynomial time algorithm

1. Introduction

DEA is a mathematical method for determining the relative e6ciency of decision making units

(DMUs). The data are inputoutput observations for a number of DMUs using varying amounts of

the same inputs to produce varying amounts of the same outputs. Charnes et al. proposed a linear

programming (LP) for determining the relative e6ciency of DMUs.

In recent years, DEA has enjoyed both rapid growth and widespread acceptance. A new bibliography contains almost 3000 studies employing the methodology of DEA. In these studies, the

two most frequently used models are the Charnes, Cooper and Rhodes (CCR) model and Banker,

Charnes and Cooper (BCC) model, both of which involve the non-Archimedean . Mehrabian

et al., 2000 de'ned an assurance interval of the non-Archimedean for feasibility of the multiplier side and boundedness of envelopment side of the CCR and BCC models. They have shown

that for 'nding non-Archimedean an assurance value for using a single LP is enough.

In this paper, a polynomial-time algorithm of O(n) for computing an assurance value is introduced.

It is important to compare computational performance of the algorithm with that of the LP when

computational issues and complexity analysis are at focus.

Corresponding author.

E-mail address: G R Amin@hotmail.com (G.R. Amin).

0305-0548/$ - see front matter ? 2003 Elsevier Ltd. All rights reserved.

doi:10.1016/S0305-0548(03)00072-8

804

G.R. Amin, M. Toloo / Computers & Operations Research 31 (2004) 803 805

The assurance interval (0; ] is for obtaining the non-Archimedean . It is proved that for determining non-Archimedean in the assurance interval, solving the following LP is enough [1].

P :

max

VXj 6 1;

s:t:

j = 1; : : : ; n;

UYj VXj 6 0;

j = 1; : : : ; n;

(I)

V 1m 0m ;

U 1s 0s ;

where, 1k is a k vector with each component equal to one and 0k is a k vector with all components

equal to zero. Note that 0 6 , also under the following condition

T = {j: V Xj = 1} = {t}

the value of is equal to , where ( ; U ; V ) is optimal solution of P [1]. By choosing any

member of the assurance interval (0; ], all the CCR models solved, corresponding to the evaluation

of all DMUs, are bounded.

In the following, a polynomial-time algorithm is presented for 'nding an assurance value . First,

consider the following essential theorem:

F UF and F be de5ned as follows:

Theorem 1. Let V;

F

V = (vF1 ; : : : ; vFm ), where vFi = (1m Xk )1 , i = 1; : : : ; m, where 1m Xk = max{1m Xj : j = 1; : : : ; n},

F

U = (uF 1 ; : : : ; uF s ), where

1m Xj

1

uF r = (1m Xk ) min

; j = 1; : : : ; n ; r = 1; : : : ; s;

1s Yj

1m Xj

1

1

;

min

: j = 1; : : : ; n

:

F = min

1m X k 1m X k

1s Y j

F U;

F )

Then (V;

F S , where S is the feasible region of the problem P .

F U;

F )

F j=

Proof. We have to show that (V;

F satis'es the 2n + m + s constraints in (I). Clearly, VX

1m Xj

6 1; j = 1; : : : ; n,

1m X k

1m Xj

1s Yl

1m Xl

F

F

UYl VXl =

min

; j = 1; : : : ; n

1 m Xk

1s Y j

1m Xk

1m Xj

1

1s Yl min

=

; j = 1; : : : ; n 1m Xl 6 0;

1 m Xk

1s Yj

because

min

1m Xj

1 m Xl

; j = 1; : : : ; n 6

;

1s Y l

1s Y j

for l = 1; : : : ; n:

G.R. Amin, M. Toloo / Computers & Operations Research 31 (2004) 803 805

Finally,

uF r min

1

1

;

min

1 m X k 1m Xk

and

1

vFi =

min

1m Xk

1m Xj

; j = 1; : : : ; n

= ;

F

1s Y j

1

1

;

min

1m X k 1m X k

805

r = 1; : : : ; s;

1m Xj

; j = 1; : : : ; n

= ;

F

1s Y j

i = 1; : : : ; m:

Algorithm Epsilon;

begin

M := 1 / max{1 m X j : j = 1,, n};

end

Proof. Note that the algorithm is not iterative, then to obtain the order of it, it is su6cient that the

total number of operations is considered. In computing 1m Xj and 1s Yj ; j = 1; : : : ; n the numbers of

operations are (m 1)n and (s 1)n, respectively. By considering the other operations, in a similar

fashion, the total number of operations is (1 + m + s)n. Since m + sn, therefore the algorithm

terminates after O(n) time.

Acknowledgements

The authors are thankful to the anonymous referees for many helpful suggestions for improving

the presentation of this paper.

References

[1] Mehrabian S, Jahanshahloo GR, Alirezaee MR, Amin GR. An assurance interval for the non-Archimedean epsilon in

DEA models. Operations Research 2000;48(2):34447.

- A-Super-Efficiency-Model-for-Evaluating-Efficiency-in-the-Presence-of-Time-Lag-Effect.pdfUploaded byMiftahul Rizky Cahya Putra
- ChapUploaded byPiyush Chaudhary
- Kirana TradeUploaded bykanshou87
- Introduction Productivity, Efficiency, and Economic Growth in Asia-Pacific RegionUploaded byIzaya21
- can a biologist fix a radioUploaded byaditya
- Chapter 4 (1)Uploaded byDavion Stewart
- 1.2 Quarter_Amplitude_Damping_-_Control_Notes.pdfUploaded bychris Finland
- RCM vs FMEAUploaded byg_viegas
- Toc Quiz2 SolUploaded byivardu
- Innovative ECE Final Projects ListUploaded bysksingl350
- Performance and Efficiency in Colombias Power Distribution System_Effects of the 1994 ReformUploaded byjorgeage2
- Seminar 01Uploaded byapi-3713690
- 2nd Ord Cybernetics and Enaction PerceptionUploaded byDanilo Moggia
- Syntax Does Not Mean SemanticsUploaded bypanthermodern
- Material Handling EqUploaded byMohamed Salah
- ZAGATOWKAUploaded byAndrei Botezatu
- Control Sys Two ExpUploaded byMohammed Abdul Jabbar
- Series & Parallel SystemsUploaded byNaresh Kumar Trivedi
- Dynamic Modelling.docxUploaded byJesse Oh
- TRADUCCION CONTROL.docxUploaded byLidia Ayma Cjuiro
- PM Ch 4 Project Time ManagementUploaded byAbhishek Thakkar
- Barriers Medium Listening SkillsUploaded byjazebel3
- DMX4543-Control Systems Engineering-2017-2018 Assignment 1Uploaded byDon Nuwan Danushka
- SSpaceRepUploaded byiJordanScribd
- T10KT MW TKG Lesson 29b ControllerDesign-SV-Module9p2 11122014Uploaded byMani Vannan Soundarapandiyan
- 8Uploaded byMohamad Ali Ansari
- CN4227R - Frequency Response - bUploaded byMing Xiang
- Tutorial 10Uploaded bybasha774655362
- 05772345Uploaded bySravan Kumar
- jcs311869-873Uploaded byArunava Chakraborty

- Comparative Analysis of AHP and Fuzzy AHP Models for Multicriteria Inventory ClassificationUploaded byorlandoduran
- Productivity Improvement Through Plant Layout and Inventory Management in Small and Medium Enterprises-A Review Paper-IJAERDV04I0226059Uploaded byEditor IJAERD
- Production Planning and Control Anna University Question BankUploaded bySankar Kumar
- set-point-weight-tuning-using-pid-fuzzy-logic-controller.pdfUploaded byWissal Abid
- BITS_F111_1004(1)Uploaded byanon_753496408
- 1-s2.0-S1474667015364661-main.pdfUploaded byVignesh Ramakrishnan
- Chapter 2 Transfer FuctionUploaded byazharsamah
- ASAP Methodology and SDLCUploaded byhberger57
- Control EngineeringUploaded bymarian56
- BrdUploaded bypradeep
- Six_sigama_a Story of XxxUploaded byssiddhartha
- ELEC3004-L5-LTIUploaded byAnonymous WkbmWCa8M
- Eee IV Control Systems [10es43] NotesUploaded byKarthikeyan
- ecology-book.pdfUploaded byMohammedAjebli
- Adaline/Madaline:ApplicationsUploaded byRoots999
- A Note on a Comparison of Heuristic MethodsUploaded byyogesh
- Curated List of LinksUploaded byradiumtau
- Compare-9001-16949Uploaded byJardin Turquesa
- Family Systems TheoryUploaded byCyrus Kayani
- urn_nbn_no_ntnu_diva-452-1__fulltext.pdfUploaded byMohammed Alkhafaji
- machine-learning-engineer-nanodegree-program-syllabus.pdfUploaded byCésar Anthony Díaz Esquén
- 331 Hockett sUploaded byRussa Crochet
- Sapient Automation Leader in VLMs and Carousels Announces George Fiorentino. as East Coast DirectorUploaded bypressreleasesolution
- Chapter1 LectureUploaded byS. Raelynne Becerra
- Symbolic vs. Subsymbolic.pptxUploaded bymuhammadriz
- Full Implementation Life Cycle ProjectUploaded bySaif Ahmed
- Material Handling and Process Improvement Using Lean Manufacturing Principles.8-11Uploaded bySitisaiful
- 2013Uploaded byArpita Paul
- Ch07 - Manufacturing and Service Technologies - 01 Apr 14Uploaded byAbdur Rehman
- wbsUploaded byjea