Preference programming and inconsistent interval judgments
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Lexicographic Goal Programming (LGP) has been used to find out weights from pairwise inconsistent interval judgment matrices and a number of properties and advantages of LGP as a weight determination technique have been explored.
Abstract
The problem of derivation of the weights of alternatives 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.
