Theoretical Paper
Journal of the Operational Research Society (2001) 52, 1144–1150. doi:10.1057/palgrave.jors.2601203
Using mathematical programming to solve large ranking problems
A C B Tse1
1Chinese University of Hong Kong, Hong Kong
Correspondence: A C B Tse, Department of Marketing, The Chinese University of Hong Kong, Shatin, Hong Kong. E-mail: b102725@mailserv.cuhk.edu.hk
Received March 1999; Accepted March 2001.
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




