Premium
An interactive paired comparison method for bicriterion integer programming
Author(s) -
Shin Wan S.,
Allen Diane Breivik
Publication year - 1994
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(199404)41:3<423::aid-nav3220410308>3.0.co;2-e
Subject(s) - integer programming , integer (computer science) , decision maker , mathematical optimization , computer science , compromise , linear programming , mathematics , operations research , programming language , sociology , social science
This article proposes an interactive paired comparison region elimination method for bicriterion integer mathematical programming problems. The new method isolates the best compromise solution by successively evaluating a pair of associated supported non‐dominated solutions. The efficiency of the method is tested by solving randomly generated problems based on varying shapes of efficient frontiers. When compared with the existing branch‐and‐bound method, the method was effective in reducing the burden on the decision maker. © 1994 John Wiley & Sons, Inc.