A Linearization Approach to Multiobjective Programming Duality

Duality for multiobjective programming problems having pseudo-convex objective functions and linear constraints is studied through a linearization approach. Its application to a multiobjective fractional programming problem with different denominators is discussed.