Linear transformations to decrease computational requirements of solving some known linear programming models
From MaRDI portal
(Redirected from Publication:2267293)
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
- scientific article; zbMATH DE number 47262 (Why is no real title available?)
- 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
- Pitfalls and protocols in DEA
- Simulating weights restrictions in data envelopment analysis by means of unobserved DMUs
- 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
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)
