Interior point methods in DEA to determine non-zero multiplier weights.
Marie-Laure BougnolJosé H. DuláPaul RousePublished in: Comput. Oper. Res. (2012)
Keyphrases
- interior point methods
- convex optimization
- linear programming
- linear program
- convex programming
- quadratic programming
- interior point
- data envelopment analysis
- primal dual
- semidefinite programming
- linear programming problems
- solving problems
- semidefinite
- linear systems
- computationally intensive
- quadratically constrained quadratic
- cutting plane method
- training data
- linear combination
- wavelet transform
- dynamic programming
- np hard
- computational complexity