A DEA- COMPROMISE PROGRAMMING MODEL FOR COMPREHENSIVE RANKING

DOI10.15807/jorsj.47.73zbMath1080.91019OpenAlexW2154675174MaRDI QIDQ3158885

De-An Wu, Akihiro Hashimoto

Publication date: 31 January 2005

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: http://ci.nii.ac.jp/lognavi?name=nels&lang=en&type=pdf&id=ART0001515965

zbMATH Keywords

compromise programmingcommon weighting

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Voting theory (91B12)

Related Items (7)

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 ⋮ 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 compromise programming model for highway maintenance resources allocation problem ⋮ Determining a common set of weights in data envelopment analysis by bootstrap ⋮ Aggregating preferences rankings with variable weights

This page was built for publication: A DEA- COMPROMISE PROGRAMMING MODEL FOR COMPREHENSIVE RANKING