| Summary: | 碩士 === 國立高雄應用科技大學 === 工業工程與管理系碩士在職專班 === 102 === The paper considers the problem of some representations of a complete ranking.
We adopt one graph representation, six integer programming representations, and two
linear programming representations. The test instance is the four alternatives, especially for the complete ranking (3,2,4,1), and its three neighbor complete rankings (3,1,4,2 ),(2,3,4,1 ), and (4,2,3,1). According to the number of the constraints and number of thevariables, the second integer programming representation, and second linear programming representation are the best ones.
|
|---|
