Preference programming and inconsistent interval matrices

The problem of derivation of the weights of altematives from pairwise comparison matrices is long standing. In this paper,Lexicographic Goal Programming (LGP) has been used to find out weights from pairwise inconsistent interval judgment matrices. A number of properties and advantages of LGP as a weight determination technique have been explored. An algorithm for identification and modification of inconsistent bounds is also provided. The proposed technique has been illustrated by means of numerical examples.