A comparative study of interactive tradeoff cutting plane methods for MOMP

In this paper, four interactive cutting plane methods developed for multiple objective mathematical programming problems are compared to one another using randomly selected problems. Tradeoff cutting plane methods converge to the best compromise solution by iteratively reducing the objective space by cutting planes. The cutting planes are constructed using partial preference information obtained from the decision maker. The performance of the four methods is evaluated and compared to one another by solving the test problems under (i) four classes of preference functions in addition to the original preference functions to simulate the nonexisting decision maker, (ii) different precision levels in the decision maker's comparative accuracy, (iii) decision space expanded or contracted, and (iv) inconsistent responses by the decision maker. Based on the comparative study, some guidelines for performing a comparative study of multicriteria interactive methods are presented.