A new linear method to find the congestion hyperplane in DEA (Q2418474): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:35, 2 February 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
