A DEA- COMPROMISE PROGRAMMING MODEL FOR COMPREHENSIVE RANKING
From MaRDI portal
Recommendations
- Two effective total ranking models for preference voting and aggregation
- A ranked voting system using a DEA/AR exclusion model: A note
- A multiobjective programming method for ranking all units based on compensatory DEA model
- A ranked voting system for consolidation of different results of ranking methods in DEA
- PREFERENCE VOTING AND RANKING USING DEA GAME CROSS EFFICIENCY MODEL(<Special Issue>Operations Research for Performance Evaluation)
Cited in
(9)- A multiobjective programming method for ranking all units based on compensatory DEA model
- A compromise programming model for highway maintenance resources allocation problem
- Determining a common set of weights in data envelopment analysis by bootstrap
- A compromise programming approach for target setting in DEA
- Common set of weights and efficiency improvement on the basis of separation vector in two-stage network data envelopment analysis
- Aggregating preferences rankings with variable weights
- Methodology for integrated multicriteria decision-making with uncertainty: extending the compromise ranking method for uncertain evaluation of alternatives
- Combining bootstrap data envelopment analysis with social networks for rank discrimination and suitable potential benchmarks
- A general model for dealing with ranking voting systems
This page was built for publication: A DEA- COMPROMISE PROGRAMMING MODEL FOR COMPREHENSIVE RANKING
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3158885)
