Next Article in Journal
A Differential Privacy Budget Allocation Algorithm Based on Out-of-Bag Estimation in Random Forest
Next Article in Special Issue
Two-Stage Optimization Methods to Solve the DNA-Sample Allocation Problem
Previous Article in Journal
Homogeneity Test of Multi-Sample Covariance Matrices in High Dimensions
Previous Article in Special Issue
A VNS-Based Matheuristic to Solve the Districting Problem in Bicycle-Sharing Systems
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Quasi Efficient Solutions and Duality Results in a Multiobjective Optimization Problem with Mixed Constraints via Tangential Subdifferentials

1
LASMA, FSDM, Department of Mathematics Sidi Mohamed Ben Abdellah University, Fez 30000, Morocco
2
School of Science and Engineering, Al Akhawayn University in Ifrane, Ifrane 53000, Morocco
3
Department of Mathematics, College of Science, King Khalid University, Abha 62529, Saudi Arabia
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(22), 4341; https://doi.org/10.3390/math10224341
Submission received: 25 October 2022 / Revised: 14 November 2022 / Accepted: 15 November 2022 / Published: 18 November 2022
(This article belongs to the Special Issue Advanced Optimization Methods and Applications)

Abstract

:
We take up a nonsmooth multiobjective optimization problem with tangentially convex objective and constraint functions. In employing a suitable constraint qualification, we formulate both necessary and sufficient optimality conditions for (local) quasi efficient solutions in terms of tangential subdifferentials. Furthermore, under generalized convexity assumptions, we state strong, weak and converse duality relations of Wolfe and Mond–Weir types. We give a number of examples to illustrate the new concepts and main results of this paper.

1. Introduction

Nonsmooth multiobjective optimization (NMO) is still an area of active research thanks to the large number of applications in engineering [1], mechanics [2], economics [3], etc. Among the new aspects in this context, we can cite the recent works on quasi efficiency, which is a flexible concept that allows us to make the error dependent on the decision variables, taking into account that most of the optimization problems only yield approximate solutions due to data imprecision. For instance, to characterize quasi efficient solutions of an NMO problem, optimality conditions were investigated in the literature through the use of Clarke’s subdifferential as in [4,5,6], or the limiting subdifferential as in [7]. Moreover, the Mond–Weir duality type was examined in [8], where weak, strong and converse duality theorems were proven.
On the other hand, many papers [9,10,11,12] recently studied NMO problems by utilizing the notion of tangential subdifferentials, which was introduced by Pschenichnyi [13]. The results in these papers depict the importance of this subdifferential as it includes many types of subdifferentials such as Gâteaux derivatives, convex subdifferentials or those of Clarke and Michel–Penot. Accordingly, the optimality conditions, given in terms of this general tool, provide sharper results and cover a wide spectrum of optimization problems, including those with nonconvex and nondifferentiable functions. For instance, Martínez-Legaz [9] derived optimality conditions for pseudoconvex functions by assuming the Slater constraint qualification and convexity of the feasible set. This last condition was dropped in [10] to obtain an extended result for NMO problems. More recently, under generalized convexity assumptions, Tung [11,12] established Karush–Kuhn–Tucker (KKT) optimality conditions and duality for NMO problems subject to an infinite number of inequalities.
Motivation and Contribution. As far as the authors are aware, to date, none of the previous research has tried to simultaneously employ both the notions of local quasi efficiency and tangential subdifferentials to establish duality relations and optimality conditions of NMO problems, which we aim to undertake in the present work. In particular, we take up an NMO problem subject to inequality, equality and set constraints
( NMOP ) min f ( x ) = ( f 1 ( x ) , , f m ( x ) ) , s . t . x Ω , g ( x ) = ( g 1 ( x ) , , g p ( x ) ) 0 , h ( x ) = ( h 1 ( x ) , , h q ( x ) ) = 0 ,
where Ω R n is a closed convex set, the scalar functions f i , i I = { 1 , , m } , g j , j J = { 1 , , p } , h k , k K = { 1 , , q } are defined on R n and are all tangentially convex at a given point in the feasible region
Π = { x Ω : g ( x ) 0 , h ( x ) = 0 } .
It can be shown that neither f, g nor h are generally convex. However, we will ensure that, under specific constraint qualifications, KKT conditions can be proven to be necessary and sufficient for optimality. We will also consider dual programs of Wolfe and Mond–Weir types that correspond to (NMOP), and prove different duality theorems. Finally, we will give a number of examples to illustrate the new concepts and main results of our work.
We can summarize our motivation and contributions as follows:
  • We investigate an NMO problem involving functions which are neither convex nor differentiable nor even locally Lipschitz. The studied problem contains different types of constraints such as geometric constraints as well as equality and inequality constraints.
  • We focus on the concept of quasi efficient solutions due to their extreme importance in real-life applications in which an efficient solution fails to exist.
  • We obtain new general results in terms of the tangential subdifferential, which is known to generalize both Clarke regular and Michel–Penot regular subdifferentials.
  • We use a suitable constraint qualification that is weaker than many standard constraint qualifications such as Cottle, Mangasarian–Fromovitz, Kuhn–Tucker, and Zangwill.
  • We establish new duality results of Wolfe and Mond–Weir types.
The paper consists of four additional sections. In the next section, we present the notations used in this paper, and recall and introduce some definitions. In Section 3, we propose KKT necessary conditions for local quasi efficient solutions of (NMOP) involving appropriate constraint qualifications. In Section 4, by employing a generalized convexity concept, we formulate sufficient optimality conditions. Finally, in Section 5, we consider dual programs of Wolfe and Mond–Weir types and prove weak, strong and converse duality theorems.

2. Preliminaries

Hereafter, for x , y R n , x < y means x i < y i for all i = 1 , 2 , , n , and x y means x i y i for all i = 1 , 2 , , n and x k < y k for some k. The set B = { x R : x 1 } is the closed unit ball of R n . Given a nonempty subset S of R n , co S , int S , cl S and cl co S denote the convex hull, interior, closure and closed convex hull of S , respectively. In addition, the polar cone, the strictly negative polar cone and the orthogonal complement of S are respectively defined by
S = x R n : x , d 0 , d S , S s = x R n : x , d < 0 , d S \ { 0 } , S = x R n : x , d = 0 , d S .
It can easily be shown that, if S s , then cl ( S s ) = S . Moreover, S = S ( S ) .
Furthermore, for x ¯ cl S , the cone of feasible directions, the cone of weak feasible directions, the tangent cone and the normal cone are respectively given by
D ( S , x ¯ ) = υ R n : r > 0 , λ ( 0 , r ) , x ¯ + λ υ S , W D ( S , x ¯ ) = υ R n : t m 0 , x ¯ + t m υ S , m N , T ( S , x ¯ ) = υ R n : t m 0 , υ m υ , x ¯ + t m υ m S , m N , N ( S , x ¯ ) = ξ R n : ξ , υ 0 , υ T ( S , x ¯ ) = T ( S , x ¯ ) .
Observe that D ( S , x ¯ ) is neither closed nor convex, and that T ( S , x ¯ ) is closed but not necessarily convex. We also have D ( S , x ¯ ) W D ( S , x ¯ ) T ( S , x ¯ ) , and when S is convex, D ( S , x ¯ ) = W D ( S , x ¯ ) and cl D ( S , x ¯ ) = T ( S , x ¯ ) .
The convex cone generated by S and the linear hull of S are
cone ( S ) = y R n : k N s . t . y = i = 1 k λ i y i , λ i 0 , y i S , i = 1 , 2 , , k , lin ( S ) = y R n : l N s . t . y = i = 1 l λ i y i , λ i R , y i S , i = 1 , 2 , , l .
Recall that for any two sets, S 1 and S 2 in R n , one has
cone ( S 1 S 2 ) = cone ( S 1 ) + cone ( S 2 ) , lin ( S 1 S 2 ) = lin ( S 1 ) + lin ( S 2 ) ,
and that S = cl cone ( S ) .
Definition 1 
([13]). A function φ : R n R is called tangentially convex at x ¯ R n if its directional derivative (also known as Dini derivative) at x ¯ ,
φ ( x ¯ , d ) = lim t 0 φ ( x ¯ + t d ) φ ( x ¯ ) t ,
is finite for any direction d R n and convex with respect to the second argument.
Observe that the directional derivative of a tangentially convex function is sublinear because it is positive homogeneous. The following definition concerns a subdifferential concept that is closely connected to this class of functions.
Definition 2 
([13,14]). The tangential subdifferential of φ : R n R at x ¯ R n is given by
T φ ( x ¯ ) = y * R n : y * , d φ ( x ¯ , d ) , d R n .
Realize that, for a tangentially convex function, the tangential subdifferential is nonempty and its support functional coincides with the directional derivative because, as we said above, the latter is sublinear [9]; that is φ ( x ¯ , d ) = max y * T φ ( x ¯ ) y * , d . Note also that the tangential subdifferential is compact and convex.
An appealing property of tangentially convex functions is that their class is properly large. In particular, convex functions on open domains are tangentially convex everywhere and their tangential subdifferential falls into the classical Fenchel subdifferential. Moreover, Gâteaux differentiable functions on open domains are also tangentially convex and their tangential subdifferential reduces to the singleton set of the gradient. This class also contains locally Lipschitz functions that are either Clarke regular [15] or Michel–Penot regular [16], and their tangential subdifferential coincides with the Clarke subdifferential in the first case and the Michel–Penot subdifferential in the second one.
We conclude this section by introducing the concept of quasi efficiency that will be used throughout this paper. To this end, assume we are given ρ int ( R + m ) and x ¯ Π .
Definition 3. 
A point x ¯ Π will be called a local (weak) efficient solution of (NMOP) if there exists a neighborhood V of x ¯ such that f ( x ) ( < ) f ( x ¯ ) does not hold for any x V Π . It will be called local (weak) ρ-quasi efficient if, instead of f ( x ) ( < ) f ( x ¯ ) , we consider f ( x ) f ( x ¯ ) ( < ) ρ x x ¯ . Finally, it will be called (weak) ρ-quasi efficient if the last statement holds for V = R n .
It is easy to see that local (weak) efficient solution is local (weak) ρ -quasi efficient solution for some ρ int ( R + m ) , but we do not have the converse in general as demonstrated below.
Example 1 
([4,17]). We can easily check that x ¯ = 0 is a local ( 1 , 1 ) -quasi efficient solution to min f ( x ) = l n ( x + 1 ) x , x 3 x subject to x 0 but not a local efficient solution. Moreover, if we change the multiobjective function to f ( x ) = x 2 x , x 3 x 2 , the feasible point x ¯ = 0 becomes local weak ( 1 , 1 ) -quasi efficient solution but not a local weak efficient solution.

3. KKT Necessary Conditions for Local Quasi Efficient Solutions

We derive KKT necessary conditions for local quasi efficient solutions of (NMOP) by means of the tangential subdifferential. To proceed, we introduce the following notations:
  • F T = i I ( T f i ( x ¯ ) + ρ i B ) .
  • G T = j J ( x ¯ ) T g j ( x ¯ ) , where J ( x ¯ ) = { j J : g j ( x ¯ ) = 0 } is the index set of active constraints at x ¯ .
  • H T = k K T h k ( x ¯ ) .
  • A ( x ¯ ) = { μ R + n : μ j g j ( x ¯ ) = 0 , j J } , which is called the set of active constraint multipliers of (NMOP) at x ¯ .
These sets are employed to define three constraint qualifications:
  • Abadie’s type constraint qualification (ACQ):
    G T H T T ( Ω , x ¯ ) T ( Π , x ¯ ) .
  • Zangwill’s type constraint qualification (ZCQ):
    G T H T T ( Ω , x ¯ ) cl D ( Π , x ¯ ) .
  • Weak Zangwill’s type constraint qualification (WZCQ):
    G T H T T ( Ω , x ¯ ) cl W D ( Π , x ¯ ) .
Contrary to [8], we choose to use H T instead of
k K T h k ( x ¯ ) k K T ( h k ( x ¯ ) )
because h k can not be tangentially convex at x ¯ even when h k is tangentially convex at x ¯ . Realize that, if we remove the equality or set constraints in (NMOP), we could simply ignore the corresponding term in the expression of constraint qualifications. Since cl D ( Π , x ¯ ) cl W D ( Π , x ¯ ) T ( Π , x ¯ ) , the following implications hold:
( ZCQ ) ( WZCQ ) ( ACQ ) .
The converse implications do not hold by default. In particular, the following example demonstrates that (ACQ) does not generally imply (WZCQ).
Example 2. 
Let Π = ( x , y ) R 2 : g i ( x , y ) 0 ; i = 1 , 2 ; h ( x , y ) = 0 ; ( x , y ) Ω , where
g 1 ( x , y ) = | x | 3 y , g 2 ( x , y ) = x 2 + y , h ( x , y ) = 0 , y 0 , y , y < 0 ,
and Ω = R × [ 0 , 1 ] . It is straightforward to check that g 1 , g 2 and h are all tangentially convex at x ¯ = ( 0 , 0 ) Π . We also have T g 1 ( x ¯ ) = { ( 0 , 1 ) } , T g 2 ( x ¯ ) = { ( 0 , 1 ) } , T h ( x ¯ ) = { 0 } × [ 1 , 0 ] and T ( Π , x ¯ ) = G T H T T ( Ω , x ¯ ) = R × { 0 } . This yields that (ACQ) holds at x ¯ . However, as W D ( Π , x ¯ ) = { ( 0 , 0 ) } , (WZCQ) does not hold at x ¯ .
The formulation of the KKT necessary conditions will rely on the two following lemmas.
Lemma 1 
([18]). Let { S j | j J } be a family of nonempty convex sets in R n . Then, every nonzero vector of C = cone ( j J S j ) can be written as a non-negative linear combination of at most n linear independent vectors, each belonging to a different S j .
Lemma 2. 
Let S 1 and S 2 two subsets of R n . If S 1 S 2 = , then one has
int ( S 1 ) c l ( S 2 ) = ,
Proof. 
Suppose that there exists s int ( S 1 ) cl ( S 2 ) . Then, there exists ε > 0 such that B ( s , ε ) S 1 and for all r > 0 one has B ( s , r ) S 2 . By choosing r = ε , one obtains S 1 S 2 , which contradicts the fact that S 1 S 2 = . □
The next lemma is the semi-infinite version of Motzkin’s theorem of the alternative discussed in [19] and given in [20].
Lemma 3. 
Let S , T and P be three arbitrary index sets (possibly infinite). Consider the maps φ : S R n , ϕ : T R n and ψ : P R n . If the set
co { φ ( s ) , s S } + cone { ϕ ( t ) , t T } + lin { ψ ( p ) , p P }
is closed, then the following two assertions are equivalent:
(i) 
There is no d R n solution to the system
φ ( s ) , d < 0 , s S , S , ϕ ( t ) , d 0 , t T , ψ ( p ) , d = 0 , p P ;
(ii) 
0 co { φ ( s ) , s S } + cone { ϕ ( t ) , t T } + lin { ψ ( p ) , p P } .
We are now ready to give necessary optimality conditions of KKT-type for local ρ -quasi efficient solutions of (NMOP).
Theorem 1. 
Let x ¯ be a local ρ-quasi efficient solution of (NMOP). Suppose that (WZCQ) is satisfied at x ¯ . Moreover, assume that the set
D = cone ( j = 1 p T g j ( x ¯ ) ) N ( Ω , x ¯ ) + lin k = 1 q T h k ( x ¯ )
is closed. Then, there exists λ = ( λ 1 , , λ m ) R + m with i = 1 m λ i = 1 , μ = ( μ 1 , , μ p ) A ( x ¯ ) and ν = ( ν 1 , , ν q ) R q such that
0 i = 1 m λ i T f i ( x ¯ ) + ρ i B + j = 1 p μ j T g j ( x ¯ ) + k = 1 q ν k T h k ( x ¯ ) + N ( Ω , x ¯ ) .
Proof. 
We claim that
F T s W D ( Π , x ¯ ) = .
Indeed, contrary to our claim, suppose that there exists y * F T s W D ( Π , x ¯ ) , then we obtain y * F T s and y * W D ( Π , x ¯ ) .
Note first that, from y * F T s = i = 1 m ( T f i ( x ¯ ) + ρ i B ) s , it follows that
x * , y * + ρ i y * < 0 , x * T f i ( x ¯ ) , i I .
For each i I , define φ i : T f i ( x ¯ ) R n R as φ i ( x * ) = x * , y * for all x * T f i ( x ¯ ) .
The continuity of φ i on the compact set T f i ( x ¯ ) implies the existence of x ¯ i * T f i ( x ¯ ) with
φ i ( x ¯ i * ) = max x * T f i ( x ¯ ) x * , y * .
Thus,
x ¯ i * , y * = f i ( x ¯ , y * ) .
Hence, according to (5), we obtain for every i I
f i ( x ¯ , y * ) + ρ i y * = x ¯ i * , y * + ρ i y * < 0 .
Now, since y * W D ( Π , x ¯ ) , there is t k 0 satisfying x ¯ + t k y * Π for all k. Because x ¯ is a local ρ -quasi efficient solution of (NMOP), there is x ¯ + t k y * B ( x ¯ , r ) , for some r > 0 and for large k such that there is i 0 I verifying
f i 0 ( x ¯ + t k y * ) f i 0 ( x ¯ ) ρ i 0 t k y * .
In combining this with the fact that
f i 0 ( x ¯ , y * ) + ρ i 0 y * = lim k f i 0 ( x ¯ + t k y * ) f i 0 ( x ¯ ) t k + ρ i 0 y * ,
we obtain f i 0 ( x ¯ , y * ) + ρ i 0 y * 0 for i 0 I , which contradicts (6), and consequently, (4) is fulfilled.
Taking into account (4) and applying Lemma 2 to S 1 = F T s and S 2 = W D ( Π , x ¯ ) , we obtain
int F T s cl W D ( Π , x ¯ ) = .
Thus,
F T s cl W D ( Π , x ¯ ) = .
On the basis of (WZCQ), we have
i I ( T f i ( x ¯ ) + ρ i B ) s j J ( x ¯ ) T g j ( x ¯ ) k K T h k ( x ¯ ) T ( Ω , x ¯ ) = .
The combination of the closedness and convexity of Ω with ([21] Corollary 5.2.5]) tells us that T ( Ω , x ¯ ) = N ( Ω , x ¯ ) . Then, from (7), we see that the system
ζ i , y * < 0 , ζ i T f i ( x ¯ ) + ρ i B , i I ϑ j , y * 0 , ϑ j T g j ( x ¯ ) , j J ( x ¯ ) η k , y * = 0 , η k T h k ( x ¯ ) , k K , θ , y * 0 , θ N ( Ω , x ¯ ) ,
has no solution y * R n . On the other hand, since T f i ( x ¯ ) is compact for all i I , the set i = 1 m ( T f i ( x ¯ ) + ρ i B ) is also compact, and hence i = 1 m ( T f i ( x ¯ ) + ρ i B ) + D is closed because so is D. Thus, by virtue of Lemma 3, we are led to
0 co i = 1 m ( T f i ( x ¯ ) + ρ i B ) + cone j J ( x ¯ ) T g j ( x ¯ ) N ( Ω , x ¯ ) + lin k = 1 q T h k ( x ¯ ) ,
as well as
0 co i = 1 m ( T f i ( x ¯ ) + ρ i B ) + cone j J ( x ¯ ) T g j ( x ¯ ) + lin k = 1 q T h k ( x ¯ ) + N ( Ω , x ¯ ) .
This yields (3) on the basis of Lemma 1. □
To illustrate Theorem 1, we present in what follows two examples of (NMOP).
Example 3. 
Let ρ = ( 1 , 1 ) , Ω = [ 0 , 1 ] and f = ( f 1 , f 2 ) : R R 2 , g : R R , h : R R be given by
f 1 ( x ) = x 2 sin ( 2 / x ) , x 0 , 0 , x = 0 , f 2 ( x ) = x 2 x , g ( x ) = x 1 , x 0 , x 1 , x < 0 , h ( x ) = 0 , x 0 , x , x < 0 .
Let x ¯ = 0 Π = [ 0 , 1 ] . Since for V = ( 1 , 1 ) , which is a neighborhood of x ¯ , one has f 1 ( x ) | x | and f 2 ( x ) | x | does not hold for all x V Π , then x ¯ is a local ρ-quasi efficient solution of (NMOP) (and not a local efficient solution since, for all neighborhoods V of 0, one has f ( x ) f ( 0 ) for some x V Π ). An easy calculation shows that
T f 1 ( x ¯ ) = { 0 } , T f 2 ( x ¯ ) = { 1 } , T g ( x ¯ ) = [ 1 , 1 ] , T h ( x ¯ ) = [ 1 , 0 ] , N ( Ω , x ¯ ) = ( , 0 ] , c l W D ( Π , x ¯ ) = [ 0 , + ) , T g ( x ¯ ) = { 0 } , T h ( x ¯ ) = { 0 } .
Hence, D = cone T g ( x ¯ ) N ( Ω , x ¯ ) + lin T h ( x ¯ ) = R is closed and
T g ( x ¯ ) T h ( x ¯ ) T ( Ω , x ¯ ) cl W D ( Π , x ¯ ) .
Thus, (WZCQ) is fulfilled at x ¯ . Consequently, x ¯ satisfies the assumptions of Theorem 1. In taking λ 1 = λ 2 = μ = ν = 1 2 , the optimality condition (3) is verified.
Remark 1. 
The above example confirms that most known subdifferentials (Clarke, Michel Penot, Mordukhovich, etc.) may often contain the tangential subdifferential, and hence optimality conditions in terms of the latter provide a more general framework. Indeed, according to ([12], Example 2.2), the function f 1 is MP regular ([16]) at x ¯ and T f 1 ( x ¯ ) = { 0 } C f 1 ( x ¯ ) = [ 2 , 2 ] .
The next example demonstrates that ([8], Theorem 3.10) can not be applied to obtain a necessary optimality condition, while we can do so by employing Theorem 1.
Example 4. 
Consider the functions f = ( f 1 , f 2 ) : R 2 R 2 , g : R 2 R , h : R 2 R defined by
f 1 ( x , y ) = x 3 / y x , y 0 , 0 , y = 0 , f 2 ( x , y ) = max { x , y } , g ( x , y ) = x 2 + y , h ( x , y ) = x 3 + y .
In taking Ω = [ 0 , 1 ] × [ 0 , 1 ] , we have Π = { ( x , y ) [ 0 , 1 ] × [ 0 , 1 ] | y = x 3 } . Let ρ = ( 1 , 1 ) and x ¯ = ( 0 , 0 ) Π . We can see that x ¯ is a local ρ-quasi efficient solution of (NMOP), and, again, we can easily show that
T f 1 ( x ¯ ) = { ( 1 , 0 ) } , T f 2 ( x ¯ ) = co { ( 1 , 0 ) , ( 0 , 1 ) } , T g ( x ¯ ) = { ( 0 , 1 ) } , T h ( x ¯ ) = { ( 0 , 1 ) } , T ( Ω , x ¯ ) = R + 2 , N ( Ω , x ¯ ) = R + 2 , c l W D ( Π , x ¯ ) = W D ( Π , x ¯ ) = R + × { 0 } , T g ( x ¯ ) = R × R , T h ( x ¯ ) = R × { 0 } .
Hence, D = cone T g ( x ¯ ) N ( Ω , x ¯ ) + lin T h ( x ¯ ) = R × R is closed and
T g ( x ¯ ) T h ( x ¯ ) T ( Ω , x ¯ ) = R + × { 0 } c l W D ( Π , x ¯ ) .
Thus, (WZCQ) is fulfilled at x ¯ . Consequently, x ¯ satisfies the assumptions of Theorem 1. In taking λ 1 = λ 2 = 1 2 , μ = 1 and ν = 1 , the optimality condition (3) is verified.
Remark 2. 
It is worth noting that ([8], Theorem 3.10) can not be employed for this example because f 1 is not locally Lipschitz at the local quasi efficient solution x ¯ = ( 0 , 0 ) .

4. Sufficient Optimality Conditions for Quasi (Weak) Efficient Solutions

To provide sufficient optimality conditions in this section as well as the duality results in the next section, we introduce the definition of (strictly) generalized convexity in terms of tangentially subdifferentials. Since we shall employ T h ( . ) and T ( h ) ( . ) evaluated at the reference point, we need the equality constraint function h together with its additive inverse h to both be tangentially convex. Note that this condition holds true for a large class of functions such as polynomials and rational functions, which are differentiable at the considered point.
Definition 4. 
Assume that f i , i I , g j , j J and ± h k , k K , are all tangentially convex at a reference point x ¯ Π . The triplet ( f , g , h ) is called generalized convex on Ω at x ¯ Ω if, for each x Ω \ { x ¯ } , x i * T f i ( x ¯ ) , i I , y j * T g j ( x ¯ ) , j J , z k * T h k ( x ¯ ) and w k * T ( h k ) ( x ¯ ) , k K , there exists υ T ( Ω , x ¯ ) satisfying
f i ( x ) f i ( x ¯ ) x i * , υ i I g j ( x ) g j ( x ¯ ) y j * , υ j J h k ( x ) h k ( x ¯ ) z k * , υ k K ( h k ) ( x ) ( h k ) ( x ¯ ) w k * , υ k K b * , υ x x ¯ b * B .
Moreover, if the first inequality is strict, then ( f , g , h ) is called strictly generalized convex on Ω at x ¯ .
Remark 3. 
Recall that a Dini-convex function at x ¯ Ω [11] means a function φ : R n R that satisfies for each x Ω
φ ( x ) φ ( x ¯ ) x * , x x ¯ , x * T φ ( x ¯ ) .
Obviously, if the functions f i , g j and ± h k are all tangentially convex and Dini-convex at x ¯ Ω , then ( f , g , h ) will be generalized convex on Ω at x ¯ by taking υ = x x ¯ for all x Ω . That the converse is not always true can be seen from the following example:
Example 5. 
For x R , let
f ( x ) = x 3 + x , g ( x ) = 2 x , i f x 0 x 2 + x , o t h e r w i s e , h ( x ) = 2 x 2 + x ,
Observe that ( f , g , h ) is generalized convex on Ω = [ 1 , 1 ] at x ¯ = 0 . Indeed for all x Ω \ { x ¯ } , x * T f ( x ¯ ) = { 1 } , y * T g ( x ¯ ) = [ 1 , 2 ] , z * T h ( x ¯ ) = { 1 } and w * T ( h ) ( x ¯ ) = { 1 } , there exists υ = 2 x 2 + x T ( Ω , x ¯ ) = R satisfying all the inequalities of Definition 4. However, we see that f, g and h are all not Dini-convex at x ¯ = 0 . Indeed, for x = 1 , there exists x * T f ( 0 ) = T h ( 0 ) = { 1 } for which f ( x ) f ( x ¯ ) x * , x x ¯ and h ( x ) h ( x ¯ ) x * , x x ¯ are not satisfied, and, for x = 1 , there exists x * T g ( 0 ) = [ 1 , 2 ] for which g ( x ) g ( x ¯ ) x * , x x ¯ is not satisfied.
Remark 4. 
From the tangentially convexity of h and h at x ¯ , it is easy to prove that T ( h ) ( x ¯ ) = T h ( x ¯ ) , and thereafter we can see that the following system of two inequalities
h k ( x ) h k ( x ¯ ) z k * , υ , k K , ( h k ) ( x ) ( h k ) ( x ¯ ) w k * , υ , k K ,
which appears in Definition 4, implies that
h k ( x ) h k ( x ¯ ) = z k * , υ , k K .
Our next step is to investigate sufficient optimality conditions for quasi (weak) efficient solutions of (NMOP). We always suppose that f i , i I , g j , j J and ± h k , k K are all tangentially convex at a reference point x ¯ Π .
Theorem 2. 
If x ¯ is feasible to (NMOP) such that the optimality condition (3) holds and ( f , g , h ) is strictly generalized convex on Ω at x ¯ ; then, x ¯ is a ρ-quasi efficient solution of (NMOP).
Proof. 
Contrary to our claim, suppose x ¯ is not a ρ -quasi efficient solution. This means that we can find a vector x Π satisfying
f i ( x ) + ρ i x x ¯ f i ( x ¯ ) , for all i I ,
with strict inequality for at least one i. In multiplying both sides of this inequality by λ i and summing over i, we are led to
i = 1 m λ i f i ( x ) + i = 1 m λ i ρ i x x ¯ i = 1 m λ i f i ( x ¯ ) .
On the other side, on the basis of (3), there exist x i * T f i ( x ¯ ) , i = 1 , , m , y j * T g j ( x ¯ ) , j = 1 , , p , z k * T h k ( x ¯ ) , k = 1 , , q , b * B and ω * N ( Ω , x ¯ ) satisfying
i = 1 m λ i x i * + j = 1 p μ j y j * + k = 1 q ν k z k * + i = 1 m λ i ρ i b * + ω * = 0 ,
or, equivalently,
i = 1 m λ i x i * + j = 1 p μ j y j * + k = 1 q ν k z k * + i = 1 m λ i ρ i b * = ω * .
Since ( f , g , h ) is strictly generalized convex on Ω at x ¯ , then, by Definition 4 and Remark 4, one has for x stated in (8) that there is υ T ( Ω , x ¯ ) such that
f i ( x ) f i ( x ¯ ) > x i * , υ , i I , g j ( x ) g j ( x ¯ ) y j * , υ , j J , 0 = z k * , υ , k K , b * , υ x x ¯ , b * B .
Multiplying both sides of the above inequalities respectively by λ i , μ j , ν k and λ i ρ i and summing over i, we obtain
0 ω * , υ = i = 1 m λ i x i * , υ + j = 1 p μ j y j * , υ + k = 1 q ν k z k * , υ + i = 1 m λ i ρ i b * , υ < i = 1 m λ i f i ( x ) f i ( x ¯ ) + j = 1 p μ j g j ( x ) g j ( x ¯ ) + i = 1 m λ i ρ i x x ¯ .
Therefore, from x Π \ { x ¯ } and μ A ( x ¯ ) ,
i = 1 m λ i f i ( x ¯ ) < i = 1 m λ i f i ( x ) + i = 1 m λ i ρ i x x ¯ ,
which presents a contradiction to (9). □
Remark 5. 
If in the previous theorem, the triplet ( f , g , h ) is only generalized convex on Ω at x ¯ , then, following the same previous proof steps, we can show that x ¯ is a weak ρ-quasi efficient solution of (NMOP).

5. Duality

Related to (NMOP), we investigate in this section dual problems according to Wolfe [22] and Mond–Weir [23], and explore weak, strong and converse duality relations.

5.1. The Wolfe Duality

Let τ = ( 1 , , 1 ) R m . We first formulate the Wolfe type dual problem for (NMOP)
( WP ) max f ˜ ( u , λ , μ , ν , ρ ) = f ( u ) + j = 1 p μ j g j ( u ) + k = 1 q ν k h k ( u ) τ , s . t . 0 i = 1 m λ i T f i ( u ) + ρ i B + j = 1 p μ j T g j ( u ) + k = 1 q ν k T h k ( u ) + N ( Ω , u ) , u Ω , λ R + m , i = 1 m λ i = 1 , μ R + p , ν R q , ρ int ( R + m ) .
Its feasible set is given by
Π W = { ( u , λ , μ , ν , ρ ) Ω × R + m × R + p × R q × int ( R + m ) : i = 1 m λ i = 1 , 0 i = 1 m λ i T f i ( u ) + ρ i B + j = 1 p μ j T g j ( u ) + k = 1 q ν k T h k ( u ) + N ( Ω , u ) } .
Let us start with a weak Wolfe duality theorem.
Theorem 3.
(Weak duality) Assume that ( u , λ , μ , ν , ρ ) Π W . If ( f , g , h ) is generalized convex on Ω at u, then, for each ξ ρ , there exists r > 0 such that, for each x B ( u , r ) Π , we do not have f ( x ) < f ˜ ( u , λ , μ , ν , ρ ) ξ x u .
Proof. 
Let ( u , λ , μ , ν , ρ ) Π W ; then, there exist x i * T f i ( u ) , i = 1 , , m , y j * T g j ( u ) , j = 1 , , p , z k * T h k ( u ) , k = 1 , , q , b * B and w * N ( Ω , u ) satisfying
i = 1 m λ i x i * + ρ i b * + j = 1 p μ j y j * + k = 1 q ν k z k * + w * = 0 .
By contradiction, assume that there is ξ ρ such that, for each r > 0 , there is x B ( u , r ) Π such that f ( x ) < f ˜ ( u , λ , μ , ν , ρ ) ξ x u . Then,
i = 1 m λ i f i ( x ) f ˜ i ( u , λ , μ , ν , ρ ) + ξ i x u < 0 .
Hence,
i = 1 m λ i f i ( x ) f i ( u ) + ξ i x u j = 1 p μ j g j ( u ) k = 1 q ν k h k ( u ) < 0 .
Thus,
i = 1 m λ i f i ( x ) f i ( u ) + ξ i x u i = 1 m λ i j = 1 p μ j g j ( u ) + k = 1 q ν k h k ( u ) < 0 .
From i = 1 m λ i = 1 , it follows that
i = 1 m λ i ( f i ( x ) f i ( u ) + ξ i x u ) j = 1 p μ j g j ( u ) + k = 1 q ν k h k ( u ) < 0 .
However, by virtue of the generalized convexity of ( f , g , h ) on Ω at u and Remark 4, there is υ T ( Ω , u ) such that
f i ( x ) f i ( u ) x i * , υ , i I , g j ( x ) g j ( u ) y j * , υ , j J , h k ( x ) h k ( u ) = z k * , υ , k K , b * , υ x u , b * B .
In combining the above inequalities with (10) while considering that g j ( x ) 0 ( j J ) and h k ( x ) = 0 ( k K ) , we obtain
0 w * , υ = i = 1 m λ i x i * , υ + j = 1 p μ j y j * , υ + k = 1 q ν k z k * , υ + i = 1 m λ i ρ i b * , υ i = 1 m λ i f i ( x ) f i ( u ) + ξ i x u j = 1 p μ j g j ( u ) + k = 1 q ν k h k ( u ) ,
which stands in contradiction to (11). □
Now, we establish the following strong Wolfe duality theorem.
Theorem 4.
(Strong duality) Let u be a local ρ-quasi efficient solution of (NMOP), D in (2) be closed and (WZCQ) holds at u. Then, there are λ R + m , μ A ( u ) and ν R q such that ( u , λ , μ , ν , ρ ) Π W and f ( u ) = f ˜ ( u , λ , μ , ν , ρ ) . Moreover, if ( f , g , h ) is generalized convex on Ω at u, then, for each ξ ρ , one has ( u , λ , μ , ν , ρ ) is a local weak ξ-quasi efficient solution of (WP).
Proof. 
From Theorem 1, there exist λ R + m , μ A ( u ) and ν R q satisfying
0 i = 1 m λ i T f i ( u ) + ρ i B + j = 1 p μ j T g j ( u ) + k = 1 q ν k T h k ( u ) + N ( Ω , u ) .
On the basis of μ j g j ( u ) = 0 , for any j J and h k ( u ) = 0 for any k K , we see that
j = 1 p μ j g j ( u ) + k = 1 q ν k h k ( u ) = 0 .
Consequently, f ( u ) = f ˜ ( u , λ , μ , ν , ρ ) , which means that ( u , λ , μ , ν , ρ ) Π W .
Furthermore, recalling the generalized convexity of ( f , g , h ) on Ω at u, we see from Theorem 3 that, for each ξ ρ , we can find r > 0 such that, for each x B ( u , r ) Π , we do not have f ( x ) < f ˜ ( u , λ , μ , ν , ρ ) ξ x u . Hence, we conclude that ( u , λ , μ , ν , ρ ) is a local weak ξ -quasi efficient solution of (WP). □
Remark 6. 
We can easily verify that, if we assume that the triplet ( f , g , h ) is strictly generalized convex, then the strict inequality in the conclusion of Theorem 3 will hold non-strict; i.e., we do not have f ( x ) f ˜ ( u , λ , μ , ν , ρ ) ξ x u . This stronger assumption of strict generalized convexity when added in Theorem 4 will yield a local ξ-quasi efficient solution of (WP).
The following example presents an illustration of Theorem 4.
Example 6. 
Consider the functions f = ( f 1 , f 2 ) : R 2 R 2 , g : R 2 R and h : R 2 R defined respectively by f 1 ( x , y ) = x + y 2 , f 2 ( x , y ) = | x | + | y | , g ( x , y ) = x and h ( x , y ) = y . Let Ω = [ 0 , 1 ] × [ 0 , 1 ] and ρ = ( 1 , 1 ) . We have Π = [ 0 , 1 ] × { 0 } and for any u = ( u 1 , u 2 ) R 2 , the Wolfe type dual problem of (NMOP) is
max f ˜ ( u , λ , μ , ν , ρ ) = ( u 1 + u 2 2 , | u 1 | + | u 2 | ) + μ u 1 + ν u 2 ( 1 , 1 ) , s . t . 0 λ 1 T f 1 ( u ) + λ 2 T f 2 ( u ) + μ T g ( u ) + ν T h ( u ) + B + N ( Ω , u ) , ( u , λ , μ , ν , ρ ) Ω × R + 2 × R + × R w i t h λ 1 + λ 2 = 1 .
It is straightforward to verify that u ¯ = ( 0 , 0 ) Π is a local ρ-quasi efficient solution of (NMOP). An easy calculation reveals that
T f 1 ( u ¯ ) = { ( 1 , 0 ) } , T f 2 ( u ¯ ) = [ 1 , 1 ] × [ 1 , 1 ] , T g ( u ¯ ) = { ( 1 , 0 ) } , T h ( u ¯ ) = { ( 0 , 1 ) } , T ( Ω , u ¯ ) = R + 2 , N ( Ω , u ¯ ) = R + 2 , T g ( u ¯ ) = R + × R , T h ( u ¯ ) = R × { 0 } , c l W D ( Π , u ¯ ) = R + × { 0 } .
Hence, T g ( u ¯ ) T h ( u ¯ ) T ( Ω , u ¯ ) = R + × { 0 } c l W D ( Π , u ¯ ) .
Thus, (WZCQ) is fulfilled at u ¯ . In taking λ 1 = λ 2 = 1 2 , μ = 1 and ν = 1 2 , we obtain ( u ¯ , λ , μ , ν , ρ ) Π W . Since D is closed and ( f , g , h ) is generalized convex on Ω at u ¯ , then, by Theorem 4, we deduce that, for each ξ ρ , one has that ( u ¯ , λ , μ , ν , ρ ) is a local weak ξ-quasi efficient solution of (12).
Remark 7. 
  • Since the notions of quasi efficiency and generalized convexity are respectively more general than those of efficiency and Dini-convexity, our results improve and extend the corresponding recent results in [11,12] when the number of constraints is finite.
  • Taking into account that our objective and constraint functions are not necessarily assumed to be locally Lipschitz as is the case in [4,8], the results of this section are more general in this aspect.
The following results present two new converse duality theorems.
Theorem 5.
(Converse duality) Assume that ( u , λ , μ , ν , ρ ) Π W such that u Π . If ( f , g , h ) is strictly generalized convex on Ω at u, then u is a ρ-quasi efficient solution of (NMOP).
Proof. 
Suppose that ( u , λ , μ , ν , ρ ) Π W with u Π . Then,
0 i = 1 m λ i T f i ( u ) + ρ i B + j = 1 p μ j T g j ( u ) + k = 1 q ν k T h k ( u ) + N ( Ω , u ) .
Since ( f , g , h ) is strictly generalized convex on Ω at u, then, by Theorem 2, we deduce that u is a ρ -quasi efficient solution of (NMOP). □
Remark 8. 
Notice that, if in the previous theorem, the triplet ( f , g , h ) is only generalized convex on Π at u, then following the same previous proof steps, we can show that u is a weak ρ-quasi efficient solution of (NMOP).
Theorem 6.
(Strict converse duality) Assume that u is a ρ-quasi efficient solution of (NMOP) and ( u ¯ , λ , μ , ν , ρ ) is a ρ-quasi efficient solution of (WP) such that
λ T f ( u ) + λ T ρ u u ¯ λ T f ˜ ( u ¯ , λ , μ , ν , ρ ) ,
where λ T is the transpose of the vector ( λ 1 , , λ m ) .
If ( f , g , h ) is strictly generalized convex on Ω at u ¯ , then u = u ¯ .
Proof. 
By contradiction, assuming that u u ¯ . Since ( u ¯ , λ , μ , ν , ρ ) Π W , then
there exist x i * T f i ( u ¯ ) , i = 1 , , m , y j * T g j ( u ¯ ) , j = 1 , , p , z k * T h k ( u ¯ ) , k = 1 , , q , b * B and w * N ( Ω , u ¯ ) satisfying
i = 1 m λ i x i * + ρ i b * + j = 1 p μ j y j * + k = 1 q ν k z k * + w * = 0 .
Hence, for all υ T ( Ω , u ¯ ) , one has
w * , υ = i = 1 m λ i x i * , υ + j = 1 p μ j y j * , υ + k = 1 q ν k z k * , υ + i = 1 m λ i ρ i b * , υ 0
However, since u u ¯ and ( f , g , h ) is strictly generalized convex on Ω at u ¯ , then, by Definition 4 and Remark 4, there is υ T ( Ω , u ¯ ) such that
f i ( u ) f i ( u ¯ ) > x i * , υ , i I , g j ( u ) g j ( u ¯ ) y j * , υ , j J , h k ( u ) h k ( u ¯ ) = z k * , υ , k K , b * , υ u u ¯ , b * B .
In combining the above inequalities with (14) while considering that g j ( u ) 0 ( j J ) and h k ( u ) = 0 ( k K ) , we obtain
i = 1 m λ i f i ( u ) f i ( u ¯ ) + ρ i u u ¯ j = 1 p μ j g j ( u ¯ ) + k = 1 q ν k h k ( u ¯ ) > 0 .
Since i = 1 m λ i = 1 , then
i = 1 m λ i f i ( u ) f i ( u ¯ ) + ρ i u u ¯ i = 1 m λ i j = 1 p μ j g j ( u ¯ ) + k = 1 q ν k h k ( u ¯ ) > 0 .
Thus,
i = 1 m λ i f i ( u ) f i ( u ¯ ) + ρ i u u ¯ j = 1 p μ j g j ( u ¯ ) + k = 1 q ν k h k ( u ¯ ) > 0 .
Therefore,
λ T f ( u ) + λ T ρ u u ¯ > λ T f ˜ ( u ¯ , λ , μ , ν , ρ ) ,
which stands in contradiction to (13). □

5.2. The Mond–Weir Duality

We are concerned here with the Mond–Weir duality type for (NMOP). To proceed, we consider
( MWP ) max f ( u ) , s . t . 0 i = 1 m λ i T f i ( u ) + ρ i B + j = 1 p μ j T g j ( u ) + k = 1 q ν k T h k ( u ) + N ( Ω , u ) , j = 1 p μ j g j ( u ) + k = 1 q ν k h k ( u ) 0 , u Ω , λ R + m , i = 1 m λ i = 1 , μ R + p , ν R q , ρ int ( R + m ) ,
which has a feasible set given by
Π D = { ( u , λ , μ , ν , ρ ) Ω × R + m × R + p × R q × int ( R + m ) : i = 1 m λ i = 1 , 0 i = 1 m λ i T f i ( u ) + ρ i B + j = 1 p μ j T g j ( u ) + k = 1 q ν k T h k ( u ) + N ( Ω , u ) , j = 1 p μ j g j ( u ) + k = 1 q ν k T h k ( u ) 0 } .
The following theorem presents a weak Mond–Weir duality result.
Theorem 7.
(Weak duality) If ( u , λ , μ , ν , ρ ) Π D and ( f , g , h ) is generalized convex on Ω at u, then, for each ξ ρ , we can find r > 0 such that, for each x B ( u , r ) Π , the inequality f ( x ) < f ( u ) ξ x u does not hold.
Proof. 
Since ( u , λ , μ , ν , ρ ) is a feasible point for (MWP), there exist x i * T f i ( u ) , i = 1 , , m , y j * T g j ( u ) , j = 1 , , p , z k * T h k ( u ) , k = 1 , , q , b * B and w * N ( Ω , u ) satisfying
i = 1 m λ i x i * + j = 1 p μ j y j * + k = 1 q ν k z k * + i = 1 m λ i ρ i b * + w * = 0 ,
and
j = 1 p μ j g j ( u ) + k = 1 q ν k h k ( u ) 0 .
By contradiction, assume that there is ξ ρ such that, for each r > 0 , there is x B ( u , r ) Π such that f ( x ) < f ( u ) ξ x u . Then,
i = 1 m λ i f i ( x ) f i ( u ) + ξ i x u < 0 .
Because ( f , g , h ) is generalized convex on Ω at u, then, by Definition 4 and Remark 4, there is υ T ( Ω , u ) such that
f i ( x ) f i ( u ) x i * , υ , i I , g j ( x ) g j ( u ) y j * , υ , j J , h k ( x ) h k ( u ) = z k * , υ , k K , b * , υ x u , b * B .
The combination of the above inequalities with (15), while taking into account that g j ( x ) 0 for any j J and h k ( x ) = 0 for any k K , tells us that
0 w * , υ = i = 1 m λ i x i * , υ + j = 1 p μ j y j * , υ + k = 1 q ν k z k * , υ + i = 1 m λ i ρ i b * , υ i = 1 m λ i f i ( x ) f i ( u ) + ξ i x u j = 1 p μ j g j ( u ) + k = 1 q ν k h k ( u ) ,
From (16), we see that
i = 1 m λ i f i ( x ) f i ( u ) + ξ i x u 0 ,
which stands in contradiction to (17). □
Next, we establish the following strong Mond–Weir duality result.
Theorem 8.
(Strong duality) Let u be a local ρ-quasi efficient solution of (NMOP), D be closed and (WZCQ) be satisfied at u. Then, there exist λ R + m , μ A ( u ) and ν R q such that ( u , λ , μ , ν , ρ ) Π D . Moreover, if ( f , g , h ) is generalized convex on Ω at u, then, for each ξ ρ , one has ( u , λ , μ , ν , ρ ) is a local weak ξ-quasi efficient solution of (MWP), and the objective values of (NMOP) and (MWP) are equal.
Proof. 
According to Theorem 1, there exist λ R + m , μ A ( u ) and ν R q satisfying
0 i = 1 m λ i T f i ( u ) + j = 1 p μ j T g j ( u ) + k = 1 q ν k T h k ( u ) + i = 1 m λ i ρ i B + N ( Ω , u ) .
From μ j g j ( u ) = 0 for any j J and h k ( u ) = 0 for all k K , we see that
j = 1 p μ j g j ( u ) + k = 1 q ν k h k ( u ) = 0 .
Consequently ( u , λ , μ , ν , ρ ) Π D . As ( f , g , h ) is generalized convex on Ω at u, Theorem 7 tells us that, for each ξ ρ , there exists r > 0 such that, for each x B ( u , r ) Π , we do not have f ( x ) < f ( u ) ξ x u . Hence, we obtain that ( u , λ , μ , ν , ρ ) is a local weak ξ -quasi efficient solution of (WP). It is easy to see that the objective values of (NMOP) and (MWP) are equal to f ( u ) . □
Remark 9. 
Again, we can easily verify that, if we require the triplet ( f , g , h ) to be strictly generalized convex in Theorem 7, then we will obtain, for each ξ ρ , that there exists r > 0 such that, for each x B ( u , r ) Π , the inequality f ( x ) f ( u ) ξ x u does not hold. This stronger assumption when added in Theorem 8 will yield that, for each ξ ρ , one has ( u , λ , μ , ν , ρ ) is a local ξ-quasi efficient solution of (MWP).
Using a proof similar to that of Theorem 5, we can show the following theorem.
Theorem 9.
(Converse duality) Assume that ( u , λ , μ , ν , ρ ) Π D such that u Π . If ( f , g , h ) is strictly generalized convex on Ω at u, then u is a ρ-quasi efficient solution of (NMOP).
The proof of the following theorem follows on the lines of Theorem 6 and hence is omitted.
Theorem 10.
(Strict converse duality) Assume that u is a ρ-quasi efficient solution of (NMOP) and ( u ¯ , λ , μ , ν , ρ ) is a ρ-quasi efficient solution of (MWP) such that (13) is fulfilled. If ( f , g , h ) is strictly generalized convex on Ω at u ¯ , then u = u ¯ .

6. Conclusions

In this paper, in terms of tangential subdifferentials, we established necessary and sufficient optimality conditions as well as Wolfe and Mond–Weir type duality results for a nonsmooth multiobjective optimization problem with mixed constraints using the concept of (local/weak) quasi efficiency and generalized convexity. Our results include two lines of generalization regarding optimality conditions for (NMOP):
  • Since the notions of quasi efficiency and generalized convexity are respectively more general than those of efficiency and Dini-convexity, our results improve and extend the corresponding recent results in [11,12] when the number of constraints is finite.
  • In view of Remarks 1 and 2, our results extend and improve those of Golestani et al. [8] and Gupta et al. [4] as we obtained similar optimality conditions and duality results, but we dropped the local Lipschitz assumption at the local quasi efficient solution of (NMOP). Furthermore, instead of a Clarke subdiffierential, we have used the tangential subdifferential, which yields more generalized optimality conditions for a large class of nonconvex and nondifferentiable optimization problems. Finally, our work also includes many additional duality results of Wolfe and Mond–Weir type which are not found in the aforementioned papers.
For future research, the same approach could be used to investigate optimality conditions and duality results for multiobjective semi-infinite programming.

Author Contributions

Conceptualization, M.J., E.M.K. and L.L.; methodology, M.J. and L.L.; validation, E.M.K. and A.H.; formal analysis, M.J., E.M.K., L.L. and A.H.; writing—original draft preparation, M.J.; writing—review and editing, E.M.K. and A.H.; supervision, E.M.K. and L.L.; funding acquisition, A.H. All authors have read and agreed to the published version of the manuscript.

Funding

The authors extend their appreciation to the Deanship of Scientific Research at King Khalid University for funding this work through research groups program (Grant No. RGP.1/139/43).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

The authors would like to thank three anonymous reviewers for their valuable comments and suggestions which improved the presentation of this paper.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Mistakidis, E.S.; Stavroulakis, G.E. Nonconvex Optimization in Mechanics. Smooth and Nonsmooth Algorithms, Heuristics and Engineering Applications by the F.E.M; Kluwer Academic Publisher: Dordrecht, The Netherlands, 1998. [Google Scholar]
  2. Gründemann, H.; Moreau, J.J.; Panagiotopoulos, P.D.; Strang, G. Topics in Nonsmooth Mechanics. Basel, etc., Birkhäuser Verlag 1988. XIII, 329 pp., sfr 198,-. ISBN 3–7643-1907–0. J. Appl. Math. Mech. 1989, 69, 434. [Google Scholar]
  3. Outrata, J.; Kocvara, M.; Zowe, J. Nonsmooth Approach to Optimization Problems with Equilibrium Constraints: Theory, Applications and Numerical Results; Springer Science & Business Media: Berlin, Germany, 2013; Volume 28. [Google Scholar]
  4. Gupta, A.; Mehra, A.; Bhatia, D. Approximate convexity in vector optimisation. Bul. Aust. Math. Soc. 2006, 74, 207–218. [Google Scholar] [CrossRef] [Green Version]
  5. Son, T.Q.; Van Tuyen, N.; Wen, C.F. Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints. Acta Math. Vietnam. 2019, 45, 435–448. [Google Scholar] [CrossRef] [Green Version]
  6. Jennane, M.; El Fadil, L.; Kalmoun, E. On local quasi efficient solutions for nonsmooth vector optimization problems. Croatian Ope. Res. Rev. 2020, 11, 240679. [Google Scholar] [CrossRef]
  7. Jiao, L.; Zhou, Y. Quasi ϵ-solutions in a semi-infinite programming problem with locally Lipschitz data. Optim. Lett. 2019, 2019, 1759–1772. [Google Scholar]
  8. Golestani, M.; Sadeghi, H.; Tavan, Y. Necessary and Sufficient Conditions for Weak Quasi Efficiency in Nonsmooth Multiobjective Problems. Num. Func. Anal. Optim. 2017, 38, 683–704. [Google Scholar] [CrossRef]
  9. Martínez-Legaz, J.E. Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints. Optim. Lett. 2015, 9, 1017–1023. [Google Scholar] [CrossRef] [Green Version]
  10. Mashkoorzadeh, F.; Movahedian, N.; Nobakhtian, S. Optimality Conditions for Nonconvex Constrained Optimization Problems. Num. Func. Anal. Optim. 2019, 40, 1918–1938. [Google Scholar] [CrossRef]
  11. Tung, L.T. Strong Karush-Kuhn-Tucker optimality conditions for multiobjective semi-infinite programming via tangential subdifferential. RAIRO Oper. Res. 2018, 52, 1019–1041. [Google Scholar] [CrossRef] [Green Version]
  12. Tung, L.T. Karush-Kuhn-Tucker Optimality optimality conditions and duality for multiobjective semi-infinite programming via tangential subdifferentials. Num. Func. Anal. Optim. 2020, 46, 659–684. [Google Scholar] [CrossRef]
  13. Pshenichnyi, B.N. Necessary Conditions for an Extremum; Marcel Dekker Inc.: New York, NY, USA, 1971. [Google Scholar]
  14. Lemaréchal, C. An Introduction to the Theory of Nonsmooth Optimization. Optimization 1986, 17, 827–858. [Google Scholar] [CrossRef]
  15. Clarke, F.C. Optimization and Nonsmooth Analysis; Wiley-Interscience: New York, NY, USA, 1983. [Google Scholar]
  16. Michel, P.; Penot, J.P. A generalized derivative for calm and stable functions. Diff. Integ. Equ. 1992, 5, 433–454. [Google Scholar]
  17. Mishra, S.K.; Upadhyay, B.B. Some relations between vector variational inequality problems and nonsmooth vector optimization problems using quasi efficiency. Positivity 2013, 17, 1071–1083. [Google Scholar] [CrossRef]
  18. Rockafellar, R.T. Convex Analysis. In Princeton Mathematical Series; Princeton University Press: Princeton, NJ, USA, 1970; Volume 28. [Google Scholar]
  19. Goberna, M.A.; López, M.A. Linear Semi-Infinite Optimization; Wiley: Chichester, UK, 1998. [Google Scholar]
  20. Zalmai, G.J.; Zhang, Q. Global Nonparametric Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Involving Generalized (η,ρ)-Invex Functions. Num. Func. Anal. Optim. 2007, 28, 173–209. [Google Scholar] [CrossRef]
  21. Hiriart-Urruty, J.B.; Lemaréchal, C. Fundamentals of Convex Analysis; Springer: Berlin/Heidelberg, Germany, 1961. [Google Scholar]
  22. Wolfe, P. A duality theorem for nonlinear programming. Quart. Appl. Math. 2001, 19, 239–244. [Google Scholar] [CrossRef]
  23. Mond, B.; Weir, T. Generalized concavity and duality. In Generalized Concavity in Optimization and Economics; Academic Press: New York, NY, USA; London, UK, 1981; pp. 263–279. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Jennane, M.; Kalmoun, E.M.; Lafhim, L.; Houmia, A. Quasi Efficient Solutions and Duality Results in a Multiobjective Optimization Problem with Mixed Constraints via Tangential Subdifferentials. Mathematics 2022, 10, 4341. https://doi.org/10.3390/math10224341

AMA Style

Jennane M, Kalmoun EM, Lafhim L, Houmia A. Quasi Efficient Solutions and Duality Results in a Multiobjective Optimization Problem with Mixed Constraints via Tangential Subdifferentials. Mathematics. 2022; 10(22):4341. https://doi.org/10.3390/math10224341

Chicago/Turabian Style

Jennane, Mohsine, El Mostafa Kalmoun, Lahoussine Lafhim, and Anouar Houmia. 2022. "Quasi Efficient Solutions and Duality Results in a Multiobjective Optimization Problem with Mixed Constraints via Tangential Subdifferentials" Mathematics 10, no. 22: 4341. https://doi.org/10.3390/math10224341

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop