A linear bilevel programming problem for obtaining the closest targets and minimum distance of a unit from the strong efficient frontier (Q2911575)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A linear bilevel programming problem for obtaining the closest targets and minimum distance of a unit from the strong efficient frontier |
scientific article; zbMATH DE number 6074925
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear bilevel programming problem for obtaining the closest targets and minimum distance of a unit from the strong efficient frontier |
scientific article; zbMATH DE number 6074925 |
Statements
31 August 2012
0 references
data envelopment analysis (DEA)
0 references
linear bilevel programming (LBP)
0 references
minimum distance
0 references
strong efficient frontier
0 references
closest targets
0 references
0 references
0 references
0 references
0 references
A linear bilevel programming problem for obtaining the closest targets and minimum distance of a unit from the strong efficient frontier (English)
0 references
0.8277390599250793
0 references
0.8025372624397278
0 references
0.8023703098297119
0 references
0.7946770191192627
0 references
