A new MIP approach on the least distance problem in DEA (Q5149538)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7309388
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new MIP approach on the least distance problem in DEA |
scientific article; zbMATH DE number 7309388 |
Statements
A New MIP Approach on the Least Distance Problem in DEA (English)
0 references
11 February 2021
0 references
data envelopment analysis
0 references
least distance problem
0 references
closest efficient target
0 references
linear complementarity conditions
0 references
0 references
0 references
0.8025372624397278
0 references
0.7913450598716736
0 references
0.7621751427650452
0 references
0.7524528503417969
0 references
