An effective non-Archimedean anti-degeneracy/cycling linear programming method especially for data envelopment analysis and like models
From MaRDI portal
Publication:1312766
DOI10.1007/BF02023099zbMath0786.90035MaRDI QIDQ1312766
A. Charnes, John J. Rousseau, John H. Semple
Publication date: 5 May 1994
Published in: Annals of Operations Research (Search for Journal in Brave)
Linear programming (90C05) Production theory, theory of the firm (91B38) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
The role of non-Archimedean epsilon in finding the most efficient unit: with an application of professional tennis players, Using lexicographic parametric programming for identifying efficient units in DEA, Refined bounds for the non-Archimedean \(\epsilon\) in DEA, On characterizing the production possibility set for the CCR ratio model in DEA, A computational study of DEA with massive data sets, Solving DEA models in a single optimization stage: can the non-Archimedean infinitesimal be replaced by a small finite epsilon?, Interior point methods in DEA to determine non-zero multiplier weights, New data envelopment analysis models for classifying flexible measures: the role of non-Archimedean epsilon, Polyhedral cone-ratio DEA models with an illustrative application to large commercials banks, An epsilon-based data envelopment analysis approach for solving performance measurement problems with interval and ordinal dual-role factors, Constrained games for evaluating organizational performance, Equivalences between data envelopment analysis and the theory of redundancy in linear systems
Cites Work
- Unnamed Item
- Degeneracy graphs and simplex cycling
- The generalized simplex method for minimizing a linear form under linear inequality restraints
- Non-archimedean infinitesimals, transcendentals and categorical inputs in linear programming and data envelopment analysis
- Optimality and Degeneracy in Linear Programming
