Generalized convexity in multiobjective programming (Q5916441)

The so-called weighting problem, the k-th objective Lagrangian problem and the k-th objective constraint problem associated with a multiobjective nonlinear optimization problem are considered. The relationship between the solutions of these three problems and the noninferior solutions of the multiobjective optimization problem are studied as well as weaker types of convexities as e.g. quasiconvexity and pseudoconvexity. Also duality results are included.