This article discusses models in data envelopment analysis (DEA) relaxing the standard convexity assumptions. The basic model treats mutually incomparable pairs of sets to be generated by a procedure proposed earlier. Each pair consists of a consumption set and a production set of feasible input-output combinations. Two fundamental operations by the procedure are based on intersection and convex hull generation in the input-output space. A polarity analysis is performed which, subject to the usual assumptions about free disposability and nonnegativity, appears fruitful to do in the framework of blocking and antiblocking sets. It is shown how this leads to an interchange of the above operations extending some classical results from convex analysis. The last part of the paper presents a pair of linear programming models calculating a Farrell productivity index based on a preceeding application of the procedure. This is a generalization of the classical linear programming models in DEA subject to standard assumptions about convexity.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Royal Veterinary and Agricultural University, Food and Resource Economic Institute in its series Unit of Economics Working papers with number
24188.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.: