Displaying similar documents to “Optimality conditions for weak efficiency to vector optimization problems with composed convex functions”

Comparison between different duals in multiobjective fractional programming

Radu Boţ, Robert Chares, Gert Wanka (2007)

Open Mathematics

Similarity:

The present paper is a continuation of [2] where we deal with the duality for a multiobjective fractional optimization problem. The basic idea in [2] consists in attaching an intermediate multiobjective convex optimization problem to the primal fractional problem, using an approach due to Dinkelbach ([6]), for which we construct then a dual problem expressed in terms of the conjugates of the functions involved. The weak, strong and converse duality statements for the intermediate problems...

Coercivity properties and well-posedness in vector optimization

Sien Deng (2003)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

This paper studies the issue of well-posedness for vector optimization. It is shown that coercivity implies well-posedness without any convexity assumptions on problem data. For convex vector optimization problems, solution sets of such problems are non-convex in general, but they are highly structured. By exploring such structures carefully via convex analysis, we are able to obtain a number of positive results, including a criterion for well-posedness in terms of that of associated...