Research index
Linear Programming: Data Envelopment Analysis
Baker
7 Mar 2011
NobleIDark:/48914/w1/20260515/53463C91DOI10.1002/9780470949108.ch5
Linear Programming: Data Envelopment Analysis
Baker · 2011 · Subscription
NobleIDark:/48914/w1/20260515/53463C91DOI10.1002/9780470949108.ch5
The full text is at the publisher
You can read the abstract here, or open it at the publisher.
Abstract
This chapter looks at a type of linear program that has a special application and a special kind of interpretation. This type is associated with data envelopment analysis (DEA). For classification purposes, the DEA model is essentially an allocation model, but its unique applications make it an important type of model to study in its own right. The primary elements in a DEA study are a set of decision-making units (DMUs), along with their measured inputs and outputs. The purpose of DEA is to determine which of the DMUs make efficient use of their inputs and which do not. For the inefficient units, the analysis can actually quantify what levels of improved performance should be attainable. One can use a standard linear programming format to implement a spreadsheet model for DEA. The author identifies and analyzes the properties of a hypothetical comparison unit (HCU). Controlled Vocabulary Terms Data envelopment analysis; Decision making unit; linear programming