.png){kind=icon}
.png){kind=icon}
Return
Data envelopment analysis and its related linear programming models
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-015-2042-y.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We provide a unifying framework synthesizing the dual spaces of production and value used in DEA efficiency measurement with some well-known linear programming (LP) problems. Specifically, we make use of the technology matrix to map intensity variables into input-output space, and the adjoint transformation of the technology matrix to map input-output prices into prices of intensity variables. We show how the diet problem, a classical LP problem, is related to DEA and also use the adjoint matrix to demonstrate a procedure for pricing efficient decision-making units. We further illustrate the relationship between benefit-of-the-doubt aggregation and the diet problem.
Keywords:
DEA
Diet problem
Benefit-of-the-doubt
Primal
Dual
Linear programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.5
Papers:
8.0K
Citations:
2.1W
View more organizations