Add to ORKGWe are concerned with a nonsmooth multiobjective optimization problem with inequal-ity constraints. In order to obtain our main results, we give the definitions of the gener-alized convex functions based on the generalized directional derivative. Under the above generalized convexity assumptions, sufficient and necessary conditions for optimality are given without the need of a constraint qualification. Then we formulate the dual problem corresponding to the primal problem, and some duality results are obtained without a constraint qualification. Copyright © 2006 Hindawi Publishing Corporation. All rights reserved. 1
AbstractIn this paper, new classes of generalized (F, α, π, d)-Type I functions are introduced for a...
In this paper, a generalization of convexity is considered in the case of multiobjective optimizatio...
We introduce and study a new dual condition which characterizes zero duality gap in nonsmooth convex...
We are concerned with a nonsmooth multiobjective optimization problem with inequal-ity constraints. ...
We are concerned with a nonsmooth multiobjective optimization problem with inequality constraints. I...
AbstractIn this paper the various definitions of nonsmooth invex functions are gathered in a general...
In this paper, we are concerned with a nondifferentiable multiobjective programming problem with ine...
In this paper, a generalization of convexity is considered in the case of multiobjective optimizatio...
In this paper, a generalization of convexity is considered in the case of multiobjective optimizatio...
AbstractWe examine a notion of duality which appears to be useful in situations where the usual conv...
Abstract We study nonsmooth multiobjective programming problems involving locally Lipschitz function...
We study nonsmooth multiobjective programming problems involving locally Lipschitz functions and sup...
AbstractA nonsmooth multiobjective optimization problem involving generalized Type I vectorvalued fu...
AbstractIn this paper we provide a duality theory for multiobjective optimization problems with conv...
In this article, we use abstract convexity results to study augmented dual problems for (nonconvex) ...
AbstractIn this paper, new classes of generalized (F, α, π, d)-Type I functions are introduced for a...
In this paper, a generalization of convexity is considered in the case of multiobjective optimizatio...
We introduce and study a new dual condition which characterizes zero duality gap in nonsmooth convex...
We are concerned with a nonsmooth multiobjective optimization problem with inequal-ity constraints. ...
We are concerned with a nonsmooth multiobjective optimization problem with inequality constraints. I...
AbstractIn this paper the various definitions of nonsmooth invex functions are gathered in a general...
In this paper, we are concerned with a nondifferentiable multiobjective programming problem with ine...
In this paper, a generalization of convexity is considered in the case of multiobjective optimizatio...
In this paper, a generalization of convexity is considered in the case of multiobjective optimizatio...
AbstractWe examine a notion of duality which appears to be useful in situations where the usual conv...
Abstract We study nonsmooth multiobjective programming problems involving locally Lipschitz function...
We study nonsmooth multiobjective programming problems involving locally Lipschitz functions and sup...
AbstractA nonsmooth multiobjective optimization problem involving generalized Type I vectorvalued fu...
AbstractIn this paper we provide a duality theory for multiobjective optimization problems with conv...
In this article, we use abstract convexity results to study augmented dual problems for (nonconvex) ...
AbstractIn this paper, new classes of generalized (F, α, π, d)-Type I functions are introduced for a...
In this paper, a generalization of convexity is considered in the case of multiobjective optimizatio...
We introduce and study a new dual condition which characterizes zero duality gap in nonsmooth convex...