You are on page 1of 2

Socb,-Econ. Plan. Sci. Vol. 16, No. 5, pp. 223-224, 1982 0038-0121/821050223~)2503.

0010
Printed in Great Britain Pergamon Press Ltd.

A MULTIPLICATIVE MODEL FOR EFFICIENCY


ANALYSISt

A. CHARNES, W. W. COOPER and L. SEIFORD


Center for Cybernetic Studies, Business-EconomicsBuilding,The University fo Texas at Austin, Austin, TX 78712,
U.S.A.

and

J. STUTZ
University of Miami, Department of Management Science and Computer Information Systems, Coral Gables,
FL 33124, U.S.A.

(Received24 November1981)
Abstract--This paper developstheory and algorithmsfor a "multiplicative"Data EnvelopmentAnalysis(DEA) model
employingvirtual outputs and inputs as does the CCR ratio method for efficiencyanalysis. The frontier production
function results here are of piecewise log-linearrather than piecewise linear form.

INTRODUCTION This construction is analogous to a geometric mean


In [I-3] Charnes, Cooper and Rhodes presented a construction in that we take the exponents /Zr and vi to
method, the CCR ratio, for measuring the relative be non-negative, and in order that they all be positive (to
efficiency of DMU's (Decision Making units) having the avoid Pareto inefficiencies) we require them to be not
same multiple inputs and multiple outputs. The essential less than unity.
characteristic of the CCR construction was the reduction The relative efficiency of DMUo will then be given as
of the multiple output-multiple input DMU situation to the maximum of the ratio of its virtual output to virtual
that of single virtual outputs and virtual inputs. For input subject to the condition that the virtual output to
these, the ratios of virtual outputs to virtual inputs could virtual input ratio of all DMU's be less than or equal to
be used to define relative efficiency in a manner similar unity i.e. we solve the problem
to that in engineering practice.
Although it was understood from the first that the
"additive" combinations of outputs or inputs to achieve max I'I Y~,~ XT~
t~,v r=l
virtual outputs and inputs was not the only way of
obtaining virtual single outputs and inputs, to date no
other way has been studied. It is the purpose of this
s.t. n Y~:/,_nX ~ i < l , j = l
r=t
..... n (2)

paper to present a "multiplicative" combinational /z,-> I, r = 1. . . . . s


method. As will be seen, it has a theory similar to that of
the CCR ratio and its Data Envelopment Analysis but v i - > l , 0 = l . . . . . m.
one which is simpler in certain respects, which can prove
advantageous in applications, interpretations and exten- Taking logarithms (to any base), this may be written as
sions of other theories. the linear programming problem

A MULTIPLICATIVEEFFICIENCYMODEL
max ~ txr Yro- ~ viff(io
AS in [I], suppose there are n DMU's and the the jth r=l i=l

DMU has output vector Y~ with s outputs and input


vector X~ with m inputs. Suppose that our measures of
inputs and outputs are such that all in our "sample" on
s.t. 2
r=l i=1
..... n (3)

n DMU's have values greater than unity. -~, -<-1, r = l ...... s


To determine the relative efficiency of DMUo with -v~ -<-1, i = 1 . . . . . m
input-output pair (Xo, Yo), we form the "multiplicative"
^
virtual outputs and inputs for the DMU's as follows: where the caret sign ( ) denotes logarithms. More corn
pactly this can be written as
Y§' and ~ X~, j = 1. . . . . n. (1)
r=l i=l
max/~TI?o- vr)(o

tThis research is partly supported by ONR contract N00014-81- s.t. ~ ? - vD? -<0
C-0236 and USARI contract MD--903-81-C-0365with the Center
for Cybernetic Studies, The University of Texas at Austin. --/U, T -~-- - er
(4.1)
Reproductionin wholeor in part is permittedfor any purpose of the
United States Government. -- pT ~ _ e y

223
224 A. CHARNESet aL

with dual corresponding to this basic solution. Thereby

rain - e Ts + -- e Ts - g*T(?o + s* ÷) = ~. ~ ( ¢ ~ . )
,.,*T(-Ro + s*~ ) = ~,*~(- Ro,~*~) (6)
s.t. I?A-- S+ = I~0
- . ~ A - s- = - ~ ' o and
h, s +, s -> 0 (4.2)
p*~'(?o + s V ) - ,,*T(2o- s*-) = (,~*~?~, - ,,* TRB).~*~
where IY----[L . . . . . L ] , - ~ ' - - - [ - ~ . . . . . -~n] and the e T -<0
are row vectors of ones of the appropriate sizes.
Evidently (4.2) is a DEA (Data Envelopment Analysis) as required to verify basis optimality in he new problem.
problem with the cone on the DMU vectors enveloping Thus, the "projection" of the (-Xo, Iio) of DMUo onto
Yo from above, e.g. I?A -> Yo and enveloping Xo from ( - Xo + s*-, Yo + s$ ÷) is a projection onto the efficiency
below e.g. XA -< Xo. It is a simpler envelopment than that facet spanned by the efficient DMU's which determined
for the CCR ratio model. Further, its log-efficiency is DMUo's efficiency.
given solely in terms of the optimal slacks in (4.2), COMeUTATIONOF EFFIOENCY
whereas the CCR efficiency value also involves a change
in intensity of the Xo vector. To compute the relative efficiency of the DMU's, we
suggest using the DEA side of (4.2) for the n linear
programs to be computed. Notice that they differ from
CHARACTERIZINGEFFICENTDMU'S one another only in the right hand side vector, a sim-
Since the optimal functional value in (4.2) is the log- plication from the computational situation for the CCR
efficiency of DMUo and a DMU is efficient if and only if ratio model.
it has a log-efficiency of zero, we have the result, As before, however, we can immediately specify a
feasible basis for DMUo. Here it differs from a diagonal
T h e o r e m 1. DMUo is efficient in an optimal solution of matrix only in one column,
(4,2) iff all slacks are zero.
Again, as in the CCR ratio model, the efficiency rating
of a DMU is characterized by a certain subset of efficient [-2o
DMU's. For,
where [ designates an (s - 1) x (s - 1) identity matrix
Theorem 2. If DMUk appears in an optimal basic solu- with an additional first row of zeroes. We note, paren-
tion to (4.2), then DMUk is efficient. thetically, that the inverse of (8) can be written explicitly
Proof. The log-efficiency problem of DMUk replaces the as
right hand side in (4.2) by (I?k, -)(k). r An optimal basic
solution for DMUo which contains the basis vector (Yk,
- Xoy,~ 0 - (9)
-.Xk) r is feasible for the DMUk problem with Ak = 1,
At=0, ./~ k and s ÷, s - = 0 . It is also optimal since the
dual evaluators do not involve the right hand side. Thus, where ~'o denotes Yo with ylo replaced by unity.
DMUk has log-efficiency zero. To speed up computation while making accessible the
efficient facet information corresponding to DMUo, we
Also, as in the CCR ratio model, we can project a point out that by Theorem 2 on reaching an optimal basis
DMU onto the efficiency facet which determines its
for DMUo, any DMUg in this basis is efficient and its
efficiency, for dual evaluators are those corresponding to DMUo! Thus
*+ , S'B- are
T h e o r e m 3. If the coefficient vectors of sB we do not need to separately compute an optimal tableau
basic slack vectors in an optimal basic solution of (4.2) for DMU~. We need only record the slacks for DMUo,
for^DMUo, then replacing (Yo, --~'o) r by (l?o+s$ +, its dual evaluator vector and what its subset of efficient
- Xo + s*-) T yields an efficient DMU. DMUg's is and proceed to compute log-efficiency for the
remaining unrecorded DMU's. Further, any DMUp n o t
Proof. If. s *÷, s * - = 0, DMUo is efficient. If ers*++
in the basis, but which has zero " ( z p - c p ) " is also
e r s * - > 0, then DMUo is not efficient. By Theorem 2, its in the same efficient facet. For, it is an alter-
output-input vector cannot b e part of this optimal basis
nate optimum which can be pivoted into the basis. But,
for it. Evidently the vector (Yo+ s *+, - X o + s*-) r as a
since the old dual evaluators are still dual evaluators for
right hand side vector is feasible for this basis and with
it, no additional computation need be made. Thus, such
zero slacks. Thus, afortiori, this basic solution is also a
DMUp's can also be recorded as corresponding to
basic solution with both the right hand side and left hand
DMUo.
side (I~o, -)(o) 7" replaced by the new vector.
To confirm that this basic solution is still optimal for REFERENCES
the new problem, we need only verify that the dual 1. A. Charnes, W. W. Cooper and E. Rhodes, Measuring the
evaluators (/z*, v*) satisfy the new constraint in the dual efficiency of decision making units. European J. Op. Res. 2,
problem. Now our old optimal solution is the (unique) 429--444 (1978).
solution to 2. A. Cbanes and W. W Cooper, Management science relations
for evaluation and management accountability. J. Enterprise
Management 2, 143-162 (1980),
~Bx*~- s *+ = ?o 3. A. Charnes, W. W. Cooper and E. Rhodes, Evaluating pro-
- .¢B~*- s* -- - 17o (5) gram and managerial efficiency: an application of data
envelopment analysis to program follow through. Management
where the "B" subscript designates the column vectors Sci. 27, 668-697 (1981).

You might also like