Setting closer targets based on non-dominated convex combinations of Pareto-efficient units: a bi-level linear programming approach in data envelopment analysis (Q6096632)
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 7737921
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Setting closer targets based on non-dominated convex combinations of Pareto-efficient units: a bi-level linear programming approach in data envelopment analysis |
scientific article; zbMATH DE number 7737921 |
Statements
Setting closer targets based on non-dominated convex combinations of Pareto-efficient units: a bi-level linear programming approach in data envelopment analysis (English)
0 references
15 September 2023
0 references
data envelopment analysis
0 references
bi-level programming
0 references
planning
0 references
benchmarking
0 references
target setting
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
