In this paper we apply some tools of nonsmooth analysis and scalarization method due to Chankong–Haimes to find ϵ-efficient solutions of semi-infinite multiobjective optimization problems (MP). We establish ϵ-optimality conditions of Karush–Kuhn–Tucker (KKT) type under Farkas–Minkowski (FM) constraint qualification by using ϵ-subdifferential concept. In addition we propose mixed type dual problem (including dual problems of Wolfe and Mond–Weir types as special cases) for ϵ-efficient solutions and investigate relationship between mentioned (MP) and its dual problem as well as establish several ϵ-duality theorems
AbstractIn this study, using the properties of limiting subdifferentials in nonsmooth analysis and r...
Convex vector (or multi-objective) semi-infinite optimization deals with the simultaneous minimizati...
Optimality condition, Semi-infinite programming, Nonsmooth analysis, Constraint qualification,
In this paper we apply some tools of nonsmooth analysis and scalarization method due to Chankong–Hai...
The main aim of this paper is to study strong Karush–Kuhn–Tucker (KKT) optimality conditions for non...
AbstractUsing the theory of abstract optimization problems in infinite-dimensional spaces we provide...
Abstract: In this paper, we shall establish necessary and sufficient conditions for a feasible solut...
Using the theory of abstract optimization problems in infinite-dimensional spaces we provide necessa...
Abstract In this paper, we consider a nonsmooth multiobjective semi-infinite programming problem wit...
AbstractIn this paper, new classes of generalized (F, α, π, d)-Type I functions are introduced for a...
AbstractUsing the scalar ε-parametric approach, we establish the Karush-Kuhn-Tucker (which we call K...
Employing some advanced tools of variational analysis and generalized differentiation, we establish ...
We study nonsmooth multiobjective programming problems involving locally Lipschitz functions and sup...
AbstractA nonsmooth multiobjective optimization problem involving generalized Type I vectorvalued fu...
We consider a nonsmooth semi-infinite interval-valued vector programming problem, where the objectiv...
AbstractIn this study, using the properties of limiting subdifferentials in nonsmooth analysis and r...
Convex vector (or multi-objective) semi-infinite optimization deals with the simultaneous minimizati...
Optimality condition, Semi-infinite programming, Nonsmooth analysis, Constraint qualification,
In this paper we apply some tools of nonsmooth analysis and scalarization method due to Chankong–Hai...
The main aim of this paper is to study strong Karush–Kuhn–Tucker (KKT) optimality conditions for non...
AbstractUsing the theory of abstract optimization problems in infinite-dimensional spaces we provide...
Abstract: In this paper, we shall establish necessary and sufficient conditions for a feasible solut...
Using the theory of abstract optimization problems in infinite-dimensional spaces we provide necessa...
Abstract In this paper, we consider a nonsmooth multiobjective semi-infinite programming problem wit...
AbstractIn this paper, new classes of generalized (F, α, π, d)-Type I functions are introduced for a...
AbstractUsing the scalar ε-parametric approach, we establish the Karush-Kuhn-Tucker (which we call K...
Employing some advanced tools of variational analysis and generalized differentiation, we establish ...
We study nonsmooth multiobjective programming problems involving locally Lipschitz functions and sup...
AbstractA nonsmooth multiobjective optimization problem involving generalized Type I vectorvalued fu...
We consider a nonsmooth semi-infinite interval-valued vector programming problem, where the objectiv...
AbstractIn this study, using the properties of limiting subdifferentials in nonsmooth analysis and r...
Convex vector (or multi-objective) semi-infinite optimization deals with the simultaneous minimizati...
Optimality condition, Semi-infinite programming, Nonsmooth analysis, Constraint qualification,