Next Article in Journal
Predicting Women with Postpartum Depression Symptoms Using Machine Learning Techniques
Next Article in Special Issue
Fixed Points for (ξ,ω)-Weakly Cyclic Type Generalized Contraction Condition in Metric Spaces with an Application
Previous Article in Journal
Chaotic Synchronization in Mobile Robots
Previous Article in Special Issue
Solving System of Mixed Variational Inclusions Involving Generalized Cayley Operator and Generalized Yosida Approximation Operator with Error Terms in q-Uniformly Smooth Space
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Stationary Condition for Borwein Proper Efficient Solutions of Nonsmooth Multiobjective Problems with Vanishing Constraints

Department of Mathematics, Yunnan University, Kunming 650091, China
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(23), 4569; https://doi.org/10.3390/math10234569
Submission received: 9 October 2022 / Revised: 29 November 2022 / Accepted: 30 November 2022 / Published: 2 December 2022
(This article belongs to the Special Issue Applied Functional Analysis and Applications)

Abstract

:
This paper discusses optimality conditions for Borwein proper efficient solutions of nonsmooth multiobjective optimization problems with vanishing constraints. A new notion in terms of contingent cone and upper directional derivative is introduced, and a necessary condition for the Borwein proper efficient solution of the considered problem is derived. The concept of ε proper Abadie data qualification is also introduced, and a necessary condition which is called a strictly strong stationary condition for Borwein proper efficient solutions is obtained. In view of the strictly strong stationary condition, convexity of the objective functions, and quasi-convexity of constrained functions, sufficient conditions for the Borwein proper efficient solutions are presented. Some examples are given to illustrate the reasonability of the obtained results.

1. Introduction

Multiobjective optimization plays an important role in management science, operations research, and economics. The reader is referred to the recently published book [1] for more details on vector optimization theory and applications. The classical concept of efficient solution in multiobjective optimization problems was introduced by Pareto [2] under specific preferences. Koopmans [3] proposed the concept of a Pareto efficient solution. After that, many scholars studied Pareto efficiency and obtained a lot of results (see the book [4] and the reference therein). However, the set of all Pareto efficient solutions is large, and part of it cannot be characterized by a scalar minimization problem. To eliminate these abnormal solutions, various kinds of proper efficient solutions have been introduced (see Chapter 4 in [4]), one of which was introduced by Borwein [5] and was called the Borwein proper efficient solution by some later researchers. Since Borwein proper efficiency highlights the geometric property and abandons noneffective decisions in decision making, it has become a standard concept in vector optimization literature (see [6,7,8]).
In this paper, we consider the following multiobjective mathematical programming with vanishing constraints (MMPVC for short):
min ( f 1 ( x ) , , f p ( x ) ) s . t . h i ( x ) 0 , i I , h i ( x ) g i ( x ) 0 , i I ,
where f j , h i , g i : R n R are locally Lipschitz functions with i I : = { 1 , , m } , and j J : = { 1 , , p } .
The MMPVC is a complicated programming problem since it involves product function h i g i in its constraints with i I . This complicatedness brings us two difficulties. One is that the feasible set usually is not a convex set; the other is that the constrained property of g i ( x ) vanishes in the case h i ( x ) = 0 .
In the special case p = 1 , MMPVC reduces to the mathematical programming with vanishing constraints (MPVC for short) which was introduced by Achtziger and Kanzow [9]. MPVCs not only play an important role in topology optimization which is a powerful tool in mechanical structures design, but also extend another group of programming problems called mathematical programming with equilibrium constraints (see [9]). For these two reasons, the MPVCs have attracted some researchers’ interest. Some stationary conditions of Karush–Kuhn–Tucker-type optimality conditions are given under various qualification condition by the classical subdifferential and normal cones, such as Clarke subdifferential and Clarke normal cone. Readers are referred to the reference [9,10,11,12] for smooth MPVCs and [13,14,15] for nonsmooth MPVCs.
All MPVCs mentioned above concerned a single-objective function. To the best of our knowledge, Mishra, et al. [16] studied MMPVCs involving continuously differentiable functions for the first time. They modified some constraint qualifications such as Cottle constraint qualification, Slater constraint qualification, etc. Then, they established relationships among them and obtained the Karush–Kuhn–Tucker-type necessary optimality conditions for Pareto efficiency solutions. In [17], the MMPVC with its objective functions being continuously differentiable and its constrained function being convex were considered. Two Abadie-type constraint qualifications were introduced and some necessary conditions for Geoffrion properly efficient solutions were given by convex subdifferentials. Recently in [18], for the nonsmooth MMPVCs, some data qualifications characterized by Clarke subdifferential were introduced, and the relationship among them was discussed. Some stationary conditions as necessary or sufficient conditions of weakly efficient and Pareto efficient solutions were also given. Motivated by [18], it is natural for us to consider the stationary condition for Borwein proper efficient solutions of the MMPVC.
The rest of this paper is organized as follows. In Section 2, we introduce some notions and preliminary results which will be needed later. In Section 3, we present our main results. Unlike [18,19] concerning weak efficiency and Pareto efficiency, we consider Borwein proper efficiency. We introduce ε proper Abadie data qualification condition (in short, ε -PADQ) for a given ε > 0 . Using ε -PADQ condition, we obtain a strictly strong stationary condition as a necessary condition for the Borwein proper efficient solution of problem MMPVC. Under the assumption of the convexity of objective functions and the -quasi-convexity of constrained functions, we establish a strictly strong stationary condition as a sufficient condition for the Borwein proper efficient solution of problem MMPVC.

2. Preliminaries

Throughout this paper, unless stated otherwise, we always assume that X is a real Banach space, X * is the dual space of X, Ω is a nonempty subset of X, B X is the closed unit ball of X, and R + p = { ( ξ 1 , , ξ p ) | ξ i 0 , i { 1 , , p } } . The interior, convex hull, and closure of Ω are denoted by int ( Ω ), co ( Ω ) , and cl( Ω ), respectively.
The set Ω is called a cone if λ x Ω for all x Ω and λ 0 . Clearly, a cone Ω is convex if and only if Ω + Ω Ω . The cone generated by Ω is defined as
cone ( Ω ) : = { x X | x = λ y , λ 0 , y Ω } .
The negative and strict negative polar cone of Ω are, respectively, defined as
Ω : = { x * X * | x * , a 0 , a Ω } ,
Ω : = { x * X * | x * , a < 0 , a Ω } .
For x ¯ cl ( Ω ) , the contingent cone of Ω at x ¯ is the set
T ( Ω , x ¯ ) : = { v X | v n v , t n 0 such that x ¯ + t n v n Ω } .
Let ψ : X R , and x ¯ , u X . The function ψ is said to be upper directionally differentiable at x ¯ in the direction u if
ψ ( x ¯ ; u ) : = lim sup t 0 + ψ ( x ¯ + t u ) ψ ( x ¯ ) t
exists, where t 0 + means that t > 0 and t converges to 0. The function ψ is said to be directionally differentiable at x ¯ in the direction u, if
ψ ( x ¯ ; u ) : = lim t 0 + ψ ( x ¯ + t u ) ψ ( x ¯ ) t
exists. Clearly, if ψ is directionally differentiable at x ¯ in the direction u, then ψ ( x ¯ ; u ) = ψ ( x ¯ ; u ) . If for all u X ,
ψ ( x ¯ ) ( u ) : = lim t 0 ψ ( x ¯ + t u ) ψ ( x ¯ ) t
exists and ψ ( x ¯ ) is a continuous linear mapping, then ψ is said to be G a ^ teaux differentiable at x ¯ .
Let Y be a Banach space, z X , a mapping φ : X Y is said to be locally Lipschitz at z, if there exist δ > 0 and M > 0 such that
φ ( x ) φ ( y ) M x y , x , y z + δ B X .
If φ is locally Lipschitz at each point of Ω , then φ is said to be locally Lipschitz on Ω .
Let x ¯ , u X and ψ : X R be locally Lipschitz at x ¯ . The Clarke generalized directional derivative of ψ at x ¯ in the direction u is defined as
ψ ( x ¯ ; u ) : = lim sup x x ¯ , t 0 ψ ( x + t u ) ψ ( x ) t .
The set
ψ ( x ¯ ) : = { x * X * | x * , u ψ ( x ¯ ; u ) , u X }
is called the Clarke subdifferential of ψ at x ¯ .
Lemma 1
([20]). Let ψ : X R be a function, x ¯ , u X , and ψ be locally Lipschitz at x ¯ . Then:
(i)
ψ ( x ¯ ) is a nonempty w * compact convex set;
(ii)
There exists ξ ψ ( x ¯ ) such that ψ ( x ¯ ; u ) = ξ , u ;
(iii)
ψ ( x ¯ ; u ) ψ ( x ¯ ; u ) .
Definition 1
([21]). Let ψ : X R be a function, x ¯ X and ψ be locally Lipschitz at x ¯ . The function ψ is called ∂-quasi convex at x ¯ , if for all x X ,
ψ ( x ) ψ ( x ¯ ) ξ , x x ¯ 0 , ξ ψ ( x ¯ ) .
Definition 2
([5]). Let A be a nonempty subset of X and Θ be a pointed convex cone of X. A point x ¯ A is called a Borwein proper efficient point of A, if
cl ( cone ( A x ¯ ) ) ( Θ ) = { 0 X } .
The set of all Borwein proper efficient points of A is denoted by B E ( A , Θ ) .
The following lemma is a standard separation theorem for two convex sets.
Lemma 2
([4]). Let A be a nonempty compact convex subset of X and B be a nonempty closed convex subset of X. Then, A B = if and only if there exist x * X * { 0 X * } and α R such that
x * ( a ) < α < x * ( b ) , a A , b B .
For convenience of the readers, we give the important notations mentioned above in Table 1.

3. Main Results

In this section, we establish necessary and sufficient optimality conditions for the Borwein proper efficient solution of problem MMPVC. The feasible set of problem MMPVC is denoted as follows:
S : = { x R n | h i ( x ) 0 , h i ( x ) g i ( x ) 0 , i I } .
We always assume that S , and x ¯ S will be fixed in the remainder of this paper. Following [9,13,18], we define the index sets as follows:
I + 0 : = i I | g i ( x ¯ ) = 0 , h i ( x ¯ ) > 0 , I + : = i I | g i ( x ¯ ) < 0 , h i ( x ¯ ) > 0 , I 0 + : = i I | g i ( x ¯ ) > 0 , h i ( x ¯ ) = 0 , I 00 : = i I | g i ( x ¯ ) = 0 , h i ( x ¯ ) = 0 , I 0 : = i I | g i ( x ¯ ) < 0 , h i ( x ¯ ) = 0 .
Let I + : = I + 0 I + and I 0 : = I 0 + I 00 I 0 . Obviously, I = I + 0 I + I 0 + I 00 I 0 .
For each k J , set J k : = J { k } , and define
A k ( x ¯ ) : = T ( S , x ¯ ) u R n | f j ( x ¯ ; u ) 0 , j J k , p > 1 , T ( S , x ¯ ) , p = 1 .
Let f : = ( f 1 , , f p ) . Now, using Definition 2, we can define a Borwein proper efficient solution of problem MMPVC.
Definition 3.
A point x ¯ S is said to be a Borwein proper efficient solution of problem MMPVC, if f ( x ¯ ) BE ( f ( S ) , R + p ) , that is,
cl ( cone ( f ( S ) f ( x ¯ ) ) ) ( R + p ) = { 0 p } .
The set of all Borwein proper efficient solutions is denoted by Ξ B . If
( f ( S ) f ( x ¯ ) ) ( R + p ) = { 0 p } ,
then x ¯ is called a Pareto efficient solution of problem MMPVC. The set of all Pareto efficient solutions is denoted by Ξ E .
Lemma 3.
Suppose that x ¯ Ξ B , and f j is locally Lipschitz at x ¯ for all j J . Then,
j J f j ( x ¯ ) j J A j ( x ¯ ) = .
Proof. 
We divide p into two cases: p = 1 and p > 1 .
Case 1: p = 1 . In this case, (1) equals
f 1 ( x ¯ ) T ( S , x ¯ ) = .
Suppose to the contrary that there exists some d f 1 ( x ¯ ) T ( S , x ¯ ) , then there exist { t n } R + with t n 0 , { d n } R n with d n d such that x ¯ + t n d n S for all n. Since f 1 is locally Lipschitz at x ¯ and d f 1 ( x ¯ ) , it follows from Lemma 1 that there exists ξ c f 1 ( x ¯ ) such that
ξ , d = f 1 ( x ¯ ; d ) < 0 .
Since f 1 is locally Lipschitz at x ¯ , there exist L > 0 and δ > 0 such that for all u , v x ¯ + δ B R n ,
| f 1 ( u ) f 1 ( v ) | L u v .
Since x ¯ + t n d n x ¯ , x ¯ + t n d x ¯ , there exists a positive integer number N such that for all n > N ,
| f 1 ( x ¯ + t n d n ) f 1 ( x ¯ + t n d ) | L t n | | d n d | | .
By (iii) of Lemma 1, we have
v 1 : = lim sup n f 1 ( x ¯ + t n d n ) f 1 ( x ¯ ) t n lim sup n f 1 ( x ¯ + t n d ) f 1 ( x ¯ ) t n + lim sup n L t n d n d t n f 1 ( x ¯ ; d ) f 1 ( x ¯ ; d ) < 0 .
As
f 1 ( x ¯ + t n d n ) f 1 ( x ¯ ) t n cone f ( S ) f ( x ¯ ) ,
we obtain
v 1 cl ( cone f ( S ) f ( x ¯ ) ) ( R + ) ,
which contradicts x ¯ Ξ B since v 1 0 .
Case 2: p > 1 . To verify (1), it suffices to prove that
f j ( x ¯ ) A j ( x ¯ ) = , j J .
Without loss of generality, we only need to show that
f 1 ( x ¯ ) A 1 ( x ¯ ) = .
Suppose to the contrary that there exists d f 1 ( x ¯ ) A 1 ( x ¯ ) . Since d A 1 ( x ¯ ) T ( S , x ¯ ) , there exist { t n } R + with t n 0 , { d n } R n with d n d such that x ¯ + t n d n S . Using the same proof of case p = 1 , we obtain
v 1 : = lim sup n f 1 ( x ¯ + t n d n ) f 1 ( x ¯ ) t n < 0 ,
By the definition of A 1 ( x ¯ ) , we have
f j ( x ¯ ; d ) 0 , j = 2 , , p .
Since f j is locally Lipschitz at x ¯ , we have
v j : = lim sup n f j ( x ¯ + t n d n ) f j ( x ¯ ) t n lim sup n f j ( x ¯ + t n d ) f j ( x ¯ ) t n f j ( x ¯ ; d ) 0 , j = 2 , , p .
Therefore,
( v 1 , , v p ) cl ( cone f ( S ) f ( x ¯ ) ) ( R + p ) ,
which contradicts x ¯ Ξ B since ( v 1 , , v p ) ( 0 , , 0 ) . Therefore,
f 1 ( x ¯ ) A 1 ( x ¯ ) = .
In conclusion, Equation (1) is verified. □
Remark 1.
In [19] (Lemma 5.1) (also see [18] (Lemma 2)), Li proved that if x ¯ Ξ E , then
j J f j ( x ¯ ) j J T ( Q j , x ¯ ) = ,
where
Q j = S { x R n | f κ ( x ) f κ ( x ¯ ) , κ J j } , p > 1 , S , p = 1 .
It is known that a Borwein proper efficient solution is a Pareto efficient solution, but the converse is not true. To illustrate that Lemma 3 sharpens Li’s result, it suffices to give an example that j J T ( Q j , x ¯ ) is a strict subset of j J A j ( x ¯ ) . See the following example.
Example 1.
In problem MMPVC, we take I = { 1 } , J = { 1 , 2 } and let f : R 2 R 2 be defined by
f ( x ) = ( f 1 ( x ) , f 2 ( x ) ) = ( x 1 + x 2 , x 1 2 + x 2 2 ) , x = ( x 1 , x 2 ) R 2 ,
h 1 ( x ) = x 1 + x 2 , g 1 ( x ) = x 2 , x = ( x 1 , x 2 ) R 2 .
Clearly, x ¯ = ( 0 , 0 ) is a Borwein proper efficient solution. We calculate that
S = { x R 2 | h 1 ( x ) 0 , h 1 ( x ) g 1 ( x ) 0 } = { ( x 1 , x 2 ) R 2 | x 1 x 2 0 } { ( x 1 , x 2 ) R 2 | x 1 + x 2 = 0 , x 2 0 } ,
Q 1 = S { x R 2 | f 2 ( x ) f 2 ( x ¯ ) } = { ( 0 , 0 ) } ,
Q 2 = S { x R 2 | f 1 ( x ) f 1 ( x ¯ ) } = { ( x 1 , x 2 ) R 2 | x 1 + x 2 = 0 } ,
A 1 ( x ¯ ) = T ( S , x ¯ ) { d R 2 | f 2 ( x ¯ ; d ) 0 } = S ,
A 2 ( x ¯ ) = T ( S , x ¯ ) { d R 2 | f 1 ( x ¯ ; d ) 0 } = Q 2 ,
j = 1 2 T ( Q j , x ¯ ) = { ( 0 , 0 ) } , j = 1 2 A j ( x ¯ ) = Q 2 .
Therefore, j = 1 2 T ( Q j , x ¯ ) is a strict subset of j = 1 2 A j ( x ¯ ) .
Under some mild conditions, j J T ( Q j , x ¯ ) is a subset of j J A j ( x ¯ ) .
Proposition 1.
Suppose that x ¯ S ; f j is locally Lipschitz at x ¯ and directionally differentiable at x ¯ in any direction for all j J . Then,
j J T ( Q j , x ¯ ) j J A j ( x ¯ ) .
Proof. 
To verify Equation (2), it suffices to show that
T ( Q j , x ¯ ) A j ( x ¯ ) , j = 1 , , p .
Without loss of generality, we only need to show that
T ( Q 1 , x ¯ ) A 1 ( x ¯ ) .
We divide p into two cases: p = 1 and p > 1 .
Case 1: p = 1 . In this case, Q 1 = S , and hence
T ( Q 1 , x ¯ ) = T ( S , x ¯ ) = A 1 ( x ¯ ) ,
Equation (3) is verified.
Case 2: p > 1 . Let d T ( Q 1 , x ¯ ) ; then, there exist { t n } R + with t n 0 , { d n } R n with d n d such that x ¯ + t n d n Q 1 . By the definition of Q 1 , we obtain x ¯ + t n d n S and
f j ( x ¯ + t n d n ) f j ( x ¯ ) , j = 2 , , p ,
and hence d T ( S , x ¯ ) . Since f j is locally Lipschitz at x ¯ and directionally differentiable at x ¯ in any direction, we obtain
f j ( x ¯ ; d ) : = lim sup t 0 + f j ( x ¯ + t d ) f j ( x ¯ ) t = f j ( x ¯ ; d ) = lim t 0 + f j ( x ¯ + t d ) f j ( x ¯ ) t = lim n f j ( x ¯ + t n d ) f j ( x ¯ ) t n = lim n f j ( x ¯ + t n d n ) f j ( x ¯ ) t n 0 , j = 2 , , p .
This implies that d A 1 ( x ¯ ) , and so Equation (3) is verified. □
Before we give necessary conditions for the Borwein proper efficient solution of problem MMPVC, we introduce the following two definitions.
Definition 4.
Let Λ : = { 1 , , p } , for each λ Λ , D Λ be a nonempty convex set of R n , 0 < ε < 1 p , and D : = co λ Λ D λ . The set
core ε ( D ) : = λ Λ θ λ x λ | x λ D λ , λ Λ θ λ = 1 , λ Λ , θ λ ε
is called the ε-core of D.
Definition 5.
Let 0 < ε < 1 p . We say that problem MMPVC satisfies ε proper Abadie data qualification (in short, ε-PADQ) at x ¯ S , if
core ε co j J f j ( x ¯ ) L j J A j ( x ¯ ) ,
where
L : = i I 0 + h i ( x ¯ ) i I 0 h i ( x ¯ ) i I + 0 g i ( x ¯ ) .
Remark 2.
Assume that 0 < ε 1 < ε 2 . Since
core ε 2 co j J f j ( x ¯ ) core ε 1 co j J f j ( x ¯ ) ,
we deduce that if problem MMPVC satisfies ε 2 -PADQ, then it satisfies ε 1 -PADQ. If we take ε = 0 , replace A j ( x ¯ ) and “♯” with T ( Q j , x ¯ ) and “−”, respectively, in Definition 5, then ε-PADQ reduces to EADQ introduced in [18] (Definition 2). The meaning of L was introduced in [13].
Here, ε -PADQ reveals the relationship between the subdifferentials of the objective functions and the constrained functions and the feasible set of problem MMPVC. It is somewhat abstract, which leads to the difficulty of verifying it for a general problem MMPVC. However, under some mild conditions, ε -PADQ is easy to verify.
Proposition 2.
Let x ¯ S , ε 0 , 1 p with p > 1 . Suppose that f j ( j J ) , h i , and g i ( i I ) are locally Lipschitz at x ¯ . If one of the following conditions holds:
(i)
0 n int ( core ε ( co ( j J f j ( x ¯ ) ) ) L ) ;
(ii)
0 n int ( L ) ;
(iii)
0 n core ε ( co ( j J f j ( x ¯ ) ) ) ;
(iv)
f j ( j J ) is G a ^ teaux differentiable at x ¯ and
0 n j J θ j f j ( x ¯ ) | j J θ j = 1 , j J , θ j ε ,
then problem MMPVC satisfies ε-PADQ at x ¯ .
Proof. 
Let
H : = core ε co j J f j ( x ¯ ) .
To verify problem MMPVC satisfying ε -PADQ at x ¯ , it suffices to show that
H L j J A j ( x ¯ ) .
Assume that (i) holds. Then, we have 0 n int ( H L ) . By the definition of negative polar cone, we have ( H L ) = { 0 n } . By the definition of A j ( x ¯ ) , we obtain 0 n j J A j ( x ¯ ) . To verify (4), it suffices to prove that
H L H L .
Obviously, (5) holds true if H L = . Now, let v H L . Then, we have
v , x < 0 , x H ,
v , x 0 , x L .
and so,
v , x 0 , x H L .
Therefore, v ( H L ) , which verifies Equation (5).
Assume that (ii) holds. Then, (i) also holds since 0 n int ( L ) int ( H L ) . Therefore, problem MMPVC satisfies ε -PADQ at x ¯ .
Assume that (iii) holds. Then, 0 n H . By the definition of strict negative polar cone, we have H = , and so Equation (4) is verified. Therefore, we deduce that problem MMPVC satisfies ε -PADQ at x ¯ .
Finally, assume that (iv) holds. Since f j ( j J ) is G a ^ teaux differentiable at x ¯ , we have
H = j J θ j f j ( x ¯ ) | j J θ j = 1 , j J , θ j ε .
Here, (iv) implies that 0 n H . By (iii), problem MMPVC satisfies ε -PADQ at x ¯ . □
Now, we give stationary conditions for the Borwein proper efficient solution of problem MMPVC.
Theorem 1.
Let ε 0 , 1 p with p > 1 . Suppose that x ¯ Ξ B , f j ( j J ) , h i , and g i ( i I ) are locally Lipschitz at x ¯ , cone ( co ( L ) ) is a closed set, and problem MMPVC satisfies ε-PADQ at x ¯ and
( Υ ) : for all v n core 1 n co j J f j ( x ¯ ) with v n = 1 , v n v v j J f j ( x ¯ ) .
Then, there exist ζ j f , ζ i h , ζ i g ( j J , i I ) such that
0 n j J ζ j f f j ( x ¯ ) + i I ( ζ i g g i ( x ¯ ) ζ i h h i ( x ¯ ) ) ,
ζ i h = 0 ( i I + 0 I + ) , ζ i h 0 ( i I 0 I 00 ) , ζ i h R ( i I 0 + ) ,
ζ i g = 0 ( i I 0 I + ) , ζ i g 0 ( i I + 0 ) ,
and
( ζ 1 f , , ζ p f ) > 0 p , j = 1 p ζ j f = 1 .
Proof. 
Since f j , h i , and g i are locally Lipschitz at x ¯ , with Lemma 1, f j ( x ¯ ) , c h i ( x ¯ ) , and c g i ( x ¯ ) are nonempty compact convex sets. Hence, core ε ( co ( j J f j ( x ¯ ) ) ) is a compact convex set.
Firstly, we will prove that there exists η ( 0 , ε ) such that
core η co j J f j ( x ¯ ) cone ( co ( L ) ) .
Suppose to the contrary that for all positive integer numbers n with 1 n < ε ,
core 1 n co j J f j ( x ¯ ) ( cone ( co ( L ) ) ) = .
Since cone ( co ( L ) ) is a closed convex set, applying Lemma 2 to the above equation, there exists v n R n with v n = 1 such that
x , v n < 0 , x core 1 n co j J f j ( x ¯ ) ,
x , v n 0 , x cone ( co ( L ) ) .
Since problem MMPVC satisfies ε -PADQ at x ¯ , with (11), (12), and Remark 2, we obtain
v n core 1 n co j J f j ( x ¯ ) cone ( co ( L ) ) core 1 n co j J f j ( x ¯ ) L core ε co j J f j ( x ¯ ) L j J A j ( x ¯ ) ,
whenever 1 n < ε . Since { v n } is bounded, we may assume that v n v . Since A j ( x ¯ ) ( j J ) is a closed set, we obtain
v j J A j ( x ¯ ) .
The condition ( Υ ) and Equation (13) imply that
v j J f j ( x ¯ ) .
From Equations (14) and (15), we obtain
v j J A j ( x ¯ ) j J f j ( x ¯ ) ,
which contradicts Lemma 3. Therefore, (10) is justified and
0 n core η co j J f j ( x ¯ ) + cone ( co ( L ) ) .
This implies that there exist nonnegative real numbers ζ j f η ( j J ) , α i ( i I 0 + ) , β i ( i I 0 + ) , γ i ( i I 00 I 0 ) , δ i ( i I + 0 ) with j = 1 p ζ j f = 1 such that
0 n j J ζ j f f j ( x ¯ ) + i I 0 + α i c h i ( x ¯ ) + i I 0 + β i c h i ( x ¯ ) + i I 00 I 0 γ i c h i ( x ¯ ) + i I + 0 δ i c g i ( x ¯ ) .
Using the same approach of Theorem 4.1 in [13], we let
ζ i h : = ( α i β i ) , i I 0 + , γ i , i I 00 I 0 , 0 , i I + I + 0 , ζ i g : = δ i , i I + 0 , 0 , i I + I 0 ,
and the conclusion is proved. □
Remark 3.
In Theorem 4 of [18], Sadeghieh et al. established the following result. Suppose that x ¯ Ξ E , and
j J f j ( x ¯ ) L j J T ( Q j , x ¯ ) .
If f j ( x ¯ ) , h i ( x ¯ ) , and g i ( x ¯ ) are polyhedron, then Equations (6)–(9) hold. In [18], Equations (6)–(9) are called “strong strongly stationary conditions" and by “strong S S C " in short. In this paper, we call the conditions (6)–(9) “strictly strong stationary conditions" only from grammar angles.
Remark 4.
In Theorem 1, if there exists a j 0 J such that
f j 0 ( x ¯ ) { u R n | u = ( η 1 , η 2 , , η n ) , η i 0 , i = 1 , 2 , , n } ,
then the condition ( Υ ) holds true. In fact, for all v n core 1 n co j J f j ( x ¯ ) with v n = 1 and v n v , we have v = 1 . Let u f j 0 ( x ¯ ) be arbitrarily given. Take w j f j 0 ( x ¯ ) ( j j 0 , j J ) . Then, we have
1 p 1 n u + j j 0 , j J 1 n w j core 1 n co j J f j ( x ¯ )
and
v n , 1 p 1 n u + j j 0 , j J 1 n w j < 0 .
Letting n in (17), we have v , u 0 . Combining v = 1 and ( ) , we obtain v , u < 0 . This inequality implies that v ( f j 0 ( x ¯ ) ) , and so the condition ( Υ ) holds.
In problem MMPVC, condition ( Υ ) does not always hold true. See the following Example 2.
Example 2.
Let f 1 , f 2 , h 1 , g 1 : R 2 R . Consider the following problem MMPVC1:
min ( x 1 , x 1 + x 2 2 ) s . t . x 1 0 , x 1 x 2 0 ,
where
f 1 ( x 1 , x 2 ) = x 1 , f 2 ( x 1 , x 2 ) = x 1 + x 2 2 , ( x 1 , x 2 ) R 2 , h 1 ( x 1 , x 2 ) = x 1 , g 1 ( x 1 , x 2 ) = x 2 , ( x 1 , x 2 ) R 2 .
We can verify that x ¯ = ( 0 , 0 ) is a Borwein proper efficient solution of problem MMPVC1. Now, we prove that condition ( Υ ) does not hold true. We calculate that
f 1 ( x ¯ ) = { ( 1 , 0 ) } , f 2 ( x ¯ ) = { ( 1 , 0 ) } ,
core 1 n co j = 1 2 f j ( x ¯ ) = { ( λ 1 + λ 2 , 0 ) | λ 1 + λ 2 = 1 , λ 1 , λ 2 1 n } .
Let v n : = 1 n , 1 1 n 2 . Then, v n core 1 n co j = 1 2 f j ( x ¯ ) , v n = 1 , and v n v : = ( 0 , 1 ) . However, v ( f 1 ( x ¯ ) ) ( f 2 ( x ¯ ) ) .
In the following, we give an example to illustrate Theorem 1.
Example 3.
Let f 1 , f 2 , h 1 , g 1 : R 2 R . Consider the following problem MMPVC2:
min | x 1 | + x 2 , x 2 + x 1 2 + x 2 2 s . t . x 2 0 , x 2 ( 2 | x 1 | + x 2 ) 0 ,
where
f 1 ( x 1 , x 2 ) = | x 1 | + x 2 , f 2 ( x 1 , x 2 ) = x 2 + x 1 2 + x 2 2 , ( x 1 , x 2 ) R 2 , h 1 ( x 1 , x 2 ) = x 2 , g 1 ( x 1 , x 2 ) = 2 | x 1 | + x 2 , ( x 1 , x 2 ) R 2 .
We can verify that x ¯ = ( 0 , 0 ) is a Borwein proper efficient solution of problem MMPVC2. We calculate that
f 1 ( x ¯ ) = { ( x 1 , 1 ) | 1 x 1 1 } ,
f 2 ( x ¯ ) = ( x 1 , 1 + x 2 ) | x 1 2 + x 2 2 1 = { ( 0 , 1 ) } + B R 2 ,
h 1 ( x ¯ ) = { ( 0 , 1 ) } , g 1 ( x ¯ ) = { ( x 1 , 1 ) | 2 x 1 2 } ,
S = { ( x 1 , x 2 ) 0 x 2 2 | x 1 | } ,
A 1 ( x ¯ ) = T ( S , x ¯ ) { ( d 1 , d 2 ) | d = ( d 1 , d 2 ) R 2 , f 2 ( x ¯ ; d ) 0 } = S { ( 0 , 0 ) } = { ( 0 , 0 ) } ,
A 2 ( x ¯ ) = T ( S , x ¯ ) { ( d 1 , d 2 ) | d = ( d 1 , d 2 ) R 2 , f 1 ( x ¯ ; d ) 0 } = S { ( d 1 , d 2 ) | d 1 + d 2 0 } = { ( 0 , 0 ) } ,
j = 1 2 A j ( x ¯ ) = { ( 0 , 0 ) } ,
I = { 1 } , I + 0 : = i I | g i ( x ¯ ) = 0 , h i ( x ¯ ) > 0 = , I + : = i I | g i ( x ¯ ) < 0 , h i ( x ¯ ) > 0 = , I 0 + : = i I | g i ( x ¯ ) > 0 , h i ( x ¯ ) = 0 = , I 00 : = i I | g i ( x ¯ ) = 0 , h i ( x ¯ ) = 0 = { 1 } , I 0 : = i I | g i ( x ¯ ) < 0 , h i ( x ¯ ) = 0 = , I + = I + 0 I + = , I 0 : = I 0 + I 00 I 0 = { 1 } .
L = i I 0 + h i ( x ¯ ) i I 0 h i ( x ¯ ) i I + 0 g i ( x ¯ ) = h 1 ( x ¯ ) = { ( 0 , 1 ) } ,
L = { ( d 1 , d 2 ) | d 1 R , d 2 0 } .
Clearly, cone ( co ( L ) ) is a closed set. For ε = 1 10 , we calculate that
core 1 10 co j = 1 2 f j ( x ¯ ) L = ( d 1 , d 2 ) | λ | d 1 | + d 2 + ( 1 λ ) d 1 2 + d 2 2 < 0 , 1 10 λ 1 , 1 10 1 λ 1 L = j = 1 2 A j ( x ¯ ) .
Hence, problem MMPVC2 satisfies 1 10 -PADQ condition at x ¯ .
In the following, we will verify that condition (Υ) holds. Assume that
( d 1 n , d 2 n ) core 1 n co j = 1 2 f j ( x ¯ ) with ( d 1 n , d 2 n ) = 1 , ( d 1 n , d 2 n ) ( d 1 , d 2 ) .
Then, we have
λ d 1 n + d 2 n + ( 1 λ ) < 0 , λ , 1 λ 1 n , 1 .
By sending n in (18), we have
λ d 1 + d 2 + ( 1 λ ) 0 , λ , 1 λ 0 , 1 .
Taking λ = 0 in (19), we obtain d 2 1 . Combining ( d 1 , d 2 ) = 1 , we obtain d 2 = 1 , and so
( d 1 , d 2 ) = ( 0 , 1 ) ( f 1 ( x ¯ ) ) j = 1 2 ( f j ( x ¯ ) ) .
Hence, the condition (Υ) is verified. All conditions of Theorem 1 are satisfied. By Theorem 1, Equations (6)–(9) hold. In fact, take ζ 1 f = 1 2 , ζ 2 f = 1 2 , ζ 1 h = 1 2 , ζ 1 g = 0 , then
0 2 1 2 f 1 ( x ¯ ) + 1 2 f 2 ( x ¯ ) + 0 g 1 ( x ¯ ) 1 2 h 1 ( x ¯ ) .
However, since f 2 ( x ¯ ) is not a polyhedron, Theorem 4 of [18] cannot be applied to MMPVC2.
For x ¯ S , we suppose that problem MMPVC satisfies the strictly strong stationary condition at x ¯ , that is, satisfies (6)–(9). Motivated by [18,22], we define the index sets as follows:
I 00 + : = i I 00 | ζ i h > 0 , I 00 0 : = i I 00 | ζ i h = 0 ,
I 0 + : = i I 0 | ζ i h > 0 , I 0 0 : = i I 0 | ζ i h = 0 ,
I 0 + + : = i I 0 + | ζ i h > 0 , I 0 + : = i I 0 + | ζ i h < 0 ,
I 0 + 0 : = i I 0 + | ζ i h = 0 , I + 0 0 + : = i I + 0 | ζ i h = 0 , ζ i g > 0 ,
I + 0 00 : = i I + 0 | ζ i h = 0 , ζ i g = 0 .
Clearly,
I 00 = I 00 + I 00 0 , I 0 = I 0 + I 0 0 ,
I + 0 = I + 0 0 + I + 0 00 , I 0 + = I 0 + + I 0 + I 0 + 0 .
Now, we give sufficient optimality conditions for the Borwein proper efficient solution of problem MMPVC in terms of the strictly strong stationary condition.
Theorem 2.
Suppose that problem MMPVC satisfies (6)–(9) at x ¯ S , f j ( j J ) , h i , and g i ( i I ) are locally Lipschitz at x ¯ , f j ( j J ) is a convex function, and g i ( i I + 0 0 + ) , h i ( i I 0 + ) , and h i ( i I 0 + + I 00 + I 0 + ) are ∂-quasi-convex at x ¯ .
(i)
Then, x ¯ is a local Borwein proper efficient solution of problem MMPVC,
(ii)
If I 0 + = I + 0 0 + = , then x ¯ is a Borwein proper efficient solution of problem MMPVC.
Proof. 
(i) Since I 0 + I 0 + , we have
g i ( x ¯ ) > 0 , h i ( x ¯ ) = 0 , i I 0 + .
Since I + 0 0 + I + 0 , we have
g i ( x ¯ ) = 0 , h i ( x ¯ ) > 0 , i I + 0 0 + .
Since g i ( i I 0 + ) and h i ( i I + 0 0 + ) are continuous functions with (22) and (23), there exists a neighborhood U of x ¯ such that
g i ( x ) > 0 , h i ( x ) = 0 , x S U , i I 0 + ,
h i ( x ) > 0 , g i ( x ) 0 , x S U , i I + 0 0 + .
Since problem MMPVC satisfies (6)–(9), there exist ξ j f f j ( x ¯ ) ( j J ) , ξ i h h i ( x ¯ ) ( i I 0 ) , ξ i g g i ( x ¯ ) ( i I + 0 ) such that
j J ζ j f ξ j f i I 0 ζ i h ξ i h + i I + 0 ζ i g ξ i g = 0 R n .
Suppose to the contrary that x ¯ is not a local Borwein proper efficient solution. Then, there exist v = ( v 1 , , v p ) 0 p and a neighborhood V of x ¯ such that
v cl cone f ( S V ) f ( x ¯ ) ( R + p ) .
Thus, there exist x n S U V with x n x ¯ and θ n > 0 such that
lim n θ n ( f j ( x n ) f j ( x ¯ ) ) = v j 0 , j = 1 , 2 , , p ,
and at least one v j < 0 ; without loss of generality we may assume that v 1 < 0 . Since f j is a continuous convex function, we have
ξ j f , x n x ¯ f j ( x n ) f j ( x ¯ ) ,
resulting in
lim sup n ξ 1 f , θ n ( x n x ¯ ) lim n θ n ( f 1 ( x n ) f 1 ( x ¯ ) ) = v 1 < 0 , lim sup n ξ j f , θ n ( x n x ¯ ) lim n θ n ( f j ( x n ) f j ( x ¯ ) ) = v j 0 , j = 2 , , p ,
and so
lim sup n j J ζ j f ξ j f , θ n ( x n x ¯ ) j J ζ j f v j < 0 .
By (26), we have
i I 0 ζ i h ξ i h + i I + 0 ζ i g ξ i g = j J ζ j f ξ j f ,
implying
lim inf n i I 0 ζ i h ξ i h , θ n ( x n x ¯ ) + i I + 0 ζ i g ξ i g , θ n ( x n x ¯ ) = lim inf n j J ζ j f ξ j f , θ n ( x n x ¯ ) = lim sup n j J ζ j f ξ j f , θ n ( x n x ¯ ) j J ζ j f v j > 0 .
Since g i ( i I + 0 0 + ) and h i ( i I 0 + ) are -quasiconvex at x ¯ , it follows from (22)–(25) that
g i ( x n ) 0 = g i ( x ¯ ) ξ i g , x n x ¯ 0 , i I + 0 0 + ,
h i ( x n ) = 0 h i ( x ¯ ) ξ i h , x n x ¯ 0 , i I 0 + .
On the other hand, by the definition of index sets, combining x n S , we have
h i ( x n ) 0 = h i ( x ¯ ) , i I 0 + + I 00 + I 0 + .
Since ξ i h ( h i ) ( x ¯ ) ( i I 0 + + I 00 + I 0 + ) , the -quasi convexity of h i and (28) imply that
ξ i h , x n x ¯ 0 , i I 0 + + I 00 + I 0 + .
The above inequality, Equations (20) and (21) imply that
lim sup n i I 0 + ζ i h ξ i h , θ n ( x n x ¯ ) lim sup n i I 0 + + ζ i h > 0 ξ i h , θ n ( x n x ¯ ) 0 + lim sup n i I 0 + ζ i h < 0 ξ i h , θ n ( x n x ¯ ) 0 + lim sup n i I 0 + 0 ζ i h = 0 ξ i h , θ n ( x n x ¯ ) 0 ,
lim sup n i I 00 ζ i h ξ i h , θ n ( x n x ¯ ) lim sup n i I 00 + ζ i h > 0 ξ i h , θ n ( x n x ¯ ) 0 + lim sup n i I 00 0 ζ i H = 0 ξ i H , θ n ( x n x ¯ ) 0 ,
lim sup n i I 0 ζ i h ξ i h , θ n ( x n x ¯ ) lim sup n i I 0 + ζ i h > 0 ξ i h , θ n ( x n x ¯ ) 0 + lim sup n i I 0 0 ζ i h = 0 ξ i h , θ n ( x n x ¯ ) 0 ,
lim sup n i I + 0 ζ i g ξ i g , θ n ( x n x ¯ ) lim sup n i I + 0 0 + ζ i g > 0 ξ i g , θ n ( x n x ¯ ) 0 + lim sup n i I + 0 00 ζ i g = 0 ξ i g , θ n ( x n x ¯ ) 0 .
Adding (29)–(32) and noting I 0 = I 0 + I 00 I 0 , we have
lim sup n i I 0 ζ i h ξ i h , θ n ( x n x ¯ ) + i I + 0 ζ i g ξ i g , θ n ( x n x ¯ ) lim sup n i I 0 + ζ i h ξ i h , θ n ( x n x ¯ ) + lim sup n i I 00 ζ i h ξ i h , θ n ( x n x ¯ ) + lim sup n i I 0 ζ i h ξ i h , θ n ( x n x ¯ ) + lim sup n i I + 0 ζ i g ξ i g , θ n ( x n x ¯ ) 0 ,
which contradicts (27). Therefore, x ¯ is a local Borwein proper efficient solution of problem MMPVC.
(ii). Now, assume that I 0 + = I + 0 0 + = . We begin our proof from “since problem MMPVC satisfies (6)–(9)” in the proof (i) and remove the neighborhoods U and V and x n x ¯ from it. We immediately obtain that x ¯ is a global Borwein proper efficient solution of problem MMPVC. □
Remark 5.
In Theorem 10 of [18], Sadeghieh et al. established the following result. Suppose that f j ( j J ) is ∂-pseudoconvex at x ¯ , and other conditions are the same as Theorem 2. Then, Theorem 2 holds for Pareto efficient solutions.
In the following, we give an example to illustrate Theorem 2.
Example 4.
Let f j ( j = 1 , 2 ) , h i , g i ( i = 1 , 2 ) : R 2 R . Consider the following problem MMPVC3:
min ( | x 1 | x 2 , x 1 2 x 2 ) s . t . x 2 0 , x 1 + | x 2 | 0 , x 2 ( x 1 + | x 2 | ) 0 .
where
f 1 ( x 1 , x 2 ) = | x 1 | x 2 , f 2 ( x 1 , x 2 ) = x 1 2 x 2 , h 1 ( x 1 , x 2 ) = x 2 , h 2 ( x 1 , x 2 ) = x 1 + | x 2 | , g 1 ( x 1 , x 2 ) = 1 , g 2 ( x 1 , x 2 ) = x 2 .
Let x ¯ : = ( 0 , 0 ) . We can calculate that
I + 0 = , I + = , I 0 = { 1 } , I 00 = { 2 } , I 0 + = , I + = , I 0 = { 1 , 2 } , f 1 ( x ¯ ) = { ( d 1 , 1 ) | | d 1 | 1 } , f 2 ( x ¯ ) = { ( 0 , 1 ) } , h 1 ( x ¯ ) = { ( 0 , 1 ) } , h 2 ( x ¯ ) = { ( 1 , d 2 ) | | d 2 | 1 } .
Let ζ 1 f = ζ 2 f = 1 2 , ζ 1 h = 1 , ζ 2 h = 0 , ζ 1 g = ζ 2 g = 0 . Then, we can calculate that
I 0 + = , I + 0 0 + = , I 0 + + = , I 00 + = , I 0 + = { 1 } ,
and
0 2 1 2 f 1 ( x ¯ ) + 1 2 f 2 ( x ¯ ) h 1 ( x ¯ ) 0 h 2 ( x ¯ ) + 0 g 1 ( x ¯ ) + 0 g 2 ( x ¯ ) ,
and ζ 1 f + ζ 2 f = 1 , which imply that (6)–(9) hold. Obviously, h 1 is ∂-quasi-convex at x ¯ . Since I 0 + = I + 0 0 + = , by Theorem 2, x ¯ a global Borwein proper efficient solution of problem MMPVC3.

4. Conclusions

In this paper, motivated by [18], we establish optimality conditions for Borwein proper efficient solutions of nonsmooth multiobjective problems with vanishing constraints by using the property of locally Lipschitz functions and the Clarke subdifferential. These results are extensions of the corresponding results of [18,19]. Since each Borwein proper efficient solution is a Pareto efficient solution, our results will bring potential applications in enhancing the accuracy of machine design. In the future, we will consider optimality conditions for other proper efficient solutions of nonsmooth vector optimization problems with vanishing constraints.

Author Contributions

Conceptualization, H.H.; formal analysis, H.Z.; investigation, H.Z.; methodology, H.H.; supervision, H.H.; writing—original draft, H.Z.; writing—review and editing, H.H. and H.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the National Natural Science Foundation of China (Grant No. 12061085) and the Applied Basic Research Project of Yunnan Province (Grant No. 202001BB050036, 202201AT070066).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

The following abbreviations are used in this manuscript:
MMPVCMultiobjective mathematical programming with vanishing constraints
MPVCMathematical programming with vanishing constraints
PADQProper Abadie data qualification
EADQExtended Abadie data qualification

References

  1. Ansari, Q.H.; Ko¨bis, E.; Yao, J.C. Vector Variational Inequalities and Vector Optimization; Springer: Berlin, Germany, 2018; pp. 1–483. [Google Scholar] [CrossRef]
  2. Pareto, V. Manuale di Economia Politica; Societa Editrice Libraria: Milano, Italy, 1906; pp. 66–83. [Google Scholar]
  3. Koopmans, T.C. (Ed.) activities. In Activity Analysis of Production and Allocation; Wiley: New York, NY, USA, 1951; pp. 33–97. [Google Scholar]
  4. Johannes, J. Vector Optimization; Springer: Berlin/Heidelberg, Germany, 2011; pp. 103–114. [Google Scholar] [CrossRef]
  5. Borwein, J.M. Proper efficient points for maximizations with respect to cones. SIAM J. Control Optim. 1977, 15, 57–63. [Google Scholar] [CrossRef]
  6. Jahn, J. Mathematical Vector Optimization in Partially Ordered Linear Spaces; Peter Lang: Frankfurt am Main, Germany, 1986; pp. 6–58. [Google Scholar]
  7. Zhuang, D. Density results for proper efficiencies. SIAM J. Control Optim. 1994, 32, 51–58. [Google Scholar] [CrossRef]
  8. Zhuang, D.M. Bases of convex cones and Borwein’s proper efficiency. J. Optim. Theory Appl. 1991, 71, 613–620. [Google Scholar] [CrossRef]
  9. Achtziger, W.; Kanzow, C. Mathematical programs with vanishing constraints: Optimality conditions and constraint qualifications. Math. Program. 2008, 114, 69–99. [Google Scholar] [CrossRef]
  10. Guu, S.M.; Singh, Y.; Mishra, S.K. On strong KKT type sufficient optimality conditions for multiobjective semi-infinite programming problems with vanishing constraints. J. Inequal. Appl. 2017, 282, 9–20. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  11. Hoheisel, T.; Kanzow, C. Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications. J. Math. Anal. Appl. 2008, 337, 292–310. [Google Scholar] [CrossRef] [Green Version]
  12. Hoheisel, T.; Preprint, C.K. On the Abadie and Guignard constraint qualifications for mathematical programs with vanishing constraints. Optimization 2009, 58, 431–448. [Google Scholar] [CrossRef]
  13. Kazemi, S.; Kanzi, N. Constraint qualifications and stationary conditions for mathematical programming with nondifferentiable vanishing constraints. J. Optim. Theory Appl. 2018, 179, 800–819. [Google Scholar] [CrossRef]
  14. Kazemi, S.; Kanzi, N.; Ebadian, A. Estimating the Fre´chet normal cone in optimization problems with nonsmooth vanishing constraints. Iran. J. Sci. Technol. Trans. Sci. 2019, 43, 2299–2306. [Google Scholar] [CrossRef]
  15. Mokhtavayi, H.; Heydari, A.; Kanzi, N. First-order optimality conditions for Lipschitz optimization problems with vanishing constraints. Iran. J. Sci. Technol. Trans. Sci. 2020, 44, 1853–1861. [Google Scholar] [CrossRef]
  16. Mishra, S.K.; Singh, V.; Laha, V.; Mohapatra, R.N. On constraint qualifications for multiobjective optimization problems with vanishing constraints. In Optimization Methods, Theory and Applications; Xu, H., Wang, S., Wu, S.Y., Eds.; Springer: Berlin/Heidelberg, Germany, 2015; pp. 95–135. [Google Scholar] [CrossRef]
  17. Shaker Ardakani, J.; Farahmand Rad, S.H.; Kanzi, N.; Reihani Ardabili, P. Necessary stationary conditions for multiobjective optimization problems with nondifferentiable convex vanishing constraints. Iran. J. Sci. Technol. Trans. Sci. 2019, 43, 2913–2919. [Google Scholar] [CrossRef]
  18. Sadeghieh, A.; Kanzi, N.; Caristi, G.; Barilla, D. On stationarity for nonsmooth multiobjective problems with vanishing constraints. J. Glob. Optim. 2022, 82, 929–949. [Google Scholar] [CrossRef]
  19. Li, X.F. Constraint qualifications in nonsmooth multiobjective optimization. J. Optim. Theory Appl. 2000, 106, 373–398. [Google Scholar] [CrossRef]
  20. Clarke, F.H. Optimization and Nonsmooth Analysis; Wiley-Interscience: New York, NY, USA, 1983; pp. 25–27. [Google Scholar] [CrossRef] [Green Version]
  21. Kanzi, N.; Soleymani-damaneh, M. Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems. J. Math. Anal. Appl. 2016, 434, 638–651. [Google Scholar] [CrossRef]
  22. Hoheisel, T.; Kanzow, C. First- and second-order optimality conditions for mathematical programs with vanishing. Appl. Math. 2007, 52, 495–514. [Google Scholar] [CrossRef]
Table 1. The notations and their explanations throughout the text.
Table 1. The notations and their explanations throughout the text.
NotationDescription and Explanation of the Notation
R n n-dimensional Euclidean space
R p p-dimensional Euclidean space
I I : = { 1 , 2 , , m }
J J : = { 1 , 2 , , p }
0 n zero vector of R n
0 p zero vector of R p
ψ ( x ¯ ; u ) the upper directional derivative ψ at x ¯ in the direction u
ψ ( x ¯ ; u ) the directional derivative ψ at x ¯ in the direction u
ψ ( x ¯ ) the G a ^ teaux derivative of ψ at x ¯
ψ ( x ¯ ; u ) the Clarke generalized directional derivative of ψ at x ¯ in the direction u
ψ ( x ¯ ) the Clarke subdifferential of ψ at x ¯
Ω the negative polar cone of Ω
Ω the strict negative polar cone of Ω
f j ( x ¯ ; u ) the Clarke generalized directional derivative of f j at x ¯ in the direction u
f j ( x ¯ ) the strict negative polar cone of the Clarke subdifferential f j ( x ¯ )
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Huang, H.; Zhu, H. Stationary Condition for Borwein Proper Efficient Solutions of Nonsmooth Multiobjective Problems with Vanishing Constraints. Mathematics 2022, 10, 4569. https://doi.org/10.3390/math10234569

AMA Style

Huang H, Zhu H. Stationary Condition for Borwein Proper Efficient Solutions of Nonsmooth Multiobjective Problems with Vanishing Constraints. Mathematics. 2022; 10(23):4569. https://doi.org/10.3390/math10234569

Chicago/Turabian Style

Huang, Hui, and Haole Zhu. 2022. "Stationary Condition for Borwein Proper Efficient Solutions of Nonsmooth Multiobjective Problems with Vanishing Constraints" Mathematics 10, no. 23: 4569. https://doi.org/10.3390/math10234569

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