Abstract
Cook and Kress (Cook, Wade D., Moshe Kress. 1985. Ordinal ranking with intensity of preference. Management Sci. 31 (1) 26–32.) present a model for representing ordinal preference rankings, where the voter can express intensity or degree of preference. The consensus of a set of m rankings is that ranking whose distance from this set is minimal. The consensus problem is then shown to be an integer programming problem with a piecewise linear convex objective function. In the present note we prove that the constraint matrix for this integer problem is totally unimodular. In addition, it is shown that the problem can be expressed as an equivalent integer linear programming problem. These two facts allow us to represent the consensus problem as a linear programming model. To further facilitate an efficient solution procedure to the consensus problem, it is shown that the number of columns in the L.P. model can generally be reduced significantly. Computational results on a wide range of problems is presented.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
