A DEA- COMPROMISE PROGRAMMING MODEL FOR COMPREHENSIVE RANKING

スポンサーリンク

概要

• 論文の詳細を見る

• This paper addresses comprehensive ranking systems determining an ordering of entities by aggregating quantitative data for multiple attributes. We propose a DEA-CP (Data Envelopment Analysis - Compromise Programming) model for the comprehensive ranking, including preference voting (ranked voting) to rank candidates in terms of aggregate vote by rank for each candidate. Although the DEA-CP model once employs the flexible DEA weighting system that can vary by entity, it finally aims at regressing to the common weights across the entities. Therefore, the model can totally rank the entities by specifying nothing arbitrary, and can avoid to use the diverse DEA weights.

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• Wu De-an

  University Of Tsukuba:(present Address)tohoku University

• Hashimoto Akihiro

  University Of Tsukuba

関連論文

• A DEA- COMPROMISE PROGRAMMING MODEL FOR COMPREHENSIVE RANKING
• USING THE EXCLUSION MODEL FOR DEA COMPUTATION
• Catalyst Temperature Dependence of NH
• Catalyst Temperature Dependence of NH₃ Decomposition for InN Grown by Metal Organic Vapor Phase Epitaxy (Special Issue : Recent Advances in Nitride Semiconductors)

スポンサーリンク