A new linear method to find the congestion hyperplane in DEA (Q2418474): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s40096-019-0277-5 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S40096-019-0277-5 / rank | |||
Normal rank | |||
Latest revision as of 12:30, 18 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new linear method to find the congestion hyperplane in DEA |
scientific article |
Statements
A new linear method to find the congestion hyperplane in DEA (English)
0 references
3 June 2019
0 references
data envelopment analysis (DEA)
0 references
congestion
0 references
hyperplane
0 references
linear programming
0 references
decision-making units (DMU)
0 references
0 references
0 references
0 references
