AbstractThis study is devoted to constraint qualifications and strong Kuhn–Tucker necessary optimality conditions for nonsmooth multiobjective optimization problems. The main tool of the study is the concept of convexificators. Mangasarian–Fromovitz type constraint qualification and several other qualifications are proposed and their relationships are investigated. In addition, sufficient optimality conditions are studied
In this paper, we establish strong complementary approximate Karush- Kuhn-Tucker (SCAKKT) sequential...
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...
AbstractThis study is devoted to constraint qualifications and strong Kuhn–Tucker necessary optimali...
In this paper, we use the concept of convexificators to derive enhanced Fritz John optimality condit...
In this paper, we use the concept of convexificators to derive enhanced Fritz John optimality condit...
Multiobjective optimization problems, Constraint qualification, Necessary conditions for Pareto mini...
AbstractThe Kuhn–Tucker type necessary optimality conditions are given for the problem of minimizing...
The main aim of this paper is to develop necessary Optimality conditions using Convexifactors for ma...
The main aim of this paper is to develop necessary Optimality conditions using Convexifactors for ma...
We study nonsmooth multiobjective programming problems involving locally Lipschitz functions and sup...
In this paper, we define some new generalizations of strongly convex functions of order m for loc...
Abstract This paper is devoted to the study of optimality conditions for strict minimizers of higher...
Abstract We study nonsmooth multiobjective programming problems involving locally Lipschitz function...
Abstract In this paper, we consider a nonsmooth multiobjective semi-infinite programming problem wit...
In this paper, we establish strong complementary approximate Karush- Kuhn-Tucker (SCAKKT) sequential...
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...
AbstractThis study is devoted to constraint qualifications and strong Kuhn–Tucker necessary optimali...
In this paper, we use the concept of convexificators to derive enhanced Fritz John optimality condit...
In this paper, we use the concept of convexificators to derive enhanced Fritz John optimality condit...
Multiobjective optimization problems, Constraint qualification, Necessary conditions for Pareto mini...
AbstractThe Kuhn–Tucker type necessary optimality conditions are given for the problem of minimizing...
The main aim of this paper is to develop necessary Optimality conditions using Convexifactors for ma...
The main aim of this paper is to develop necessary Optimality conditions using Convexifactors for ma...
We study nonsmooth multiobjective programming problems involving locally Lipschitz functions and sup...
In this paper, we define some new generalizations of strongly convex functions of order m for loc...
Abstract This paper is devoted to the study of optimality conditions for strict minimizers of higher...
Abstract We study nonsmooth multiobjective programming problems involving locally Lipschitz function...
Abstract In this paper, we consider a nonsmooth multiobjective semi-infinite programming problem wit...
In this paper, we establish strong complementary approximate Karush- Kuhn-Tucker (SCAKKT) sequential...
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...
DOI
Add to ORKG