Using mathematical programming to solve large ranking problems

A C B Tse ()
Additional contact information
A C B Tse: Chinese University of Hong Kong

Journal of the Operational Research Society, 2001, vol. 52, issue 10, 1144-1150

Abstract: Abstract This paper introduces a mathematical programming model that overcomes the major methodological problem of a large ranking task: respondent fatigue and deteriorated decision quality caused by an excessive number of objects to be ranked. The model was applied to the problem of ranking Marketing and International Business journals. There are more than 200 such journals, making direct ranking or rating very difficult, if not impossible. The result shows that the mathematical programming model uses very little information and yet can produce rankings that are in agreement with results obtained from direct ranking studies.

Keywords: large ranking problem; mathematical programming (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2601203 Abstract (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:52:y:2001:i:10:d:10.1057_palgrave.jors.2601203

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2601203

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().