Decomposing the efficient frontier of the DEA production possibility set into a smallest number of convex polyhedrons by mixed integer programming (Q1926834): Difference between revisions
From MaRDI portal
Latest revision as of 01:31, 6 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decomposing the efficient frontier of the DEA production possibility set into a smallest number of convex polyhedrons by mixed integer programming |
scientific article |
Statements
Decomposing the efficient frontier of the DEA production possibility set into a smallest number of convex polyhedrons by mixed integer programming (English)
0 references
29 December 2012
0 references
data envelopment analysis (DEA)
0 references
mixed integer programming (MIP)
0 references
maximal efficient face
0 references
efficient frontier
0 references
0 references
0 references
