An Interactive Algorithm For Solving Multiobjective Optimization Problems Based on A General Scalarization Technique

‎the wide variety of available interactive methods brings the need for creating general‎ ‎interactive algorithms enabling the decision maker (dm) to apply freely several convenient methods which best fit his/her preferences‎. ‎to this end‎, ‎in this paper‎, ‎we propose a general scalarizing problem for multiobjective programming problems‎.‎the relation between optimal solutions of the introduced scalarizing problem and (weakly) efficient as well as properly efficient solutions of the main multiobjective optimization problem (mop) is discussed‎. ‎it is shown that some of the scalarizing problems used in different interactive methods can be obtained from proposed formulation by selecting suitable transformations‎. ‎based on the suggested scalarizing problem‎, ‎we propose a general interactive algorithm (gia) that enables the dm to specify his/her preferences in six different ways with capability to change his/her preferences any time during the iterations of the algorithm‎. ‎finally‎, ‎a numerical exle demonstrating the applicability of the algorithm is provided‎.