(An) interactive algorithm for multiobjective mixed integer programming problem

Abstract

This thesis suggests an interactive algorithm for solving multiobjective mixed integer programming problems in case of single decision maker (DM) without uncertainty. This interactive algorithm is developed, based on the concept of Constraints and Weihting method through defining appropriate preference pattern of DM. Using the concept of Constraints method, this algorithm generates the set of efficient solutions. And using the concept of Weighting one, it checks the consistency of the DM``s preference structures and leads the appropriate preference structure for the DM. With the proper preference structure, at each iteration this algorithm directs toward the preferable solution and finally optimal solution can be obtained with less interaction with DM.