Linear transformations to decrease computational requirements of solving some known linear programming models
From MaRDI portal
Publication:2267293
DOI10.1007/S10479-008-0473-4zbMATH Open1184.90103OpenAlexW2058073928MaRDI QIDQ2267293FDOQ2267293
Majid Soleimani-Damaneh, M. Zarepisheh
Publication date: 1 March 2010
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-008-0473-4
Recommendations
- Balance constraints reduction of large-scale linear programming problems
- scientific article; zbMATH DE number 3880435
- An effective non-Archimedean anti-degeneracy/cycling linear programming method especially for data envelopment analysis and like models
- Formal optimization of some reduced linear programming problems
- A modification of a mixed integer linear programming (MILP) model to avoid the computational complexity
Cites Work
- Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis
- Weights restrictions and value judgements in data envelopment analysis: Evolution, development and future directions
- Simulating weights restrictions in data envelopment analysis by means of unobserved DMUs
- Pitfalls and protocols in DEA
- Title not available (Why is that?)
- A note on simulating weights restrictions in DEA: an improvement of Thanassoulis and Allen's method
- Note—A Note on Including Ordinal Relations Among Multipliers in Data Envelopment Analysis
Cited In (2)
This page was built for publication: Linear transformations to decrease computational requirements of solving some known linear programming models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2267293)
