A data envelopment model for aggregating preference rankings
Management Science
Aggregating preference rankings using OWA operator weights
Information Sciences: an International Journal
Discriminating DEA efficient candidates by considering their least relative total scores
Journal of Computational and Applied Mathematics
An integrated AHP-DEA methodology for bridge risk assessment
Computers and Industrial Engineering
A solution method to the problem proposed by Wang in voting systems
Journal of Computational and Applied Mathematics
WSEAS Transactions on Information Science and Applications
Expert Systems with Applications: An International Journal
Computers and Industrial Engineering
Expert Systems with Applications: An International Journal
Aggregating preference ranking with fuzzy Data Envelopment Analysis
Knowledge-Based Systems
Methods of critical value reduction for type-2 fuzzy variables and their applications
Journal of Computational and Applied Mathematics
A fuzzy AHP-DEA approach for multiple criteria ABC inventory classification
Expert Systems with Applications: An International Journal
Structured methodology for supplier selection and evaluation in a supply chain
Information Sciences: an International Journal
Computers and Industrial Engineering
Ranking of candidates in the preferential voting framework based on a new approach
ASM'12 Proceedings of the 6th international conference on Applied Mathematics, Simulation, Modelling
Computers and Industrial Engineering
Hi-index | 0.01 |
When one expects to figure out the total ranking of objects from collected data, it is a familiar method to compare the weighted sum of the selection number of rank vote, after determining the weights in a selected rank. Green et al. (European J. Oper. Res. 90(3) (1996) 461), using data envelopment analysis and cross-evaluation, proposed a procedure to order the objects from the ranking of one categorized data. But, they have not taken care of about making the weight of a certain rank 0, and the value of the difference between ranks becomes 0. In actual applications, making the weight of a certain rank 0 means that we throw away the corresponding part of the obtained rank voting data. Further, giving the same weight to different ranks destroys its original ranking character. And then, in this paper, we show that the total ordinal rank of objects may produce a different result according to the difference of the weights between ranks. Consequently, we explain that their ordering is not appropriate to applications. And, we propose a new ordering to solve the weights of ranks by considering feasible solutions' region of the constraint set in LP. Also, we would like to propose such a method that, if extended, it can be applied more widely not only when the selected category is for a single purpose but also when it is for multiple purposes, especially with an example taken from the personal development issue at a corporation.