Duality without constraint qualification in nonsmooth optimization.

Nobakhtian, S.

Displaying similar documents to “Duality without constraint qualification in nonsmooth optimization.”

Efficiency and generalized convex duality for nondifferentiable multiobjective programs.

Bae, Kwan Deok, Kang, Young Min, Kim, Do Sang (2010)

Journal of Inequalities and Applications [electronic only]

Similarity:

Optimality conditions for weak efficiency to vector optimization problems with composed convex functions

Radu Boţ, Ioan Hodrea, Gert Wanka (2008)

Open Mathematics

Similarity:

We consider a convex optimization problem with a vector valued function as objective function and convex cone inequality constraints. We suppose that each entry of the objective function is the composition of some convex functions. Our aim is to provide necessary and sufficient conditions for the weakly efficient solutions of this vector problem. Moreover, a multiobjective dual treatment is given and weak and strong duality assertions are proved.

Generalized $(ℱ, b, φ, ρ, θ)$ -univex $n$ -set functions and global semiparametric sufficient efficiency conditions in multiobjective fractional subset programming.

Zalmai, G.J. (2005)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Optimality conditions in nondifferentiable $G$ -invex multiobjective programming.

Kim, Ho Jung, Seo, You Young, Kim, Do Sang (2010)

Journal of Inequalities and Applications [electronic only]

Similarity:

Optimality and duality in nonsmooth multiobjective optimization involving V-type I invex functions.

Agarwal, Ravi P., Ahmad, I., Husain, Z., Jayswal, A. (2010)

Journal of Inequalities and Applications [electronic only]

Similarity:

Optimality conditions and duality theorems for non-Lipschitz optimization problems.

Gadhi, N. (2004)

Portugaliae Mathematica. Nova Série

Similarity:

Optimality conditions and duality in nonsmooth multiobjective programs.

Kim, Do Sang, Lee, Hyo Jung (2010)

Journal of Inequalities and Applications [electronic only]

Similarity:

Generalized $(ℱ, b, φ, ρ, θ)$ -univex $n$ -set functions and global parametric sufficient optimality conditions in minmax fractional subset programming.

Zalmai, G.J. (2005)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Generalized $(ℱ, b, φ, ρ, θ)$ -univex $n$ -set functions and parametric duality models in minmax fractional subset programming.

Zalmai, G.J. (2005)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Generalized $(ℱ, b, φ, ρ, θ)$ -univex $n$ -set functions and semiparametric duality models in multiobjective fractional subset programming.

Zalmai, G.J. (2005)

International Journal of Mathematics and Mathematical Sciences

Similarity:

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...

LFS functions in multi-objective programming

Luka Neralić, Sanjo Zlobec (1996)

Applications of Mathematics

Similarity:

We find conditions, in multi-objective convex programming with nonsmooth functions, when the sets of efficient (Pareto) and properly efficient solutions coincide. This occurs, in particular, when all functions have locally flat surfaces (LFS). In the absence of the LFS property the two sets are generally different and the characterizations of efficient solutions assume an asymptotic form for problems with three or more variables. The results are applied to a problem in highway construction,...