Decomposing the efficient frontier of the DEA production possibility set into a smallest number of convex polyhedrons by mixed integer programming (Q1926834)
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: Decomposing the efficient frontier of the DEA production possibility set into a smallest number of convex polyhedrons by mixed integer programming |
scientific article; zbMATH DE number 6119434
| 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; zbMATH DE number 6119434 |
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
