Note—Ordinal Ranking and Intensity of Preference: A Linear Programming Approach
DOI10.1287/MNSC.32.12.1642zbMATH Open0618.90003OpenAlexW2073405920MaRDI QIDQ3755189FDOQ3755189
Wade D. Cook, Moshe Kress, Iqbal Ali
Publication date: 1986
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.32.12.1642
Recommendations
- Ordinal Ranking with Intensity of Preference
- Distance-based and ad hoc consensus models in ordinal preference ranking
- A Generalized Network Formulation of the Pairwise Comparison Consensus Ranking Model
- Ordinal ranking and preference strength
- Distance and consensus for preference relations corresponding to ordered partitions
group decisionstotally unimodularcommitteespiecewise linear convex objective functionordinal preference rankings
Applications of mathematical programming (90C90) Individual preferences (91B08) Group preferences (91B10) Integer programming (90C10)
Cited In (10)
- Ordinal Ranking with Intensity of Preference
- A preference aggregation method through the estimation of utility intervals
- A model to support the search for consensus with conflicting rankings: Multitrident
- Distance-based and ad hoc consensus models in ordinal preference ranking
- An agglomerative hierarchical clustering algorithm for linear ordinal rankings
- IMPROVING CONSISTENCY EVALUATION IN FUZZY MULTI-ATTRIBUTE PAIRWISE COMPARISON-BASED DECISION-MAKING METHODS
- Ordinal Preference Models Based on S-Integrals and Their Verification
- Preference modeling on totally ordered sets by the Sugeno integral
- On a proposal of Jensen for the analysis of ordinal pairwise preferences using Saaty's eigenvector scaling method
- A Generalized Network Formulation of the Pairwise Comparison Consensus Ranking Model
This page was built for publication: Note—Ordinal Ranking and Intensity of Preference: A Linear Programming Approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3755189)
