Cost Allocation and Convex Data Envelopment

Jens Leth Hougaard, Jørgen Tind

1075 Downloads (Pure)

Abstract

This paper considers allocation rules. First, we demonstrate that costs allocated by the Aumann-Shapley and the Friedman-Moulin cost allocation rules are easy to determine in practice using convex envelopment of registered cost data and parametric programming. Second, from the linear programming problems involved it becomes clear that the allocation rules, technically speaking, allocate the non-zero value of the dual variable for a convexity constraint on to the output vector. Hence, the allocation rules can also be used to allocate inefficiencies in non-parametric efficiency measurement models such as Data Envelopment Analysis (DEA). The convexity constraint of the BCC model introduces a non-zero slack in the objective function of the multiplier problem and we show that the cost allocation rules discussed in this paper can be used as candidates to allocate this slack value on to the input (or output) variables and hence enable a full allocation of the inefficiency on to the input (or output) variables as in the CCR model
Original languageEnglish
PublisherDepartment of Economics, University of Copenhagen
Number of pages17
Publication statusPublished - 2008

Keywords

  • Faculty of Social Sciences
  • convex envelopment
  • ata envelopment analysis
  • slack allocation

Fingerprint

Dive into the research topics of 'Cost Allocation and Convex Data Envelopment'. Together they form a unique fingerprint.

Cite this