Non-archimedean infinitesimals, transcendentals and categorical inputs in linear programming and data envelopment analysis

DOI10.1080/00207729208949465zbMath0765.90001OpenAlexW2076955242MaRDI QIDQ4027819

A. Charnes, John J. Rousseau, John H. Semple

Publication date: 1 April 1993

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207729208949465

zbMATH Keywords

data envelopment analysisnon- archimedean simplex algorithmnon-archimedean infinitesimals

Mathematics Subject Classification ID

Decision theory (91B06) Linear programming (90C05)

Related Items (4)

Feedback stability under simultaneous gap metric uncertainties in plant and controller ⋮ Solving DEA models in a single optimization stage: can the non-Archimedean infinitesimal be replaced by a small finite epsilon? ⋮ Efficiency bounds in data envelopment analysis ⋮ An effective non-Archimedean anti-degeneracy/cycling linear programming method especially for data envelopment analysis and like models

Cites Work

• Measuring the efficiency of decision making units
• Note—Notions of Efficiency and Their Reference Sets
• Optimality and Degeneracy in Linear Programming

This page was built for publication: Non-archimedean infinitesimals, transcendentals and categorical inputs in linear programming and data envelopment analysis