Nonconvex Duality in Multiobjective Optimization

Nonconvex duality properties for multiobjective optimization problems are obtained by using a characterization of Pareto optima by means of generalized Tchebycheff norms.

Bounds for the corresponding duality gap are given, and approximate Pareto multipliers are constructed. A generalized notion of Pareto multipliers for quasi-convex multiobjective problems is introduced.