Digital Library
Close Browse articles from a journal
 
<< previous    next >>
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
           All articles of the corresponding issues
                                       Details for article 5 of 7 found articles
 
 
  Paired Comparison Rankings by Linear Programming
 
 
Title: Paired Comparison Rankings by Linear Programming
Author: Singh, Jagbir
Appeared in: Communications in statistics
Paging: Volume 1 (1973) nr. 4 pages 351-364
Year: 1973
Contents: The problem of estimating partial and complete paired comparison rankings is formulated as a linear programming problem. The solution of the problem immediately yields a ranking. A treatment of ties is considered as a result of which the solution of the program may explicitly have two objects tied in the ranking. Such a ranking is called partial. A method for resolving ties and thus obtaining a complete ranking is given based upon the solution of the linear program. A numerical example is given to illustrate the subject matter.
Publisher: Taylor & Francis
Source file: Elektronische Wetenschappelijke Tijdschriften
 
 

                             Details for article 5 of 7 found articles
 
<< previous    next >>
 
 Koninklijke Bibliotheek - National Library of the Netherlands