A Survey on Different Solution Concepts in Multiobjective Linear Programming Problems with Interval Coefficients

Optimization problems have dedicated a branch of research to themselves for a long time ago. In this field, multiobjective programming has special importance. Since in most real-world multiobjective programming problems the possibility of determining the coefficients certainly is not existed, multiobjective linear programming problems with interval coefficients are investigated in this paper. Corresponding to such problems, four solution concepts, (A,b)-necessarily weak efficient, (A,b)-necessarily efficient, (A,b,C)-necessarily weak efficient and (A,b,C)-necessarily efficient, are introduced. Moreover, necessary and sufficient conditions for recognizing such solutions are presented. Finally, the efficiency of the results is investigated in some numerical examples.