Next Article in Journal
On the Nonlinear Forced Vibration of the Magnetostrictive Laminated Beam in a Complex Environment
Next Article in Special Issue
Applying Theorems on b-Metric Spaces to Differential and Integral Equations Through Connected-Image Contractions
Previous Article in Journal
Dynamic Decisions of Quality and Goodwill in a Two-Echelon Supply Chain with Delay Effect
Previous Article in Special Issue
Novel Accelerated Cyclic Iterative Approximation for Hierarchical Variational Inequalities Constrained by Multiple-Set Split Common Fixed-Point Problems
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The Continuity and Convexity of a Nonlinear Scalarization Function with Applications in Set Optimization Problems Involving a Partial Order Relation

by
Zi-Ru Zhang
and
Yang-Dong Xu
*
College of Science, Chongqing University of Posts and Telecommunications, Chongqing 400065, China
*
Author to whom correspondence should be addressed.
Mathematics 2024, 12(23), 3839; https://doi.org/10.3390/math12233839
Submission received: 14 November 2024 / Revised: 2 December 2024 / Accepted: 3 December 2024 / Published: 4 December 2024
(This article belongs to the Special Issue Fixed Point, Optimization, and Applications II)

Abstract

:
In this paper, we deal with the properties and applications of a nonlinear scalarization function for sets by using the Minkowski difference. Under some suitable assumptions, the continuity and convexity concerned with the nonlinear scalarization function for sets are presented. As applications, the path connectedness of the solution sets to set optimization problems and the continuity of the solution mappings of parametric set optimization problems are established. The results achieved do not impose the monotonicity of the set-valued objective mapping, which are obviously different from the related ones in the literature.

1. Introduction

In recent years, the extension of the vector-valued optimization problem to the set-valued optimization problem has received increasing attention due to its wide applications in many fields such as optimal control, differential inclusions, game theory, robust optimization, fuzzy optimization, welfare economics, and mathematical finance; see, for instance [1,2,3,4,5] and the references therein. In the literature, there are mainly two types of criteria of solutions for set-valued optimization problems. The classical one is the vector criterion: a solution of a set-valued map is defined via the minimal element of the image set of the map with respect to the usual ordering relation of vector optimization. Although it is of mathematical interest, it does not seem natural whenever one needs to consider preferences over sets, since only one element does not necessarily imply that the whole image set is in a certain sense minimal with respect to all image sets. In order to overcome this drawback, the set criterion is proposed by Kuroiwa [6]. The set criterion is that a solution is defined via the minimal set of the collection of all image sets with respect to set order relations. Regarding this criterion, there are some other set order relations considered in set-valued optimization problems. We refer the reader to [7,8] and the references therein for more details. A set-valued optimization problem with a set criterion is called a set optimization problem.
It is well known that nonlinear scalarization functions are the most essential tools in vector or set optimization. There are mainly two types of scalarization functions in vector optimization. They are the Gerstewitz function [1,9,10] and the oriented distance function [11,12]. Accordingly, in set optimization, there are also two kinds of scalarization functions have been used: the extensions of the Gerstewitz function [8,13,14,15,16,17] and the extensions of the oriented distance function of Hiriart-Urruty [13,18,19,20]. In terms of scalarization techniques, several theoretical aspects of set optimization were discussed, such as the characterization of several types of optimal solutions, alternative theorems, optimality conditions, and the well-posedness; see, for instance, [13,14,16,17,20,21,22,23,24,25,26] and the references therein.
As we know, the continuity and convexity of the extensions of the Gerstewitz function play a significant role in the existence and the stability of set optimization problems. For more details, we refer the reader to [14,27]. Therefore, it is necessary and interesting to investigate the continuity and convexity for the extensions of the Gerstewitz function. In this paper, we give the continuity and convexity of the nonlinear scalarization function proposed by Karaman et al. in [8], which is defined by a partial set order relation involving the Minkowski difference. As applications, we study the path connectedness and stability of set optimization problems.
The rest of the paper is organized as follows. In Section 2, we introduce some definitions and previous results required throughout the paper. In Section 3, by using some properties of nonlinear scalarization functions defined in [8] and well-known results for set-valued mappings, we prove the continuity and convexity of a nonlinear scalarization function for sets. In Section 4, we explore an application of properties of the nonlinear scalarization function to the path connectedness of the solution set of a set optimization problem. In Section 5, we provide the other application of the nonlinear scalarization function to the continuity of solution mappings of a parametric set optimization problem. In Section 6, we give the concluding remarks of the paper.

2. Preliminaries

In this section, we recall some basic definitions and properties which are necessary for this study. Throughout this paper, X and Y are two normed vector spaces. Given a subset A of Y, the closure, the complement, the topological interior, the boundary, and the convex hull of A are denoted, respectively, by cl A, A c , int A, bd A , and conv A . We denote by B Y the closed unit ball in Y. The family of nonempty proper subsets of Y, the family of nonempty bounded subsets of Y, and the family of nonempty compact subsets of Y are denoted by P 0 ( Y ) , B * ( Y ) , and B * * ( Y ) , respectively. For every A , B P 0 ( Y ) and λ R , we denote, respectively,
A B = { y 1 y 2 : y 1 A , y 2 B } , λ A = { λ y : y A }
by the algebraic difference of the sets A and B and the scalar multiplication of the set A.
A nonempty subset C R m is said to be a cone if t C C for all t 0 . A cone C R m is said to be convex (pointed) if and only if C + C C ( C ( C ) = { 0 R m } ) . Throughout the paper, we assume that C is a closed, convex, and pointed cone with a nonempty interior. Let Y * be the topological dual space of Y and the dual cone of C be denoted by C * , which is defined by C * = { f Y * : f ( c ) 0 , c C } .
For A, B P 0 ( Y ) , the Minkowski difference of A and B, considered in [28], is given by
B ˙ A : = { z Z : z + A B } = a A ( B a ) .
It is worth mentioning that the Minkowski difference of a set and a vector coincide with the algebraic difference of them, that is, A ˙ b = A b for all A P 0 ( Y ) and b Y . Also, ( A ˙ B ) b = A ˙ B b = A ˙ ( B + b ) and ( A b ) ˙ B = ( A ˙ B ) b for all A , B P 0 ( Y ) and b Y .
We now recall some order relations on P 0 ( Y ) . The first one is the lower set order relation C l and the upper set order relation C u on P 0 ( Y ) , which are discussed by [6].
A C l B B A + C ; A C u B A B C .
What is noteworthy is that C l and C u are pre-order relations, i.e., reflexive and transitive relations, on P 0 ( Y ) . Recently, by using the Minkowski difference, Karaman et al. [8] introduced the following partial order relations on the family of nonempty bounded sets, which are reflexive, transitive, and antisymmetric on B * ( Y ) .
Definition 1 
([8]). Let A , B P 0 ( Y ) .
(i) 
A C m 1 B ( B ˙ A ) C Ø .
(ii) 
A C m 1 B ( B ˙ A ) int C Ø .
(iii) 
A C m 2 B ( A ˙ B ) C Ø .
(iv) 
A C m 2 B ( A ˙ B ) int C Ø .
In the rest of this paper, we only consider the order relation C m 2 since we can obtain the corresponding results for the order relation C m 1 .
Let K be a nonempty subset of X. Let F : K Y be a set-valued mapping. We consider the following set optimization problem with set order C m 2 (for short, m 2 -SOP):
( m 2 - SOP ) min C F ( x ) subject to x K .
When the set K and the mapping F are perturbed by a parameter λ which varies over a subset Λ in a normed space, we consider the following parametric set optimization problem with set order C m 2 (for short, m2-PSOP):
( m 2 - PSOP ) min C F ( x , λ ) subject to x K ( λ ) .
Definition 2 
([8]). An element x 0 K is said to be
(i) 
a m 2 -minimal solution of ( m 2 -SOP) if there does not exist any x K with F ( x ) F ( x 0 ) such that F ( x ) C m 2 F ( x 0 ) , that is, either F ( x ) C m 2 F ( x 0 ) or F ( x ) = F ( x 0 ) for any x K ;
(ii) 
a weak m 2 -minimal solution of ( m 2 -SOP) if there does not exist any x K such that F ( x ) C m 2 F ( x 0 ) .
Let argmin m 2 ( K , F ) and argmin w m 2 ( K , F ) denote the m 2 -minimal solution set of ( m 2 -SOP) and the weak m 2 -minimal solution set of ( m 2 -SOP), respectively. In addition, the solution concepts of the problem ( m 2 -PSOP) can be similarly defined. For each λ Λ , let S ( λ ) and S w ( λ ) denote the m 2 -minimal solution set of ( m 2 -PSOP) and the weak m 2 -minimal solution set of ( m 2 -PSOP), respectively. Throughout the paper, we always assume that argmin m 2 ( K , F ) Ø and S ( λ ) Ø .
To give the relationship between the sets argmin m 2 (K, F) and argmin w m 2 (K, F), we need to recall a vital conclusion presented by Karaman et al. in [8].
Lemma 1. 
If A B * ( Y ) , then A ˙ A = { 0 Y } .
Proposition 1. 
Assume that F ( x ) is bounded for each x K . Then
argmin m 2 ( K , F ) argmin w m 2 ( K , F ) .
Proof. 
Suppose, to the contrary, that there exists x 0 argmin m 2 ( K , F ) such that x 0 argmin w m 2 ( K , F ) . Then, there exists y 0 K such that
F ( y 0 ) ˙ F ( x 0 ) ( int C ) Ø .
This together with Lemma 1 gives us F ( x 0 ) F ( y 0 ) . Moreover, (1) also implies that F ( y 0 ) C m 2 F ( x 0 ) . Thus, it follows that x 0 argmin m 2 ( K , F ) , which leads to a contradiction. □
The following example is given to show that the statement argmin m 2 ( K , F ) argmin w m 2 ( K , F ) may be not true if the values of F are unbounded.
Example 1. 
Let K = [ 0 , 1 ] , Y = R 2 , C = R + 2 and e = ( 1 , 1 ) . Let F : K Y be defined by
F ( x ) = R e , i f   x { 0 , 1 } , { 0 R 2 } , i f   x ( 0 , 1 ) .
It is easy to verify that argmin m 2 ( K , F ) = { 0 , 1 } and argmin w m 2 ( K , F ) = Ø .
Definition 3. 
Let Ω be a nonempty convex subset of X. A set-valued mapping Φ : X Y is said to be
(i) 
m 2 -naturally C-quasiconvex on Ω if, for any x 1 , x 2 Ω and for any α [ 0 , 1 ] , there exists β [ 0 , 1 ] such that
Φ α x 1 + ( 1 α ) x 2 C m 2 β Φ ( x 1 ) + ( 1 β ) Φ ( x 2 ) .
(ii) 
strictly m 2 -naturally C-quasiconvex on Ω if, for any x 1 , x 2 Ω with x 1 x 2 and for any α ( 0 , 1 ) , there exists β [ 0 , 1 ] such that
Φ α x 1 + ( 1 α ) x 2 C m 2 β Φ ( x 1 ) + ( 1 β ) Φ ( x 2 ) .
(iii) 
m 2 -properly C-quasiconvex if, for any x 1 , x 2 Ω and for any α [ 0 , 1 ] , one has
either Φ α x 1 + ( 1 α ) x 2 C m 2 Φ ( x 1 ) or Φ α x 1 + ( 1 α ) x 2 C m 2 Φ ( x 2 )
(iv) 
strictly m 2 -properly C-quasiconvex if, for any x 1 , x 2 Ω with x 1 x 2 and for any α ( 0 , 1 ) , one has
either Φ α x 1 + ( 1 α ) x 2 C m 2 Φ ( x 1 ) or Φ α x 1 + ( 1 α ) x 2 C m 2 Φ ( x 2 )
Remark 1. 
(i) 
If Φ is a single-valued mapping, then the above definitions of m 2 -natural C-quasiconvexity (strictly m 2 -natural C-quasiconvexity) and m 2 -proper C-quasiconvexity (strictly m 2 -proper C-quasiconvexity) reduce to classic definitions of natural C-quasiconvexity in [29] and proper C-quasiconvexity in [30], respectively.
(ii) 
It is easy to see that m 2 -proper C-quasiconvexity (strictly m 2 -proper C-quasiconvexity) leads to m 2 -natural C-quasiconvexity (strictly m 2 -natural C-quasiconvexity), respectively. However, the converse may be not valid. The following example is given to show the case.
Example 2. 
Let X = R , Y = R 2 , and C = R + 2 . Let Ω = [ 1 , 1 ] and
Φ ( x ) = ( x , x ) + B Y .
It is not hard to check that Φ is m 2 -naturally C-quasiconvex on Ω. Indeed, for any x 1 , x 2 Ω and for any α [ 0 , 1 ] , there exists β = α such that
Φ α x 1 + ( 1 α ) x 2 C m 2 β Φ ( x 1 ) + ( 1 β ) Φ ( x 2 ) .
However, it is not m 2 -properly C-quasiconvex on Ω. Indeed, let x 1 = 1 , x 2 = 1 , and α = 1 2 . Let A = Φ α x 1 + ( 1 α ) x 2 = ( x , y ) R 2 : x 2 + y 2 1 , B = Φ ( x 1 ) = ( x , y ) R 2 : ( x + 1 ) 2 + ( y 1 ) 2 1 , and D = Φ ( x 2 ) = ( x , y ) R 2 : ( x 1 ) 2 + ( y + 1 ) 2 1 (see Figure 1). It follows from a direct computation that A ˙ B = { e } = ( 1 , 1 ) (see Figure 2) and A ˙ D = { f } = ( 1 , 1 ) (see Figure 2). Hence, ( A ˙ B ) C = Ø and ( A ˙ D ) C = Ø . Consequently, Φ is not m 2 -properly C-quasiconvex on Ω.
Definition 4 
([31]). A topological space T is said to be path-connected (or arcwise-connected) if, for any x , y T , there exists a continuous mapping γ : [ 0 , 1 ] T such that γ ( 0 ) = x and γ ( 1 ) = y .
Definition 5 
([32]). Let T 1 and T 2 be two topological vector spaces. A set-valued mapping G : T 1 T 2 is said to be
(i) 
lower semicontinuous (for short, l.s.c.) at t ¯ T 1 if, for every open set V T 2 with G ( t ¯ ) V Ø , there is a neighborhood N ( t ¯ ) of t ¯ such that for any t N ( t ¯ ) with G ( t ) V Ø ;
(ii) 
upper semicontinuous (for short, u.s.c.) at t ¯ T 1 if, for every open set V T 2 with G ( t ¯ ) V , there is a neighborhood N ( t ¯ ) of t ¯ such that for any t N ( t ¯ ) with G ( t ) V ;
(iii) 
Hausdorff upper semicontinuous (for short, H-u.s.c.) at t ¯ T 1 if, for each neighborhood U of the zero point 0 T 2 , there is a neighborhood N ( t ¯ ) of t ¯ such that for any t N ( t ¯ ) with G ( t ) G ( t ¯ ) + U .
We say that G is l.s.c. (u.s.c.) on T 1 if it is l.s.c. (u.s.c.) at each t T 1 . G is said to be continuous on T 1 if it is both l.s.c. and u.s.c. on T 1 .
Proposition 2 
([33,34]). Assume that T 1 and T 2 be two normed vector spaces. Let G : T 1 T 2 be a set-valued mapping. Then, the following statements are true.
(i) 
G is l.s.c. at t ¯ if and only if for any sequence { t n } T 1 with t n t ¯ and for any x ¯ G ( t ¯ ) , there exists x n G ( t n ) such that x n x ¯ .
(ii) 
If G has compact values at t ¯ , then G is u.s.c. at t ¯ if and only if for any net { t n } T 1 with t n t ¯ and any x n G ( t n ) , there exist x ¯ G ( t ¯ ) and a subsequence { x n k } of { x n } such that x n k x ¯ .
Lemma 2 
(See Proposition 23 of Chapter 3 in [33]). Let W : X × Y R be a real-valued function and G : Y X be a set-valued mapping. The marginal set-valued mapping M : Y X is defined by M ( y ) = { z G ( y ) : W ( z , y ) = sup x G ( y ) W ( x , y ) } . If W is continuous on X × Y and G is continuous with compact values on Y, then M is u.s.c. on Y.
Definition 6 
([8]). For e int C , the function I e m 2 ( · , · ) : P 0 ( Y ) × P 0 ( Y ) R { ± } is defined as
I e m 2 ( A , B ) : = inf { t R : A C m 2 t e + B } .
Proposition 3 
([8]).
(i) 
If A B * ( Y ) and B P 0 ( Y ) , then I e m 2 ( A , B ) > ;
(ii) 
Let A , B P 0 ( Y ) . Then, I e m 2 ( A , B ) = + if and only if A ˙ B = Ø .
Proposition 4 
([8]). If A , B P 0 ( Y ) and A ˙ B is compact, then I e m 2 ( A , B ) = min { t R : A C m 2 t e + B } .
Proposition 5 
([8]). Let A , B P 0 ( Y ) and r R . Then, the following statements hold.
(i) 
I e m 2 ( A , B ) < r if and only if A C m 2 r e + B .
(ii) 
Let A ˙ B be compact, then I e m 2 ( A , B ) r if and only if A C m 2 r e + B .
Proposition 6 
([8]). If A B * ( Y ) , then I e m 2 ( A , A ) = 0 .
Proposition 7 
([8]).
(i) 
Let B P 0 ( Y ) . Then, I e m 2 ( · , B ) is m 2 -increasing on P 0 ( Y ) , that is, if D , E P 0 ( Y ) and D C m 2 E implies that I e m 2 ( D , B ) I e m 2 ( E , B ) .
(ii) 
Let B P 0 ( Y ) . Then, I e m 2 ( · , B ) is strictly m 2 -increasing on B * * ( Y ) , that is, if D , E B * * ( Y ) and D C m 2 E , this implies that I e m 2 ( D , B ) < I e m 2 ( E , B ) .
Proposition 8 
([8]).
(i) 
Let A P 0 ( Y ) . Then, I e m 2 ( A , · ) is m 2 -decreasing on P 0 ( Y ) , that is, if D , E P 0 ( Y ) and D C m 2 E , this implies that I e m 2 ( A , D ) I e m 2 ( A , E ) .
(ii) 
Let A B * * ( Y ) . Then, I e m 2 ( A , · ) is strictly m 2 -decreasing on P 0 ( Y ) , that is, if D , E P 0 ( Y ) and D C m 2 E , this implies that I e m 2 ( A , D ) > I e m 2 ( A , E ) .
Proposition 9. 
If A , B P 0 ( Y ) , then I e m 2 ( δ A , δ B ) = δ I e m 2 ( A , B ) for all δ 0 .
Proof. 
It follows from Proposition 6 that the conclusion obviously holds for δ = 0 . Now, we show that it is valid for δ > 0 . Indeed, for A , B P 0 ( Y ) and δ > 0 , we have
I e m 2 ( δ A , δ B ) = inf { t R : δ A C m 2 t e + δ B } = inf { t R : A C m 2 t δ e + B } = inf { δ γ R : A C m 2 γ e + B } = δ inf { γ R : A C m 2 γ e + B } = δ I e m 2 ( A , B ) .
Therefore, the proof is complete. □

3. Continuity and Convexity of a Nonlinear Scalarization Function

In this section, we shall show the continuity and convexity of a nonlinear scalarization function based on the function I e m 2 ( · , · ) .
Let Λ 1 and Λ 2 be two normed vector spaces. Assume that A : Λ 1 Y and B : Λ 2 Y are two set-valued mappings. We define ω : Λ 1 × Λ 2 R { ± } as follows:
ω ( μ , η ) : = I e m 2 A ( μ ) , B ( η ) = inf t R : A ( μ ) C m 2 t e + B ( η ) , ( μ , η ) Λ 1 × Λ 2 .
In the sequel, we always assume that, for any given μ Λ 1 , η Λ 2 , A ( μ ) B * ( Y ) , B ( η ) P 0 ( Y ) , and A ( μ ) ˙ B ( η ) Ø . Then, by Proposition 3, we have
< ω ( μ , η ) < + , ( μ , η ) Λ 1 × Λ 2 .
Proposition 10. 
Assume that A ( μ ) ˙ B ( η ) Ø for any ( μ , η ) Λ 1 × Λ 2 . Assume that A ( · ) and B ( · ) are continuous with nonempty compact values. Then, ω ( · , · ) is continuous on Λ 1 × Λ 2 .
Proof. 
Firstly, we prove that ω ( · , · ) is lower semicontinuous on Λ 1 × Λ 2 . For any r R , let
M l = ( μ , η ) Λ 1 × Λ 2 : ω ( μ , η ) r .
It suffices to show that M l is a closed subset of Λ 1 × Λ 2 . Let ( μ n , η n ) M l with ( μ n , η n ) ( μ 0 , η 0 ) . Suppose that ( μ 0 , η 0 ) M l . Then, A ( μ 0 ) C m 2 r e + B ( η 0 ) by Proposition 5 (ii). This indicates that A ( μ 0 ) ˙ B ( η 0 ) r e C = Ø . According to A ( μ 0 ) ˙ B ( η 0 ) Ø , we have
x r e C , x A ( μ 0 ) ˙ B ( η 0 ) .
Now, we claim that there exists N 0 N such that when n N 0 ,
x n r e C , x n A ( μ n ) ˙ B ( η n ) .
If not, then for any n, there exist m n n and x ¯ m n A ( μ m n ) ˙ B ( η m n ) such that x ¯ m n r e C . Without loss of generality, we assume that there exists x ¯ n with
x ¯ n + B ( η n ) A ( μ n ) ,
such that
x ¯ n r e C , n .
Thanks to (4), we have x ¯ n + y n A ( μ n ) for any y n B ( η n ) . As A ( · ) is u.s.c. with compact values at μ 0 and B ( · ) is u.s.c. with compact values at η 0 , we see that the sequences { y n } and { x ¯ n + y n } have convergent subsequences by Proposition 2 (ii). Consequently, { x ¯ n } has a convergent subsequence { x ¯ n k } . Without loss of the generality, we assume that x ¯ n x 0 . Now, we show that x 0 A ( μ 0 ) ˙ B ( η 0 ) . Indeed, for any b B ( η 0 ) , by the lower semicontinuity of the mapping B ( · ) , there exists b n B ( η n ) such that b n b . It follows from (4) that there exists a n A ( μ n ) such that
x ¯ n + b n = a n .
Since A ( · ) is u.s.c. with compact values at μ 0 , by Proposition 2 (ii), there exist a 0 A ( μ 0 ) and a subsequence { a n k } of { a n } such that a n k a 0 . Combining this with x ¯ n x 0 , b n b and (6), we arrive at x 0 + b = a 0 A ( μ 0 ) . Moreover, by the arbitrariness of b B ( η 0 ) , we have x 0 + B ( η 0 ) A ( μ 0 ) , i.e., x 0 A ( μ 0 ) ˙ B ( η 0 ) . With the help of (5) and x ¯ n x 0 , and taking into account the closedness of C, we have
x 0 r e C ,
which contradicts (2). Hence, (3) holds. This implies that A ( μ n ) C m 2 r e + B ( η n ) and so ω ( μ n , η n ) > r by Proposition 5 (ii). This leads to a contradiction. Therefore, M l is a closed subset of Λ 1 × Λ 2 .
Next, we prove that ω ( · , · ) is upper semicontinuous on Λ 1 × Λ 2 . For any r R , let
M u = { x X : ω ( η , μ ) r } .
It suffices to show that M u is a closed subset of Λ 1 × Λ 2 . Indeed, let { ( η n , μ n ) } M u with ( η n , μ n ) ( η 0 , μ 0 ) . Then, A ( μ n ) C m 2 r e + B ( η n ) by Proposition 5 (i). This implies that
A ( μ n ) ˙ B ( η n ) r e int C = Ø , n N .
Now, we claim that A ( μ 0 ) ˙ B ( λ 0 ) r e int C = Ø , that is,
x r e int C , x A ( μ 0 ) ˙ B ( η 0 ) .
If not, then there exists a point x 0 with
x 0 + B ( η 0 ) A ( μ 0 )
such that
x 0 r e int C .
By (9), we have x 0 A ( μ 0 ) u for any u B ( η 0 ) . Since A ( · ) is l.s.c. at μ 0 , there exists
{ x n } A ( μ n ) u , u B ( η 0 )
such that x n x 0 .
For any u n B ( η n ) , since B ( · ) is u.s.c. with compact values at η 0 , by Proposition 2 (ii), there exist u 0 B ( η 0 ) and a subsequence { u n k } of { u n } such that u n k u 0 . Without loss of generality, we assume that u n u 0 . As a result, for any ϵ > 0 , there exists N N such that u n u 0 ϵ B , n N . Hence, it follows from (11) that
x n + u n A ( μ n ) + u n u 0 A ( μ n ) + ϵ B , n N .
This together with the arbitrariness of u n B ( η n ) gives rise to
x n + B ( η n ) A ( μ n ) + ϵ B , n N ,
i.e., x n A ( μ n ) ˙ B ( η n ) + ϵ B , n N . Moreover, it follows from (7) that
{ x n } r e int C ε B , n N .
We claim that
x 0 r e int C .
Granting to this, we get a contradiction with (10). Hence, (8) holds. This leads to A ( μ 0 ) ˙ B ( η 0 ) r e int C = Ø , and so A ( μ 0 ) C m 1 r e + B ( η 0 ) . Hence, ω ( η 0 , μ 0 ) r by Proposition 5 (i). Consequently, ( η 0 , μ 0 ) M u .
Now, we turn our attention to the claim (13). If not, according to x n x 0 , there exists N 1 N with N 1 N such that x n r e int C , n N 1 . Set ϵ = x N 1 r e 2 , then we have ( x N 1 r e ) int C = x N 1 r e ϵ B , which contradicts (12). Therefore, (13) is valid. □
Proposition 11. 
Assume that B ( η 0 ) B * ( Y ) for some η 0 Λ 2 .
(i) 
If A ( · ) is m 2 -naturally C-quasiconvex with bounded values on Λ 1 , then ω ( · , η 0 ) is naturally quasiconvex on Λ 1 , that is, for any μ 1 , μ 2 Λ 1 and for any α [ 0 , 1 ] , there exists β [ 0 , 1 ] such that
ω α μ 1 + ( 1 α ) μ 2 , η 0 β ω ( μ 1 , η 0 ) + ( 1 β ) ω ( μ 2 , η 0 ) .
(ii) 
If A ( · ) is strictly m 2 -naturally C-quasiconvex with nonempty compact values on Λ 1 , then ω ( · , η 0 ) is strictly naturally quasiconvex on Λ 1 , that is, for any μ 1 , μ 2 Λ 1 with μ 1 μ 2 and for any α ( 0 , 1 ) , there exists β [ 0 , 1 ] such that
ω α μ 1 + ( 1 α ) μ 2 , η 0 < β ω ( μ 1 , η 0 ) + ( 1 β ) ω ( μ 2 , η 0 ) .
Proof. 
We only prove statement (ii), since statement (i) is obtained by the same techniques given in the proof of (ii). As A ( · ) is strictly m 2 -naturally C-quasiconvex on Λ 1 , for any μ 1 , μ 2 Λ 1 with μ 1 μ 2 and for any α ( 0 , 1 ) , there exists β [ 0 , 1 ] such that
A α μ 1 + ( 1 α ) μ 2 C m 2 β A ( μ 1 ) + ( 1 β ) A ( μ 2 ) .
In terms of Proposition 7 (ii) and Proposition 9, we have
ω α μ 1 + ( 1 α ) μ 2 , η 0 = I e m 2 A α μ 1 + ( 1 α ) μ 2 , B ( η 0 ) < I e m 2 β A ( μ 1 ) + ( 1 β ) A ( μ 2 ) , B ( η 0 ) = inf t R : β A ( μ 1 ) + ( 1 β ) A ( μ 2 ) C m 2 t e + B ( η 0 ) inf [ t R : β A ( μ 1 ) C m 2 t e + β B ( λ 0 ) + t R : ( 1 β ) A ( μ 2 ) C m 2 t e + ( 1 β ) B ( λ 0 ) ] = inf t R : β A ( μ 1 ) C m 2 t e + β B ( η 0 ) + inf t R : ( 1 β ) A ( μ 2 ) C m 2 t e + ( 1 β ) B ( η 0 ) = β ω ( μ 1 , η 0 ) + ( 1 β ) ω ( μ 2 , η 0 ) .
The above strict inequality is from Proposition 7 (ii). The inequality holds because of t R : β A ( μ 1 ) C m 2 t e + β B ( λ 0 ) + t R : ( 1 β ) A ( μ 2 ) C m 2 t e + ( 1 β ) B ( λ 0 ) t R : β A ( μ 1 ) + ( 1 β ) A ( μ 2 ) C m 2 t e + B ( λ 0 ) . The third equality is valid due to Proposition 3 and the fact
inf ( D + F ) = inf D + inf F ,
where D , F R , inf D > , and inf F > . The last equality holds by Proposition 9. Henceforth, ω ( · , η 0 ) is strictly naturally quasiconvex on Λ 1 . □
Proposition 12. 
Let μ 0 Λ 1 .
(i) 
If B ( · ) is m 2 -properly C-quasiconvex on Λ 2 , then ω ( μ 0 , · ) is properly quasiconcave on Λ 2 , that is, for any η 1 , η 2 Λ 2 and for any α [ 0 , 1 ] , one has
either ω μ 0 , α η 1 + ( 1 α ) η 2 ω ( μ 0 , η 1 ) or ω μ 0 , α η 1 + ( 1 α ) η 2 ω ( μ 0 , η 2 ) .
(ii) 
If A ( μ 0 ) is compact and B ( · ) is strictly m 2 -properly C-quasiconvex on Λ 2 , then ω ( μ 0 , · ) is strictly properly quasiconcave on Λ 2 , that is, for any η 1 , η 2 Λ 2 with η 1 η 2 and for any α ( 0 , 1 ) , one has
either ω μ 0 , α η 1 + ( 1 α ) η 2 > ω ( μ 0 , η 1 ) or ω μ 0 , α η 1 + ( 1 α ) η 2 > ω ( μ 0 , η 2 ) .
Proof. 
We only prove statement (ii), since the proof of the statement (i) follows on the similar line. As B ( · ) is strictly m 2 -properly C-quasiconvex on Λ 2 , for any η 1 , η 2 Λ 2 with η 1 η 2 and for any α ( 0 , 1 ) , one has
either B α η 1 + ( 1 α ) η 2 C m 2 B ( η 1 ) or B α η 1 + ( 1 α ) η 2 C m 2 B ( η 2 ) .
Due to Proposition 8 (ii), one has
either ω μ 0 , α η 1 + ( 1 α ) η 2 = I e m 2 A ( μ 0 ) , B α η 1 + ( 1 α ) η 2 > I e m 2 A ( μ 0 ) , B ( η 1 ) = ω ( μ 0 , η 1 ) ,
or
ω μ 0 , α η 1 + ( 1 α ) η 2 = I e m 2 A ( μ 0 ) , B α η 1 + ( 1 α ) η 2 > I e m 2 A ( μ 0 ) , B ( η 2 ) = ω ( μ 0 , η 2 ) .
Consequently, ω ( μ 0 , · ) is strictly properly quasiconcave on Λ 2 . □

4. Path Connectedness of ( m 2 -SOP)

In this section, we implement an application of the continuity of the function ω ( · , · ) to the path connectedness of the m 2 -minimal solution set and the weak m 2 -minimal solution set of ( m 2 -SOP).
The following result shows that the sets argmin m 2 ( K , F ) and argmin w m 2 ( K , F ) are the same, when F is strictly m 2 -naturally C-quasiconvex on K.
Lemma 3. 
Assume that the following conditions hold:
(i) 
Assume that K is a convex subset of X;
(ii) 
F has bounded values on K;
(iii) 
F is strictly m 2 -naturally C-quasiconvex on K.
Then, argmin m 2 ( K , F ) = argmin w m 2 ( K , F ) .
Proof. 
By Proposition 1, it suffices to prove that argmin w m 2 ( K , F ) argmin m 2 ( K , F ) . Assume that there exists x 0 argmin w m 2 ( K , F ) such that x 0 argmin m 2 ( K , F ) . Then, there exists x ¯ K such that
F ( x ¯ ) C m 2 F ( x 0 ) ,
and
F ( x ¯ ) F ( x 0 ) .
Hence, it follows from (15) that x ¯ x 0 . Since F is strictly m 2 -naturally C-quasiconvex on K, for any α ( 0 , 1 ) , there exists β [ 0 , 1 ] such that
F α x ¯ + ( 1 α ) x 0 C m 2 β F ( x ¯ ) + ( 1 β ) F ( x 0 ) .
Combining this with (14), F ( x 0 ) β 0 F ( x 0 ) + ( 1 β 0 ) F ( x 0 ) , and the transitivity of the set order relation C m 2 , we have F α x ¯ + ( 1 α ) x 0 C m 2 F ( x 0 ) , α ( 0 , 1 ) . This together with the convexity of K shows that x 0 argmin w m 2 ( K , F ) . This leads to a contradiction because of x 0 argmin w m 2 ( K , F ) . Thus, the proof is complete. □
Inspired by works in [35,36], we introduce the following definition of the level mapping with respect to the order relation C m 2 .
Definition 7. 
Let F : X Y be a set-valued mapping and K X . A set-valued mapping l e v F : K K defined by
l e v F ( x ) = y K : F ( y ) C m 2 F ( x ) , x K ,
is called a level mapping.
Remark 2. 
It is easy to see that argmin m 2 l e v F ( x ) , F argmin m 2 ( K , F ) for any x K .
Lemma 4. 
Assume that K is a convex subset of X. Then, the following statements hold.
(i) 
If F is strictly m 2 -naturally C-quasiconvex on K, then l e v F ( x 0 ) = { x 0 } when x 0 argmin w m 2 ( K , F ) .
(ii) 
If F is m 2 -naturally C-quasiconvex on K, then l e v F ( x ) is convex for any x K .
Proof. 
(i) It is easy to see that x 0 l e v F ( x 0 ) . Suppose that there exists x ¯ l e v F ( x 0 ) such that x ¯ x 0 . Since F is strictly m 2 -naturally C-quasiconvex on K, for any α ( 0 , 1 ) , there exists β 0 [ 0 , 1 ] such that
F α x 0 + ( 1 α ) x ¯ C m 2 β 0 F ( x 0 ) + ( 1 β 0 ) F ( x ¯ ) .
It follows from x ¯ l e v F ( x 0 ) that
F ( x ¯ ) C m 2 F ( x 0 ) .
Combining this with (16), the transitivity of the set order relation C m 2 , and F ( x 0 ) β 0 F ( x 0 ) + ( 1 β 0 ) F ( x 0 ) , we arrive at
F α x 0 + ( 1 α ) x ¯ C m 2 F ( x 0 ) , α ( 0 , 1 ) .
This contradicts x 0 argmin w m 2 ( K , F ) . Therefore, l e v F ( x 0 ) = { x 0 } . □
(ii) Let y 1 , y 2 l e v F ( x ) , that is,
F ( y i ) C m 2 F ( x ) , i = 1 , 2 .
Since F is m 2 -naturally C-quasiconvex on K, for any α [ 0 , 1 ] , there exists β 0 [ 0 , 1 ] such that
F α y 1 + ( 1 α ) y 2 C m 2 β 0 F ( y 1 ) + ( 1 β 0 ) F ( y 2 ) .
By (17) and (18), and taking into account F ( x 0 ) β 0 F ( x 0 ) + ( 1 β 0 ) F ( x 0 ) and the transitivity of the set order relation C m 2 , we obtain F α y 1 + ( 1 α ) y 2 C m 2 F ( x ) for any α [ 0 , 1 ] . This implies that α y 1 + ( 1 α ) y 2 l e v F ( x ) for any α [ 0 , 1 ] and the proof is complete. □
Lemma 5. 
Assume that the following conditions hold:
(i) 
K is closed and convex;
(ii) 
F is continuous with nonempty compact values on K;
(iii) 
F ( x ) ˙ F ( y ) Ø for each x , y K .
Then, l e v F ( x ) is closed for any x K .
Proof. 
Let { y n } l e v F ( x ) with y n y 0 . It suffices to prove that y 0 l e v F ( x ) . It is clear that y 0 K . It follows from { y n } l e v F ( x ) that
F ( y n ) C m 2 F ( x ) , n N .
Then, we deduce I e m 2 F ( y n ) , F ( x ) 0 from Proposition 5 (ii). By the similar proof for the closedness of M l in Proposition 10, we can obtain I e m 2 F ( y 0 ) , F ( x ) 0 and so F ( y 0 ) C m 2 F ( x ) . Therefore, l e v F ( x ) is closed for any x K . □
Lemma 6. 
Assume that K is a nonempty compact and F is continuous on K with nonempty compact values. Then, l e v F ( · ) is u.s.c. on K.
Proof. 
Suppose to the contrary that there exists x 0 K such that l e v F ( · ) is not u.s.c. at x 0 . Then, there exist an open set W 0 with l e v F ( x 0 ) W 0 and a sequence { x n } with x n x 0 such that l e v F ( x n ) W 0 , n N . This implies that there is y n l e v F ( x n ) such that
y n W 0 , n N .
Since K is compact and { y n } K , without loss of generality, we can assume that y n y 0 K . It follows from y n l e v F ( x n ) that there exists c n C such that
F ( x n ) c n F ( y n ) , n N .
Consequently, for any v n F ( x n ) , we have v n c n F ( y n ) . Since F is u.s.c. with compact values on K, sequences { v n } and { v n c n } have convergent subsequences by Proposition 2 (ii). This implies that { c n } has a convergent subsequence. Without loss of generality, we assume that c n c 0 . Thanks to { c n } C and the closedness of C, we have c 0 C .
We claim that F ( x 0 ) c 0 F ( y 0 ) , i.e., y 0 l e v F ( x 0 ) . Indeed, for any z 0 F ( x 0 ) , by the lower semicontinuity of F, there exists z n F ( x n ) such that z n z 0 . It follows from (21) that there exists u n F ( y n ) such that
u n = z n c n .
By the compactness and the upper semicontinuity of F and by Proposition 2 (ii), we see that there exist u 0 F ( y 0 ) and a subsequence { u n k } of { u n } such that u n k u 0 . Combining this with z n z 0 , c n c 0 , and (22), we have
z 0 c 0 = u 0 F ( y 0 ) .
In view of the arbitrariness of z 0 F ( x 0 ) , we have F ( y 0 ) C m 2 F ( x 0 ) . This states that y 0 l e v F ( x 0 ) . With the help of y n y 0 and l e v F ( x 0 ) W 0 , we see that y n W 0 for n is large enough, which contradicts (20). Therefore, l e v F ( · ) is u.s.c. on K. □
Lemma 7. 
Suppose that the following conditions hold:
(i) 
K is a nonempty and convex subset of X;
(ii) 
F is strictly m 2 -naturally C-quasiconvex on K;
(iii) 
F ( x ) ˙ F ( y ) Ø for each x , y K ;
(iv) 
F is l.s.c. on K.
Then, l e v F ( · ) is l.s.c. on K.
Proof. 
Suppose to the contrary that there exists x 0 K such that l e v F ( · ) is not l.s.c. at x 0 . Then, there exist y 0 l e v F ( x 0 ) , a neighborhood W 0 of 0 X and a sequence { x n } with x n x 0 such that
( y 0 + W 0 ) l e v F ( x n ) = Ø , n N .
It is clear that x 0 l e v F ( x 0 ) . Now, we consider the following two cases:
Case one . y 0 = x 0 . Then, by x n l e v F ( x n ) and x n x 0 = y 0 , we have x n ( y 0 + W 0 ) l e v F ( x n ) for n, which is large enough. This contradicts (23).
Case two . y 0 x 0 . Since F is strictly m 2 -naturally C-quasiconvex on K, for any α ( 0 , 1 ) , there exists β [ 0 , 1 ] such that
F α x 0 + ( 1 α ) y 0 C m 2 β F ( x 0 ) + ( 1 β ) F ( y 0 ) .
This together with y 0 l e v F ( x 0 ) and the transitivity of C m 2 result in
F α x 0 + ( 1 α ) y 0 C m 2 β F ( x 0 ) + ( 1 β ) F ( x 0 ) .
According to F ( x 0 ) β F ( x 0 ) + ( 1 β ) F ( y 0 ) , we have
F α x 0 + ( 1 α ) y 0 C m 2 F ( x 0 ) , α ( 0 , 1 ) .
Let y ( α ) = α x 0 + ( 1 α ) y 0 , α ( 0 , 1 ) . It is clear that there exists α 0 ( 0 , 1 ) such that
y ( α 0 ) y 0 + W 0 .
Now, we claim that there exists N 0 N such that, when n N 0 ,
F y ( α 0 ) C m 2 F ( x n ) .
Indeed, if not, without loss of generality, we can assume that F y ( α 0 ) C m 2 F ( x n ) for all n N . This implies that
F y ( α 0 ) ˙ F ( x n ) int C = Ø , n N .
Similar to the proof of Proposition 10 (see (7) and (8)), we can prove that
F y ( α 0 ) ˙ F ( x 0 ) int C = Ø .
This contradicts (24). Hence, (26) holds and so y ( α 0 ) l e v F ( x n ) . With the help of (25), one has y ( α 0 ) ( y 0 + W 0 ) l e v F ( x n ) , which contradicts (23). Consequently, l e v F ( x ) is l.s.c. on K. □
Let B P 0 ( Y ) . We define the function ϕ : X R { ± } by ϕ ( x ) = I e m 2 F ( x ) , B and define a set-valued mapping H m : K K as follows:
H m ( x ) = z l e v F ( x ) : ϕ ( z ) = inf y l e v F ( x ) ϕ ( y ) .
Lemma 8. 
Suppose that the following conditions hold:
(i) 
K is a nonempty, compact, and convex subset of X;
(ii) 
F is continuous with nonempty compact values on K;
(iii) 
F ( x ) ˙ F ( y ) Ø for each x , y K ;
(iv) 
F is strictly m 2 -naturally C-quasiconvex.
Then, the following two statements are true:
(a) 
H m ( x ) is nonempty for any x K .
(b) 
H m ( x ) argmin w m 2 l e v F ( x ) , F = argmin m 2 l e v F ( x ) , F argmin m 2 ( K , F ) , x K .
Proof. 
(a) It follows from Lemma 5 that l e v F ( x ) is closed. Since K is compact and l e v F ( x ) K , we see that l e v F ( x ) is compact. It is clear that x l e v F ( x ) and so it is nonempty. By Proposition 10, we can see that ϕ is continuous on K. Therefore, H m ( x ) is nonempty for any x K .
(b) For any x K , let z 0 H m ( x ) . Suppose that z 0 argmin w m 2 l e v F ( x ) , F . Then there exists z ¯ l e v F ( x ) such that F ( z ¯ ) C m 2 F ( z 0 ) . It follows from Proposition 7 (ii) that ϕ ( z ¯ ) < ϕ ( z 0 ) , which contradicts z 0 H m ( x ) . As a result, H m ( x ) argmin w m 2 ( l e v F ( x ) , F ) . By Lemma 3, we have argmin w m 2 ( l e v F ( x ) , F ) = argmin m 2 ( l e v F ( x ) , F ) . Moreover, it follows from Remark 3 that argmin m 2 l e v F ( x ) , F argmin m 2 ( K , F ) . Therefore, the proof is complete. □
Lemma 9. 
Suppose that the following conditions hold:
(i) 
K is a nonempty, compact, and convex subset of X;
(ii) 
F is continuous with nonempty compact values on K;
(iii) 
F ( x ) ˙ F ( y ) Ø for each x , y K ;
(iv) 
F is strictly m 2 -naturally C-quasiconvex.
Then, H m ( · ) is continuous on K.
Proof. 
First, we show that H m ( x ) is a singleton for each x K . Suppose that there exists x 0 K such that H m ( x 0 ) is not a singleton. Then, there exist z 1 , z 2 H m ( x 0 ) with z 1 z 2 , that is,
z 1 , z 2 l e v F ( x 0 ) a n d ϕ ( z 1 ) = ϕ ( z 2 ) = inf y l e v F ( x 0 ) ϕ ( y ) .
It follows from Lemma 4 (ii) that l e v F ( x 0 ) is convex. Hence, for any α ( 0 , 1 ) , one has α z 1 + ( 1 α ) z 2 l e v F ( x 0 ) . Moreover, by Proposition 11 (ii), we can see that ϕ is strictly naturally quasiconvex on K. Then, for any α ( 0 , 1 ) , there exists β [ 0 , 1 ] such that
ϕ α z 1 + ( 1 α ) z 2 < β ϕ ( z 1 ) + ( 1 β ) ϕ ( z 2 ) .
Due to (27), we have
ϕ α z 1 + ( 1 α ) z 2 < inf y l e v F ( x 0 ) ϕ ( y ) .
This leads to a contradiction because of α z 1 + ( 1 α ) z 2 l e v F ( x 0 ) . Henceforth, H m ( x ) is a singleton for each x K .
Next, we prove that H m ( · ) is continuous on K. Indeed, it follows from Lemma 6 and Lemma 7 that l e v F ( · ) is continuous on K. Combining with the compactness of K, l e v F ( x ) K and Lemma 5, we see that L e v F ( x ) is compact for each x K . It is clear that x L e v F ( x ) and so it is nonempty. By Proposition 10, we can see that ϕ is continuous on K. Let ψ ( x ) = ϕ ( x ) for x X . Then, we have
H m ( x ) = { z l e v F ( x ) : ψ ( z ) = sup y l e v F ( x ) ψ ( y ) } .
By Lemma 2, it can be seen that H m ( · ) is u.s.c. on K. Therefore, H m ( · ) is continuous on K by the single-valuedness of H m ( x ) for each x K . □
Theorem 1. 
Assume that the following assumptions are valid:
(i) 
K is a nonempty, compact, and convex subset of X;
(ii) 
F is continuous with nonempty compact values on K;
(iii) 
F ( x ) ˙ F ( y ) Ø for each x , y K ;
(iv) 
F is strictly m 2 -naturally C-quasiconvex on K.
Then, argmin m 2 ( K , F ) is path-connected. Moreover, argmin w m 2 ( K , F ) is path-connected.
Proof. 
For any x argmin m 2 ( K , F ) , by Lemma 4 (i), one has l e v F ( x ) = { x } and so H m ( x ) = { x } . For any x 1 , x 2 argmin m 2 ( K , F ) , let
g ( λ ) = H m λ x 1 + ( 1 λ ) x 2 , λ [ 0 , 1 ] .
It follows from Lemma 8 that g ( λ ) argmin m 2 ( K , F ) for any λ [ 0 , 1 ] . By Lemma 9, H m ( · ) is continuous on K and so g ( · ) is continuous on [ 0 , 1 ] . In addition, we can see that g ( 0 ) = H m ( x 2 ) = { x 2 } and g ( 1 ) = H m ( x 1 ) = { x 1 } . Therefore, argmin m 2 ( K , F ) is path-connected. Furthermore, argmin w m 2 ( K , F ) is path-connected because of argmin w m 2 ( K , F ) = argmin m 2 ( K , F ) by Lemma 3. □
Remark 3. 
It is worth pointing out that our main results in this section are different from that in [36]. In fact, Han et al. [36] established the path connectedness of the solution sets for set optimization problems involving the lower set order relation C l by linear scalarization function f C * { 0 } , while, in this paper, with the help of the nonlinear scalarization function I e m 2 ( · , · ) , we present the path connectedness of the solution sets for set optimization problems with the order relation C m 2 .
Now, we give an example to illustrate Theorem 1.
Example 3. 
Let X = R , Y = R 2 , and C = R + 2 . Let K = [ π 2 , π 2 ] and
F ( x ) = ( x , s i n x ) + B Y .
It is not hard to check that the assumptions (i)–(iii) are satisfied. Now, we check that the assumption (iv) is valid. Indeed, for any x 1 , x 2 K with x 1 x 2 (without loss of the generality, we assume that x 1 < x 2 ) and for any α ( 0 , 1 ) , there exists β 0 = 0 such that
F α x 1 + ( 1 α ) x 2 C m β 0 F ( x 1 ) + ( 1 β 0 ) F ( x 2 ) = F ( x 2 ) = ( x 2 , s i n x 2 ) + B Y ,
since F α x 1 + ( 1 α ) x 2 ˙ F ( x 2 ) int C = α ( x 1 x 2 ) , s i n α x 1 + ( 1 α ) x 2 s i n x 2 . Hence, argmin m 2 ( K , F ) and argmin w m 2 ( K , F ) are path-connected by Theorem 1.

5. Continuity of the Solution Set Mappings of ( m 2 -PSOP)

In the section, we explore an application of the nonlinear scalarization function for sets to the continuity of the weak m 2 -minimal solution set mapping S w ( · ) and the m 2 -minimal solution set mapping S ( · ) of ( m 2 -PSOP).
We define φ : X × X × Λ R { ± } by
φ ( x , y , λ ) = I e m 2 F ( y , λ ) , F ( x , λ ) , ( x , y ) X × X .
Lemma 10. 
For each λ Λ , one has
S w ( λ ) = x K ( λ ) : φ ( x , y , λ ) 0 , y K ( λ ) .
Proof. 
By the definition of the m 2 -minimal solution set of ( m 2 -PSOP), for each λ Λ , we have x S w ( λ ) if and only if
F ( y , λ ) C m 2 F ( x , λ ) , y K ( λ ) .
This indicates that φ ( x , y , λ ) 0 , for any y K ( λ ) by Proposition 5 (i). Henceforth, the proof is complete. □
Theorem 2. 
Let λ 0 Λ . Assume that
(i) 
K ( · ) is continuous with nonempty compact values at λ 0 ;
(ii) 
F ( · , · ) is continuous with nonempty compact values on K ( λ 0 ) × { λ 0 } ;
(iii) 
F ( y , λ ) ˙ F ( x , λ ) Ø , for any x , y K ( λ 0 ) and for any λ Λ .
Then, S w ( · ) is u.s.c. with compact values at λ 0 .
Proof. 
Suppose to the contrary that S w ( · ) is not u.s.c. at λ 0 . Then, there exist an open set W 0 with S w ( λ 0 ) W 0 and a sequence { λ n } with λ n λ 0 such that S w ( λ n ) W 0 , n N . This implies that there is x n S w ( λ n ) such that
x n W 0 , n N .
As K ( · ) is u.s.c. with compact values at λ 0 and x n K ( λ n ) , by Proposition 2 (ii), there exist x 0 K ( λ 0 ) and a subsequence { x n k } of x n such that x n k x 0 . Without loss of generality, we assume that x n x 0 .
Now, we claim that x 0 S w ( λ 0 ) . Indeed, suppose that x 0 S w ( λ 0 ) . Then, it follows from Lemma 10 that there exists y 0 K ( λ 0 ) such that
φ ( x 0 , y 0 , λ 0 ) < 0 .
Since K ( · ) is l.s.c. at λ 0 and y 0 K ( λ 0 ) , it follows that there exists y n K ( λ n ) such that y n y 0 by Proposition 2 (i). In terms of Proposition 10, we see that φ ( · , · , · ) is continuous on K ( λ 0 ) × K ( λ 0 ) × { λ 0 } . As a result, it follows from (29) that
φ ( x n , y n , λ n ) < 0 , for n large enough ,
which contradicts x n S w ( λ n ) by Lemma 10. Thus, x 0 S w ( λ 0 ) . This together with x n x 0 and S w ( λ 0 ) W 0 shows that x n W 0 for n that is large enough, which contradicts (28). Therefore, S w ( · ) is u.s.c. at λ 0 .
Next, we show that S w ( λ 0 ) is compact. Since K ( λ 0 ) is compact and S w ( λ 0 ) K ( λ 0 ) , it suffices to prove the closedness of S w ( λ 0 ) . Indeed, let { x n } S w ( λ 0 ) with x n x 0 . Then, by Lemma 10, we have
φ ( x n , y , λ 0 ) 0 , y K ( λ 0 ) .
This together with the continuity of φ indicates that x 0 S W ( λ 0 ) . As a consequence, the proof is complete. □
Next, we prove the lower semicontinuity of S w ( · ) and S ( · ) . Let S ^ : Λ X be defined by
S ^ ( λ ) : = x K ( λ ) : φ ( x , y , λ ) > 0 , y K ( λ ) .
In the sequel, we assume that S ^ ( λ ) Ø for each λ Λ . In order to establish the main results, we need the following several lemmas.
Lemma 11 
(See Theorem 1.1.2 in [37]). If A Y is convex and int A Ø , then cl ( int A ) = cl A .
Lemma 12. 
Let λ 0 Λ . Assume that
(i) 
K ( · ) is continuous with nonempty compact values at λ 0 ;
(ii) 
F ( · , · ) is continuous with nonempty compact values on K ( λ 0 ) × { λ 0 } ;
(iii) 
F ( y , λ ) ˙ F ( x , λ ) Ø for any x , y K ( λ 0 ) and for any λ Λ .
Then, S ^ ( · ) is l.s.c. at λ 0 .
Proof. 
To prove the result by contradiction, suppose that S ^ ( · ) is not l.s.c. at λ 0 . Then, by Proposition 2 (i), there exist a sequence { λ n } with λ n λ 0 and x 0 S ^ ( λ 0 ) such that for any x n S ^ ( λ n ) , we have x n x 0 .
From x 0 S ^ ( λ 0 ) , we have x 0 K ( λ 0 ) . As K ( · ) is l.s.c. at λ 0 , there exists x ¯ n K ( λ n ) such that x ¯ n x 0 . By the above contradiction assumption, there exists a subsequence { x ¯ n k } of { x ¯ n } such that x ¯ n k S ^ ( λ n k ) for any k N . Without loss of the generality, we assume that x ¯ n S ^ ( λ n ) for any n N . Then, there exists y n K ( λ n ) such that
φ ( x ¯ n , y n , λ n ) 0 , n N .
Since K ( · ) is u.s.c. with nonempty compact values at λ 0 , by Proposition 2 (ii), there exist y 0 K ( λ 0 ) and a subsequence { y n k } of { y n } such that y n k y 0 . It follows from Proposition 10 that φ ( · , · , · ) is continuous on K ( λ 0 ) × K ( λ 0 ) × { λ 0 } . This together with (30) states that
φ ( x 0 , y 0 , λ 0 ) 0 ,
which contradicts x 0 S ^ ( λ 0 ) . Thus, S ^ ( · ) is l.s.c. at λ 0 . □
Lemma 13. 
Let λ 0 Λ . Assume that the following conditions hold:
(i) 
K ( · ) is continuous with nonempty compact values at λ 0 ;
(ii) 
F ( · , · ) is continuous with nonempty compact values on K ( λ 0 ) × { λ 0 } ;
(iii) 
F ( · , λ 0 ) is m 2 -properly C-quasiconvex on K ( λ 0 ) ;
(iv) 
F ( y , λ 0 ) ˙ F ( x , λ 0 ) Ø for any x , y K ( λ 0 ) .
Then, we have
S ^ ( λ 0 ) S ( λ 0 ) S w ( λ 0 ) = cl S ^ ( λ 0 ) .
Proof. 
The proof is divided into the following two steps.
Step 1 . We show that
S ^ ( λ 0 ) S ( λ 0 ) S w ( λ 0 ) .
Indeed, for any x S ^ ( λ 0 ) , by Proposition 5 (ii), we have
F ( y , λ 0 ) C m 2 F ( x , λ 0 ) , y K ( λ 0 ) .
This implies that x S ( λ 0 ) and so S ^ ( λ 0 ) S ( λ 0 ) . Simultaneously, taking into account S ( λ 0 ) S w ( λ 0 ) , we see that (32) is valid.
Step 2 . We claim that S w ( λ 0 ) = cl S ^ ( λ 0 ) . To this end, by Lemma 11, we need to prove the set S w ( λ 0 ) is closed and convex. Firstly, by Lemma 10, we see that S w ( λ 0 ) = { x K ( λ 0 ) : φ ( x , y , λ 0 ) 0 , y K ( λ 0 ) } . It follows from the assumption (ii) and Proposition 10 that φ ( · , · , λ 0 ) is continuous on K ( λ 0 ) × K ( λ 0 ) . Hence, it is easy to see that the set S w ( λ 0 ) is closed.
Secondly, by the assumption (iii) and Proposition 12 (i), we see that φ ( · , y , λ 0 ) is properly quasiconcave on K ( λ ) for each y K ( λ 0 ) . Hence, for any x 1 , x 2 S w ( λ 0 ) and for any α [ 0 , 1 ] , we have
either φ α x 1 + ( 1 α ) x 2 , y , λ 0 φ ( x 1 , y , λ 0 ) 0 , y K ( λ 0 )
or
φ α x 1 + ( 1 α ) x 2 , y , λ 0 φ x 2 , y , λ 0 0 , y K ( λ 0 ) .
This implies that α x 1 + ( 1 α ) x 2 S w ( λ 0 ) for any α [ 0 , 1 ] and so S w ( λ 0 ) is convex. Taking into account int S w ( λ 0 ) = S ^ ( λ 0 ) Ø and with the help of Lemma 11, we have
S w ( λ 0 ) = cl S ^ ( λ 0 ) .
This together with (32) indicates that (31) is valid. □
Theorem 3. 
Let λ 0 Λ . Assume that the following conditions hold:
(i) 
K ( · ) is continuous with nonempty compact values at λ 0 ;
(ii) 
F ( · , · ) is continuous with nonempty compact values on K ( λ 0 ) × { λ 0 } ;
(iii) 
F ( y , λ ) ˙ F ( x , λ ) Ø for any x , y K ( λ 0 ) and for any λ Λ ;
(iv) 
F ( · , λ 0 ) is m 2 -properly C-quasiconvex on K ( λ 0 ) .
Then, S ( · ) is H-u.s.c. at λ 0 .
Proof. 
Suppose to the contrary that S ( · ) is not H-u.s.c. at λ 0 . Then, there exists an open set V 0 of 0 X such that for any neighborhood U 0 of λ 0 and there exists λ U 0 with S ( λ ) S ( λ 0 ) + V 0 . Hence, there exists a sequence { λ n } with λ n λ 0 such that S ( λ n ) S ( λ 0 ) + V 0 , n N . This implies that there is x n S ( λ n ) such that
x n S ( λ 0 ) + V 0 , n N .
Taking into account S ( λ n ) S w ( λ n ) , we have x n S w ( λ n ) , n N . Since S w ( · ) is u.s.c. with compact values at λ 0 by Theorem 2, it follows from Proposition 2 (ii) that there exist a subsequence { x n k } of { x n } and x 0 S w ( λ 0 ) such that x n k x 0 . It follows from the closedness of S w ( λ 0 ) and Lemma 13 that
cl S ( λ 0 ) = S w ( λ 0 ) .
Consequently,
x 0 cl S ( λ 0 ) S ( λ 0 ) + V 0 .
This together with x n k x 0 gives us x n k S ( λ 0 ) + V 0 for k if it is large enough, which contradicts (33). Therefore, S ( · ) is H-u.s.c. at λ 0 . □
Theorem 4. 
Let λ 0 Λ . Assume that the following conditions hold:
(i) 
K ( · ) is continuous with nonempty compact values at λ 0 ;
(ii) 
F ( · , · ) is continuous with nonempty compact values on K ( λ 0 ) × { λ 0 } ;
(iii) 
F ( y , λ ) ˙ F ( x , λ ) Ø for any x , y K ( λ 0 ) and for any λ Λ ;
(iv) 
F ( · , λ 0 ) is m 2 -properly C-quasiconvex on K ( λ 0 ) .
Then, S ( · ) is l.s.c. at λ 0 . Moreover, S w ( · ) is l.s.c. at λ 0 .
Proof. 
Since the proof is similar to one for the mapping S w ( · ) , we only prove that S ( · ) is l.s.c. at λ 0 . Indeed, for any x S ( λ 0 ) and for any neighborhood U ( x ) of x, and noting that S ( λ 0 ) cl S ^ ( λ 0 ) obtained in Lemma 13, we have
U ( x ) S ^ ( λ 0 ) Ø .
By Lemma 12, we hold that S ^ ( · ) is l.s.c. at λ 0 . Thus, there exists a neighborhood U ( λ 0 ) of λ 0 such that
S ^ ( λ ) U ( x ) Ø , λ U ( λ 0 ) .
Since S ^ ( λ ) S ( λ ) for each λ Λ , we have
S ( λ ) U ( x ) Ø , λ U ( λ 0 ) .
This means that S ( · ) is l.s.c. at λ 0 . □
Remark 4. 
We would like to mention that our main results in this section are different from those in [35,38,39,40]. In fact, we study the semicontinuity of the minimal solution mapping S ( · ) and the weak minimal solution mapping S w ( · ) for parametric set optimization problems with set order relation C m 2 , while [35,38,39,40] discuss the semicontinuity of the minimal solution mapping S ( · ) and the weak minimal solution mapping S w ( · ) for parametric set optimization problems involving the lower set less relation l or upper set less relation u .
In addition, in this section, we used the nonlinear scalarization method to establish the density result and then give the sufficient conditions for the semicontinuity of the minimal solution mapping S ( · ) and the weak minimal solution mapping S w ( · ) to ( m 2 -PSOP). Our method improves the level set mappings or monotonicity approaches proposed in [35,38,39,40] since they use the monotonicity and strictly C-quasiconvexity assumptions.
Remark 5. 
Recently, Preechasilp and Wangkeeree [41] obtained the upper semicontinuity of the m 1 -minimal solution mapping under the assumption that the objective mapping F has converse m 1 -property. It is worth noting that the property can lead to the following conclusion when x n x 0 , y n y 0 , and λ n λ 0 ,
F ( y 0 , λ 0 ) C m 1 F ( x 0 , λ 0 ) F ( y n 0 , λ n 0 ) C m 1 F ( x n 0 , λ n 0 ) for some n 0 N .
This may be not suitable from the point of view of the locally sign-preserving property of the limit.
Now, we give an example to illustrate that Theorem 3 and Theorem 4 are applicable, but Theorem 3.6 in [41] is not applicable.
Example 4. 
Let X = R , Y = R 2 , and C = R + 2 . Let Λ = [ 0 , 1 ] and K : Λ X be defined by K ( λ ) = { x R : [ λ , λ ] } for each λ Λ . Let F : X × Λ Y be defined by
F ( x , λ ) = x + λ , s i n x + B Y .
It is not hard to check that the assumptions (i)–(iii) are satisfied in Theorem 3 and Theorem 4. Now, we check that the assumption (iv) holds. Indeed, for any λ Λ , for any x 1 , x 2 K ( λ ) (without loss of generality, we assume that x 1 x 2 ), and for any α [ 0 , 1 ] , one has
F α x 1 + ( 1 α ) x 2 , λ C m 2 F ( x 2 , λ ) .
Hence, S ( · ) is H-u.s.c and l.s.c. on Λ by Theorems 3 and 4. However, F does not have converse m 1 -property. Indeed, let x 0 = y 0 = λ 0 = 0 . Obviously, F ( y 0 , λ 0 ) C m 1 F ( x 0 , λ 0 ) , and there exist the sequences { x n } = { 1 2 n } , { y n } = { 1 n } , and { λ n } = { 1 n } such that for all n N with F ( y n , λ n ) C m 1 F ( x n , λ n ) . Hence F does not have the converse m 1 -property and so Theorem 3.6 in [41] is not applicable in this example.

6. Conclusions

This paper mainly investigates the continuity and the convexity of a nonlinear scalarization function for sets, which is an extension of the Gerstewitz function. The function is defined by the partial set order relation C m 2 , which involves the Minkowski difference. We have shown that our results have wide applications in the path connectedness of the set optimization problems and the continuity of the solution mappings of parametric set optimization problems. In the future, it would be interesting to explore applications of the nonlinear scalarization function to the characterizations of robust counterparts of uncertain multiobjective optimization problems and the computation for robust traffic network equilibrium problems.

Author Contributions

Conceptualization, Z.-R.Z. and Y.-D.X.; Methodology, Z.-R.Z. and Y.-D.X.; Formal analysis, Z.-R.Z. and Y.-D.X.; Resources, Y.-D.X.; Writing—original draft, Z.-R.Z. and Y.-D.X.; Writing—review & editing, Z.-R.Z. and Y.-D.X.; Supervision, Y.-D.X.; Funding acquisition, Y.-D.X. All authors have read and agreed to the published version of the manuscript.

Funding

This research was supported by the National Natural Science Foundation of China (Grant numbers: 11801051) and the Natural Science Foundation of Chongqing (Grant number: CSTB2024NSCQ-MSX0928).

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Chen, G.Y.; Huang, X.X.; Yang, X.Q. Vector Optimization, Set-Valued and Variational Analysis; Springer: Heidelberg/Berlin, Germany, 2005. [Google Scholar]
  2. Bao, T.Q.; Mordukhovich, B.S. Set-valued optimization in welfare economics. Adv. Math. Econ. 2010, 13, 113–153. [Google Scholar]
  3. Jahn, J. Vector Optimization: Theory, Applications and Extensions, 2nd ed.; Springer: Heidelberg/Berlin, Germany, 2011. [Google Scholar]
  4. Khan, A.; Tammer, C.; Zǎlinescu, C. Set-Valued Optimization: An Introduction with Applications; Springer: Heidelberg/Berlin, Germany, 2015. [Google Scholar]
  5. Hamel, A.H.; Heyde, F.; Löhne, A.; Rudloff, B.; Schrage, C. Set Optimization and Applications—The State of the Art; Springer: New York, NY, USA, 2015. [Google Scholar]
  6. Kuroiwa, D. On set-valued optimization. Proceedings of the third world congress of nonlinear analysts, part 2 (Catania, 2000). Nonlinear Anal. 2001, 47, 1395–1400. [Google Scholar] [CrossRef]
  7. Jahn, J.; Ha, T.X.D. New order relations in set optimization. J. Optim. Theory Appl. 2001, 148, 209–236. [Google Scholar] [CrossRef]
  8. Karaman, E.; Soyertem, M.; Güvenç, I.A.; Tozkan, D.; Küçük, M.; Küçük, Y. Partial order relations on family of sets and scalarizations for set optimization. Positivity 2018, 22, 783–802. [Google Scholar] [CrossRef]
  9. Luc, D.T. Theory of Vector Optimization: Lecture Notes in Economics and Mathematical Systems; Springer: Heidelberg/Berlin, Germany, 1989; Volume 319. [Google Scholar]
  10. Gerth, C.; Weidner, P. Nonconvex separation theorems and some applications in vector optimization. J. Optim. Theory Appl. 1990, 67, 297–320. [Google Scholar] [CrossRef]
  11. Hiriart-Urruty, J.B. Tangent cone, generalized gradients and mathematical programming in Banach spaces. Math. Oper. Res. 1979, 4, 79–97. [Google Scholar] [CrossRef]
  12. Zaffaroni, A. Degrees of efficiency and degrees of minimality. SIAM J. Control Optim. 2003, 42, 1071–1086. [Google Scholar] [CrossRef]
  13. Guti, C.; Jim, B.; Miglierina, E.; Molho, E. Scalarization in set optimization with solid and nonsolid ordering cones. J. Glob. Optim. 2015, 61, 525–552. [Google Scholar]
  14. Hern, E.; Rodr, L. Nonconvex scalarization in set optimization with set-valued maps. J. Math. Anal. Appl. 2007, 325, 1–18. [Google Scholar]
  15. Kuwano, I.; Tanaka, T.; Yamada, S. Unified scalarization for sets and set-valued Ky Fan minimax inequality. J. Nonlinear Convex Anal. 2010, 11, 513–525. [Google Scholar]
  16. Araya, Y. Four types of nonlinear scalarizations and some applications in set optimization. Nonlinear Anal. 2012, 75, 3821–3835. [Google Scholar] [CrossRef]
  17. Maeda, T. On optimization problems with set-valued objective maps: Existence and optimality. J. Optim. Theory Appl. 2012, 153, 263–279. [Google Scholar] [CrossRef]
  18. Ha, T.X.D. A Hausdorff-type distance, a directional derivative of a set-valued map and applications in set optimization. Optimization 2018, 67, 1031–1050. [Google Scholar] [CrossRef]
  19. Crespi, G.P.; Ginchev, I.; Rocca, M. First-order optimality conditions in set-valued optimization. Math. Mathods Oper. Res. 2006, 63, 87–106. [Google Scholar] [CrossRef]
  20. Xu, Y.D.; Li, S.J. A new nonlinear scalarization function and applications. Optimization 2016, 65, 207–231. [Google Scholar] [CrossRef]
  21. Zhang, W.Y.; Li, S.J.; Teo, K.L. Well-posedness for set optimization problems. Nonlinear Anal. 2009, 71, 3769–3778. [Google Scholar] [CrossRef]
  22. Guti, C.; Miglierina, E.; Molho, E.; Novo, V. Pointwise well-posedness in set optimization with cone proper sets. Nonlinear Anal. 2012, 75, 1822–1833. [Google Scholar]
  23. Gupta, M.; Srivastava, M. Well-posedness and scalarization in set optimization involving ordering cones with possibly empty interior. J. Glob. Optim. 2019, 73, 447–463. [Google Scholar] [CrossRef]
  24. Köbis, E.; Köbis, M.A. Treatment of set order relations by means of a nonlinear scalarization functional: A full characterization. Optimization 2016, 65, 1805–1827. [Google Scholar] [CrossRef]
  25. Ogata, Y.; Tanaka, T.; Saito, Y.; Lee, G.M.; Lee, J.H. An alternative theorem for set-valued maps via set relations and its application to robustness of feasible sets. Optimization 2018, 67, 1067–1075. [Google Scholar] [CrossRef]
  26. Jim, B.; Novo, V.; Vílchez, A. Characterization of set relations through extensions of the oriented distance. Math. Methods Oper. Res. 2020, 91, 89–115. [Google Scholar]
  27. Han, Y.; Huang, N.J. Continuity and convexity of a nonlinear scalaring function in set optimization problems with applications. J. Optim. Theory Appl. 2018, 177, 679–695. [Google Scholar] [CrossRef]
  28. Pallaschke, D.; Urbanski, R. Pairs of Compact Convex Sets; Kluwer Academic Publishers: Dordrecht, The Netherlands, 2002. [Google Scholar]
  29. Tanaka, T. Generalized quasiconvexities, cone saddle points, and minimax theorem for vector-valued functions. J. Optim. Theory Appl. 1994, 81, 355–377. [Google Scholar] [CrossRef]
  30. Ferro, F. A minmax theorem for vector-valued functions. J. Optim. Theory Appl. 1989, 60, 19–31. [Google Scholar] [CrossRef]
  31. Yen, N.D.; Phuong, T.D. Connectedness and stability of the solution set in linear fractional vector optimization problems. In Vector Variational Inequalities and Vector Equilibria; Giannessi, F., Ed.; Kluwer Academic Publishers: Dordrecht, The Netherlands, 2000; pp. 479–489. [Google Scholar]
  32. Berge, C. Topological Spaces, Oliver and Boyd; Oliver and Boyd: London, UK, 1963. [Google Scholar]
  33. Aubin, J.P.; Ekeland, I. Applied Nonlinear Analysis; Wiley: New York, NY, USA, 1984. [Google Scholar]
  34. Göpfert, A.; Riahi, H.; Tammer, C.; Zălinescu, C. Variational Methods in Partially Ordered Spaces; Springer: Heidelberg/Berlin, Germany, 2003. [Google Scholar]
  35. Xu, Y.D.; Li, S.J. On the solution continuity of parametric set optimization problems. Math. Methods Oper. Res. 2016, 84, 223–237. [Google Scholar] [CrossRef]
  36. Han, Y.; Wang, S.H.; Huang, N.J. Arcwise connectedness of the solution sets for set optimization problems. Oper. Res. Lett. 2019, 47, 168–172. [Google Scholar] [CrossRef]
  37. Zălinescu, C. Convex Analysis in General Vector Spaces; World Scientific Publishing: Singapore, 2002. [Google Scholar]
  38. Liu, P.P.; Wei, H.Z.; Chen, C.R.; Li, S.J. Continuity of solutions for parametric set optimization problems via scalarization methods. J. Oper. Res. Soc. China 2021, 9, 79–97. [Google Scholar] [CrossRef]
  39. Karuna, C.; Lalitha, S. Continuity of approximate weak efficient solution set map in parametric set optimization. J. Nonlinear Convex Anal. 2018, 19, 1247–1262. [Google Scholar]
  40. Zhang, C.L.; Huang, N.J. On the stability of minimal solutions for parametric set optimization problems. Appl. Anal. 2021, 100, 1533–1543. [Google Scholar] [CrossRef]
  41. Preechasilp, P.; Wangkeeree, R. A note on semicontinuity of the solution mapping for parametric set optimization problems. Optim. Lett. 2019, 13, 1085–1094. [Google Scholar] [CrossRef]
Figure 1. Set A, Set B, and Set D.
Figure 1. Set A, Set B, and Set D.
Mathematics 12 03839 g001
Figure 2. A ˙ B , A ˙ D .
Figure 2. A ˙ B , A ˙ D .
Mathematics 12 03839 g002
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Zhang, Z.-R.; Xu, Y.-D. The Continuity and Convexity of a Nonlinear Scalarization Function with Applications in Set Optimization Problems Involving a Partial Order Relation. Mathematics 2024, 12, 3839. https://doi.org/10.3390/math12233839

AMA Style

Zhang Z-R, Xu Y-D. The Continuity and Convexity of a Nonlinear Scalarization Function with Applications in Set Optimization Problems Involving a Partial Order Relation. Mathematics. 2024; 12(23):3839. https://doi.org/10.3390/math12233839

Chicago/Turabian Style

Zhang, Zi-Ru, and Yang-Dong Xu. 2024. "The Continuity and Convexity of a Nonlinear Scalarization Function with Applications in Set Optimization Problems Involving a Partial Order Relation" Mathematics 12, no. 23: 3839. https://doi.org/10.3390/math12233839

APA Style

Zhang, Z.-R., & Xu, Y.-D. (2024). The Continuity and Convexity of a Nonlinear Scalarization Function with Applications in Set Optimization Problems Involving a Partial Order Relation. Mathematics, 12(23), 3839. https://doi.org/10.3390/math12233839

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