A linearization approach to multiobjective programming duality (Q2367782)

The authors consider duality of multiobjective problems having linear constraints and pseudo-convex objective functions. The dual is constructed by linearizing the various objective functions in the primal problem around an arbitrary but fixed point \(\bar x\) and formulating the dual of the multiobjective linear program so obtained. For deriving the results the authors show a closed relationship between the efficient solutions of the original problem and the efficient solutions of the linearized problem. Then by using Schönfeld's dual the results are obtained. Finally, an application of these results to multiobjective fractional programming problem with different denominators is discussed.