Next Article in Journal
On Turing Machines Deciding According to the Shortest Computations
Next Article in Special Issue
A Straightforward Sufficiency Proof for a Nonparametric Problem of Bolza in the Calculus of Variations
Previous Article in Journal
Constacyclic Codes over Finite Chain Rings of Characteristic p
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On Constrained Set-Valued Semi-Infinite Programming Problems with ρ-Cone Arcwise Connectedness

1
Department of Mathematics, Taki Government College, Taki 743429, West Bengal, India
2
Department of Applied Mathematics, University Politehnica of Bucharest, 060042 Bucharest, Romania
*
Author to whom correspondence should be addressed.
Axioms 2021, 10(4), 302; https://doi.org/10.3390/axioms10040302
Submission received: 21 October 2021 / Accepted: 10 November 2021 / Published: 12 November 2021
(This article belongs to the Special Issue Calculus of Variations and Nonlinear Partial Differential Equations)

Abstract

:
In this paper, we establish sufficient Karush–Kuhn–Tucker (for short, KKT) conditions of a set-valued semi-infinite programming problem (SP) via the notion of contingent epiderivative of set-valued maps. We also derive duality results of Mond–Weir (MWD), Wolfe (WD), and mixed (MD) types of the problem (SP) under ρ -cone arcwise connectedness assumptions.

1. Introduction

Over the last few decades, many authors, such as Hanson [1], Craven [2], Corley [3], Zalmai [4] etc., studied different types of optimization problems. One of such optimization problems is semi-infinite programming problem. In recent times, many authors, such as Goberna and Lopez [5], Shapiro [6], etc., have studied optimality conditions of semi-infinite programming problems. In 2005, Shapiro [7] studied the Lagrangian-type duality of semi-infinite programming problems under convexity assumption. In 2010, Kostyukova and Tchemisova [8] established sufficient optimality conditions of semi-infinite programming problems using convexity assumption. In 2012, Mishra and Jaiswal [9] established the sufficient optimality conditions of semi-infinite programming problems using generalized convexity assumption. They also formulated duality model and proved the corresponding theorems of Mond–Weir type dual.
In 1976, Avriel [10] introduced the notion of arcwise connectedness as a generalization of convexity. It was basically introduced by replacing the line segment and joining two points by a continuous arc. Later, Fu and Wang [11] and Lalitha et al. [12] introduced the notion of cone arcwise connected set-valued maps as an extension of the class of convex set-valued maps. Lalitha et al. [12] established the sufficient optimality conditions of set-valued optimization problems via contingent epiderivative and cone arcwise connectedness assumptions. In 2013, Yu [13] established the necessary and sufficient optimality conditions for the existence of global proper efficient points of vector optimization problems using cone arcwise connectedness. Yihong and Min [14] introduced the concept of α -order nearly cone arcwise connected set-valued maps and derived the necessary and sufficient optimality conditions of some set-valued optimization problems. Yu [15] established the necessary and sufficient optimality conditions for the existence of global proper efficient elements in vector optimization problems. In 2018, Peng and Xu [16] introduced the notion of cone subarcwise connected set-valued maps. They also established the second-order necessary optimality conditions for global proper efficiency of set-valued optimization problems.
In this paper, we consider a set-valued semi-infinite programming problem (SP), where the objective function and constraints are set-valued maps. We are mainly interested in establishing the sufficient KKT optimality conditions of the problem (SP) in terms of generalized cone arcwise connectedness. We also study the duality theorems of Mond–Weir (MWD), Wolfe (WD), and mixed (MD) types associated with the problem (SP).
This paper is organized as follows. In Section 2, we state some definitions and preliminary concepts of set-valued maps. The concept of ρ -cone arcwise connectedness is included in Section 3. In Section 4, we establish (see Section 5) the sufficient KKT optimality conditions for the problem (SP). We also study the duality results of various types using generalized cone arcwise connectedness assumptions (see Section 6, Section 7 and Section 8). Section 9 concludes the paper.

2. Definitions and Preliminaries

Let V be a real normed space and Ω be a nonempty subset of V. Then, Ω is said to be a cone if λ v Ω , for all v Ω and λ 0 . Furthermore, Ω is called non-trivial if Ω { θ V } , proper if Ω V , pointed if Ω ( Ω ) = { θ V } , solid if int ( Ω ) , closed if Ω ¯ = Ω , and convex if λ Ω + ( 1 λ ) Ω Ω , for all λ [ 0 , 1 ] , where int ( Ω ) and Ω ¯ denote the interior and closure of Ω , respectively, and θ V is the zero element of V.
Aubin [17,18] introduced the notion of contingent cone in set-valued optimization theory. Moreover, Aubin [17,18] and Cambini et al. [19] introduced the notion of second-order contingent set in a set-valued optimization theory.
Definition 1 ([17,18]). 
Let V be a real normed space, B V , and v B ¯ . The contingent cone to B at v is denoted by T ( B , v ) and is defined as follows: an element v T ( B , v ) if there are sequences { λ n } in R , with λ n 0 + and { v n } in V, with v n v , such that
v + λ n v n B , n N ,
or, there exist sequences { t n } in R , with t n > 0 and { v n } in B, with v n v , such that
t n ( v n v ) v .
Let U, V be real normed spaces, 2 V be the set of all subsets of V, and Ω be a solid pointed convex cone in V. Let F : U 2 V be a set-valued map from U to V, i.e., F ( u ) V , for all u U . The domain, image, graph, and epigraph of F are defined by
dom ( F ) = { u U : F ( u ) } ,
F ( A ) = u A F ( u ) , for any A U ,
gr ( F ) = { ( u , v ) U × V : v F ( u ) } ,
and
epi ( F ) = { ( u , v ) U × V : v F ( u ) + Ω } .
Jahn and Rauh [20] introduced the notion of contingent epiderivative of set-valued maps. It plays a vital role in various aspects of set-valued optimization problems.
Definition 2 ([20]). 
A single-valued map D F ( u , v ) : U V whose epigraph coincides with the contingent cone to the epigraph of F at ( u , v ) , i.e.,
epi ( D F ( u , v ) ) = T ( epi ( F ) , ( u , v ) ) ,
is said to be the contingent epiderivative of F at ( u , v ) .
We now turn our attention to the notion of cone convexity of set-valued maps which was introduced by Borwein [21] in 1977.
Definition 3 ([21]). 
Let A be a nonempty convex subset of a real normed space U. A set-valued map F : U 2 V , with A dom ( F ) , is called Ω-convex on A if u 1 , u 2 A and λ [ 0 , 1 ] ,
λ F ( u 1 ) + ( 1 λ ) F ( u 2 ) F ( λ u 1 + ( 1 λ ) u 2 ) + Ω .
In 1976, Avriel [10] introduced the notion of arcwise connectedness of set-valued maps.
Definition 4.
A subset A of a real normed space U is said to be an arcwise connected set if for all u 1 , u 2 A there is a continuous arc H u 1 , u 2 ( λ ) defined on [ 0 , 1 ] with a value in A such that H u 1 , u 2 ( 0 ) = u 1 and H u 1 , u 2 ( 1 ) = u 2 .
Fu and Wang [11] and Lalitha et al. [12] introduced the notion of cone arcwise connectedness of set-valued maps. It is basically an extension of the class of cone convex set-valued maps.
Definition 5 ([11,12]). 
Let A be an arcwise connected subset of a real normed space U and F : U 2 V be a set-valued map, with A dom ( F ) . Then, F is said to be Ω-arcwise connected on A if
( 1 λ ) F ( u 1 ) + λ F ( u 2 ) F ( H u 1 , u 2 ( λ ) ) + Ω , u 1 , u 2 A and λ [ 0 , 1 ] .
Peng and Xu [16] introduced the notion of cone subarcwise connectedness of set-valued maps.
Definition 6 ([16]). 
Let A be an arcwise connected subset of a real normed space U, e int ( Ω ) , and F : U 2 V be a set-valued map, with A dom ( F ) . Then, F is said to be Ω-subarcwise connected on A if
( 1 λ ) F ( u 1 ) + λ F ( u 2 ) + ϵ e F ( H u 1 , u 2 ( λ ) ) + Ω , u 1 , u 2 A , ϵ > 0 , and λ [ 0 , 1 ] .

3. ρ -Cone Arcwise Connectedness

Das and Nahak [22,23,24,25] and Treanţă and Das [26] introduced the notion of ρ -cone convexity of set-valued maps. They establish the sufficient KKT optimality conditions of set-valued optimization problems under contingent epiderivative and ρ -cone convexity assumptions. They also construct various duality models and prove the associated duality theorems. For ρ = 0 , we get the usual notion of cone convexity of set-valued maps introduced by Borwein [21] in the year of 1977.
We introduce the notion of ρ -cone arcwise connectedness of set-valued maps as a generalization of cone arcwise connected set-valued maps.
Definition 7.
Let A be an arcwise connected subset of a real normed space U, e int ( Ω ) , and F : U 2 V be a set-valued map, with A dom ( F ) . Then, F is said to be ρ-Ω-arcwise connected on A with respect to e if there exists ρ R , such that
( 1 λ ) F ( u 1 ) + λ F ( u 2 ) F ( H u 1 , u 2 ( λ ) ) + ρ λ ( 1 λ ) u 1 u 2 2 e + Ω , u 1 , u 2 A and λ [ 0 , 1 ] .
Remark 1.
If ρ > 0 , then F is called strongly ρ-Ω-arcwise connected; if ρ = 0 , we have the notion of Ω-arcwise connectedness; and if ρ < 0 , then F is called weakly ρ-Ω-arcwise connected. Obviously, strongly ρ-Ω-arcwise connectedness ⇒Ω-arcwise connectedness weakly ρ-Ω-arcwise connectedness.
Further, we formulate an example of ρ -cone arcwise connected set-valued map, which is not cone arcwise connected.
Example 1.
Let U = R 2 , V = R , Ω = R + and
A = u = ( u 1 , u 2 ) | u 1 + u 2 1 2 , u 1 0 , u 2 0 U .
Define H u , s ( λ ) = ( 1 λ ) u + λ s , where u = ( u 1 , u 2 ) , s = ( s 1 , s 2 ) , and λ [ 0 , 1 ] . Clearly, A is an arcwise connected set. For the set-valued map F : U 2 V , defined as follows: F ( u ) = [ 0 , 2 ] , u 1 + u 2 1 2 , u 1 u 2 , and F ( u ) = [ 3 , 5 ] for { u 1 + u 2 < 1 2 } { u 1 + u 2 1 2 , u 1 = u 2 } , we find that F is not Ω-arcwise connected for u = ( 1 , 0 ) , s = ( 0 , 1 ) and λ = 1 2 . On the other hand, by considering ρ = 2 and e = [ 3 , 3 ] = { 3 } , we get that F is a ρ-Ω-arcwise connected set-valued map for u = ( 1 , 0 ) , s = ( 0 , 1 ) .
Theorem 1.
Let A be an arcwise connected subset of a real normed space U, e i n t ( Ω ) , and F : U 2 V be ρ-Ω-arcwise connected on A with respect to e. Let u A and v F ( u ) . Then,
F ( u ) v D F ( u , v ) ( H u , u ( 0 + ) ) + ρ u u 2 e + Ω , u A ,
where
H u , u ( 0 + ) = lim λ 0 + H u , u ( λ ) H u , u ( 0 ) λ ,
assuming that H u , u ( 0 + ) exists for all u , u A .
Proof. 
Let u A . As F is ρ - Ω -arcwise connected on A with respect to e, we have
( 1 λ ) F ( u ) + λ F ( u ) F ( H u , u ( λ ) ) + ρ λ ( 1 λ ) u u 2 e + Ω , λ [ 0 , 1 ] .
Let v F ( u ) . Consider a real sequence { λ n } , with λ n ( 0 , 1 ) , n N , such that λ n 0 + when n . Suppose
u n = H u , u ( λ n )
and
v n = ( 1 λ n ) v + λ n v ρ λ n ( 1 λ n ) u u 2 e .
Therefore,
v n F ( u n ) + Ω .
It is clear that
u n = H u , u ( λ n ) H u , u ( 0 ) = u , v n v , w h e n n ,
u n u λ n = H u , u ( λ n ) H u , u ( 0 ) λ n H u , u ( 0 + ) , w h e n n ,
and
v n v λ n = v v ρ ( 1 λ n ) u u 2 e v v ρ u u 2 e , w h e n n .
Therefore,
( H u , u ( 0 + ) , v v ρ u u 2 e ) T ( epi ( F ) , ( u , v ) ) = epi ( D F ( u , v ) ) .
Consequently,
v v ρ u u 2 e D F ( u , v ) ( H u , u ( 0 + ) ) + Ω ,
which is true, for all v F ( u ) . Hence,
F ( u ) v D F ( u , v ) ( H u , u ( 0 + ) ) + ρ u u 2 e + Ω , u A .
Hence, the theorem follows. □

4. Formulation of the Main Problem

Let U be a countably infinite subset of R p , A R n , and F = ( F 1 , F 2 , , F m ) : R n 2 R m , G : R n × U 2 R be two set-valued maps with
A dom ( F ) and A × U dom ( G ) .
Let B 1 , B 2 , , B m be n × n positive semi-definite symmetric real matrices. We consider a set-valued semi-infinite programming problem (SP).
minimize x A ( F 1 ( x ) + ( x T B 1 x ) 1 2 , F 2 ( x ) + ( x T B 2 x ) 1 2 , , F m ( x ) + ( x T B m x ) 1 2 ) subject to G ( x , u ) ( R + ) , u U .
We define the feasible set of the problem (SP) by
S = { x A : G ( x , u ) ( R + ) , u U } .
Definition 8.
A point ( x , y ) R n × R m , with x S and y = ( y 1 , y 2 , , y m ) F ( x ) , is said to be a minimizer of the problem (SP) if for all ( x , y ) R n × R m , with x S and y = ( y 1 , y 2 , , y m ) F ( x ) ,
( y 1 + ( x T B 1 x ) 1 2 , y 2 + ( x T B 2 x ) 1 2 , , y m + ( x T B m x ) 1 2 ) ( y 1 + ( x T B 1 x ) 1 2 , y 2 + ( x T B 2 x ) 1 2 , , y m + ( x T B m x ) 1 2 ) ( R + m ) { θ R m } .
Definition 9.
A point ( x , y ) R n × R m , with x S and y = ( y 1 , y 2 , y m ) F ( x ) , is said to be a weak minimizer of the problem (SP) if for all ( x , y ) R n × R m , with x S and y = ( y 1 , y 2 , , y m ) F ( x ) ,
( y 1 + ( x T B 1 x ) 1 2 , y 2 + ( x T B 2 x ) 1 2 , , y m + ( x T B m x ) 1 2 ) ( y 1 + ( x T B 1 x ) 1 2 , y 2 + ( x T B 2 x ) 1 2 , , y m + ( x T B m x ) 1 2 ) ( i n t ( R + m ) ) .
Let J be the index set, such that U = { u j : j J } . Let x A . We denote a set J ( x ) by
J ( x ) = { j J : 0 G ( x , u j ) } .
We assume that J ( x ) .
For special case, when f = ( f 1 , f 2 , , f m ) : R n R m and g : R n × U R are single-valued maps, we can have multiobjective semi-infinite programming problem ([9]) as
minimize x A ( f 1 ( x ) + ( x T B 1 x ) 1 2 , f 2 ( x ) + ( x T B 2 x ) 1 2 , , f m ( x ) + ( x T B m x ) 1 2 ) subject to g ( x , u ) ( R + ) , u U ,
by considering F i ( x ) = { f i ( x ) } , i = 1 , 2 , , m , and G ( x , u ) = { g ( x , u ) } in the problem (SP).

5. Optimality Conditions

Let x ¯ i R n , i = 1 , 2 , , m . Define maps . T B i x ¯ i : R n R , i = 1 , 2 , , m , by
( . T B i x ¯ i ) ( x ) = x T B i x ¯ i , x R n .
The gradient vector of . T B i x ¯ i , denoted by ( . T B i x ¯ i ) , is given by
( . T B i x ¯ i ) = B i x ¯ i .
Let x A and j J ( x ) . Define a set-valued map G ( . , u j ) : R n 2 R by
G ( . , u j ) ( x ) = G ( x , u j ) , x dom ( G ) .
We establish the sufficient KKT optimality conditions of the set-valued semi-infinite programming problem (SP) under ρ -cone arcwise connectedness assumption.
Theorem 2 (Sufficient optimality conditions). 
Let A be an arcwise connected subset of R n , x S , and y = ( y 1 , y 2 , , y m ) F ( x ) . Let x ¯ i R n , i = 1 , 2 , , m and z = ( z j ) j J , with z j G ( x , u j ) ( R + ) . Let ρ i , ρ i , ρ j R , for i = 1 , 2 , , m and j J ( x ) . Suppose that F i , . T B i x ¯ i , i = 1 , 2 , , m , and G ( . , u j ) , j J ( x ) , are ρ i - R + -arcwise connected, ρ i - R + -arcwise connected, and ρ j - R + -arcwise connected set-valued maps, respectively, on A with respect to 1. Further, we suppose that the contingent epiderivatives D F i ( x , y i ) and D G ( . , u j ) ( x , z j ) exist. If there exist y i * > 0 , i = 1 , 2 , , m , and z j * 0 , j J ( x ) , with z j * 0 , for finitely many j, and
i = 1 m y i * ( ρ i + ρ i ) + j J ( x ) z j * ρ j 0 ,
satisfying the following conditions
i = 1 m y i * ( D F i ( x , y i ) + ( B i x ¯ i ) T ) + j J ( x ) z j * D G ( . , u j ) ( x , z j ) ( H x , x ( 0 + ) ) 0 , x A ,
z j * z j = 0 , j J ( x ) ,
x ¯ i T B i x ¯ i 1 , i = 1 , 2 , , m ,
and
( x T B i x ) 1 2 = x T B i x ¯ i , i = 1 , 2 , , m .
Then, ( x , y ) is a weak minimizer of (SP).
Proof. 
Let ( x , y ) be not a weak minimizer of (SP). Then there exist x S and y = ( y 1 , , y m ) F ( x ) , such that
( y 1 + ( x T B 1 x ) 1 2 , y 2 + ( x T B 2 x ) 1 2 , , y m + ( x T B m x ) 1 2 ) < ( y 1 + ( x T B 1 x ) 1 2 , y 2 + ( x T B 2 x ) 1 2 , , y m + ( x T B m x ) 1 2 ) .
As y * R + m \ { θ R m } , we have
i = 1 m y i * ( y i + ( x T B i x ) 1 2 ) < i = 1 m y i * ( y i + ( x T B i x ) 1 2 ) .
Since F i , i = 1 , 2 , , m , is ρ i - R + -arcwise connected on A with respect to 1 and ( x , y i ) gr ( F i ) , we have
F i ( x ) y i ρ i x x 2 D F i ( x , y i ) ( H x , x ( 0 + ) ) + R + .
Hence,
y i y i ρ i x x 2 D F i ( x , y i ) ( H x , x ( 0 + ) ) + R + .
Therefore,
y i * ( y i y i ) ρ i x x 2 y i * y i * D F i ( x , y i ) ( H x , x ( 0 + ) ) .
Again, as . T B i x ¯ i , i = 1 , 2 , , m and G ( . , u j ) , j J ( x ) , are ρ i - R + -arcwise connected and ρ j - R + -arcwise connected, respectively, on A, with respect to 1, we have
x T B i x ¯ i x T B i x ¯ i ρ i x x 2 ( B i x ¯ i ) T ( H x , x ( 0 + ) )
and
G ( x , u j ) z j ρ j x x 2 D G ( . , u j ) ( x , z j ) ( H x , x ( 0 + ) ) + R + .
As x S , there exists z j G ( x , u j ) ( R + ) , j J ( x ) . So, we have
z j z j ρ j x x 2 D G ( . , u j ) ( x , z j ) ( H x , x ( 0 + ) ) + R + .
Therefore,
y i * ( x T B i x ¯ i x T B i x ¯ i ) ρ i x x 2 y i * y i * ( B i x ¯ i ) T ( H x , x ( 0 + ) )
and
z j * ( z j z j ) ρ j x x 2 z j * z j * D G ( . , u j ) ( x , z j ) ( H x , x ( 0 + ) ) .
From (7)–(9), we have
i = 1 m y i * ( y i y i + x T B i x ¯ i x T B i x ¯ i ) + j J ( x ) z j * ( z j z j ) x x 2 i = 1 m y i * ( ρ i + ρ i ) x x 2 j J ( x ) z j * ρ j i = 1 m y i * ( D F i ( x , y i ) + ( B i x ¯ i ) T ) + j J ( x ) z j * D G ( . , u j ) ( x , z j ) ( H x , x ( 0 + ) ) 0 .
From (1), we have
i = 1 m y i * ( y i y i + x T B i x ¯ i x T B i x ¯ i ) + j J ( x ) z j * ( z j z j ) x x 2 i = 1 m y i * ( ρ i + ρ i ) + j J ( x ) z j * ρ j 0 .
As z j * z j = 0 and z j ( R + ) , j J ( x ) , we have
j J ( x ) z j * ( z j z j ) 0 .
Hence,
i = 1 m y i * ( y i y i + x T B i x ¯ i x T B i x ¯ i ) 0 .
Using the generalized Schwarz inequality, we have
( x T B i x ) 1 2 ( x ¯ i T B i x ¯ i ) 1 2 x T B i x ¯ i .
Again, from (5), we have
( x T B i x ) 1 2 = x T B i x ¯ i , i = 1 , 2 , , m .
Therefore,
i = 1 m y i * ( y i y i + ( x T B i x ) 1 2 ( x ¯ i T B i x ¯ i ) 1 2 ( x T B i x ) 1 2 ) 0 .
From (4), we have x ¯ i T B i x ¯ i 1 , i = 1 , 2 , , m . So, we have
( x T B i x ) 1 2 ( x T B i x ) 1 2 ( x ¯ i T B i x ¯ i ) 1 2 .
Hence,
i = 1 m y i * ( y i + ( x T B i x ) 1 2 ) i = 1 m y i * ( y i + ( x T B i x ) 1 2 ) ,
which contradicts (6). Hence, ( x , y ) is a weak minimizer of (SP). □

6. Mond–Weir Type Dual

We consider the Mond–Weir type dual (MWD) of the problem (SP), where F i and G ( . , u j ) are contingent epiderivable set-valued maps:
maximize ( y 1 + ( x T B 1 x ¯ 1 ) , y 2 + ( x T B 2 x ¯ 2 ) , , y m + ( x T B m x ¯ m ) ) subject to i = 1 m y i * ( D F i ( x , y i ) + ( B i x ¯ i ) T ) + j J ( x ) z j * D G ( . , u j ) ( x , z j ) ( H x , x ( 0 + ) ) 0 , x A , j J ( x ) z j * z j 0 , x ¯ i T B i x ¯ i 1 , x ¯ i R n , i = 1 , 2 , , m , x A , y = ( y 1 , y 2 , , y m ) F ( x ) , z = ( z j ) j J , z j G ( x , u j ) , j J , y i * > 0 , i = 1 , 2 , , m , i = 1 m y i * = 1 , z * = ( z j * ) j J , z j * 0 , j J , and z j * 0 , for finitely many j J .
Definition 10.
A feasible point ( x , y , x ¯ 1 , x ¯ 2 , , x ¯ m , z , y * , z * ) of (MWD) is said to be a weak maximizer of (MWD) if for all feasible points ( x , y , x ^ 1 , x ^ 2 , , x ^ m , z , y 1 * , z 1 * ) of (MWD),
( y 1 + ( x T B 1 x ¯ 1 ) , y 2 + ( x T B 2 x ¯ 2 ) , , y m + ( x T B m x ¯ m ) ) ( y 1 + ( x T B 1 x ^ 1 ) , y 2 + ( x T B 2 x ^ 2 ) , , y m + ( x T B m x ^ m ) ) ,
where y = ( y 1 , y 2 , , y m ) , y = ( y 1 , y 2 , , y m ) R m .
Theorem 3 (Weak duality). 
Let A be an arcwise connected subset of R n and x 0 be an element of the feasible set S of (SP). Let ( x , y , x ¯ 1 , x ¯ 2 , , x ¯ m , z , y * , z * ) be a feasible solution of (MWD). Let ρ i , ρ i , ρ j R , for i = 1 , 2 , , m and j J ( x ) . Suppose that F i , . T B i x ¯ i , i = 1 , 2 , , m , and G ( . , u j ) , j J ( x ) , are ρ i - R + -arcwise connected, ρ i - R + -arcwise connected, and ρ j - R + -arcwise connected set-valued maps, respectively, on A, with respect to 1, satisfying (5 1). Further, we suppose that the contingent epiderivatives D F i ( x , y i ) and D G ( . , u j ) ( x , z j ) exist. Then,
( F 1 ( x 0 ) + ( x 0 T B 1 x 0 ) 1 2 , F 2 ( x 0 ) + ( x 0 T B 2 x 0 ) 1 2 , , F m ( x 0 ) + ( x 0 T B m x 0 ) 1 2 ) ( y 1 + ( x T B 1 x ¯ 1 ) , y 2 + ( x T B 2 x ¯ 2 ) , , y m + ( x T B m x ¯ m ) ) R m ( i n t ( R + m ) ) .
Proof. 
Assume that there is point y i F i ( x 0 ) , i = 1 , 2 , , m , such that
( y 1 + ( x 0 T B 1 x 0 ) 1 2 , y 2 + ( x 0 T B 2 x 0 ) 1 2 , , y m + ( x 0 T B m x 0 ) 1 2 ) ( y 1 + ( x T B 1 x ¯ 1 ) , y 2 + ( x T B 2 x ¯ 2 ) , , y m + ( x T B m x ¯ m ) ) ( i n t ( R + m ) ) .
As y * \ R + m { θ R m } , we have
i = 1 m y i * ( y i + ( x 0 T B i x 0 ) 1 2 ) < i = 1 m y i * ( y i + ( x T B i x ¯ i ) ) .
As F i , i = 1 , 2 , , m , is ρ i - R + -arcwise connected on A with respect to 1 and ( x , y i ) gr ( F i ) , we have
F i ( x 0 ) y i ρ i x 0 x 2 D F i ( x , y i ) ( H x , x 0 ( 0 + ) ) + R + .
Hence,
y i y i ρ i x 0 x 2 D F i ( x , y i ) ( H x , x 0 ( 0 + ) ) + R + .
Therefore,
y i * ( y i y i ) ρ i x 0 x 2 y i * y i * D F i ( x , y i ) ( H x , x 0 ( 0 + ) ) .
As . T B i x ¯ i , i = 1 , 2 , , m , is ρ i - R + -arcwise connected on A with respect to 1, we have
x 0 T B i x ¯ i x T B i x ¯ i ρ i x 0 x 2 ( B i x ¯ i ) T ( H x , x 0 ( 0 + ) ) .
Therefore,
y i * ( x 0 T B i x ¯ i x T B i x ¯ i ) ρ i x 0 x 2 y i * y i * ( B i x ¯ i ) T ( H x , x 0 ( 0 + ) ) .
Again, as G ( . , u j ) , j J ( x ) , is ρ j - R + -arcwise connected on A with respect to 1 and z j G ( x , u j ) , j J ( x ) , we have
G ( x 0 , u j ) z j ρ j x 0 x 2 D G ( . , u j ) ( x , z j ) ( H x , x 0 ( 0 + ) ) + R + .
As x 0 S , there exists z j G ( x 0 , u j ) ( R + ) , j J ( x ) , we have
z j z j ρ j x 0 x 2 D G ( . , u j ) ( x , z j ) ( H x , x 0 ( 0 + ) ) + R + .
Hence,
z j * ( z j z j ) ρ j x 0 x 2 z j * z j * D G ( . , u j ) ( x , z j ) ( H x , x 0 ( 0 + ) ) .
From (11)–(13), we have
i = 1 m y i * ( y i y i + x 0 T B i x ¯ i x T B i x ¯ i ) + j J ( x ) z j * ( z j z j ) x 0 x 2 i = 1 m y i * ( ρ i + ρ i ) x 0 x 2 j J ( x ) z j * ρ j i = 1 m y i * ( D F i ( x , y i ) + ( B i x ¯ i ) T ) + j J ( x ) z j * D G ( . , u j ) ( x , z j ) ( H x , x 0 ( 0 + ) ) 0 .
From (1), we have
i = 1 m y i * ( y i y i + x 0 T B i x ¯ i x T B i x ¯ i ) + j J ( x ) z j * ( z j z j ) x 0 x 2 i = 1 m y i * ( ρ i + ρ i ) + j J ( x ) z j * ρ j 0 .
As j J ( x ) z j * z j 0 , z j * 0 , and z j ( R + ) , j J ( x ) , we have
j J ( x ) z j * ( z j z j ) 0 .
Hence,
i = 1 m y i * ( y i y i + x 0 T B i x ¯ i x T B i x ¯ i ) 0 .
Using the generalized Schwarz inequality, we have
( x 0 T B i x 0 ) 1 2 ( x ¯ i T B i x ¯ i ) 1 2 x 0 T B i x ¯ i .
Again, from the constraints of (MWD), we have
x ¯ i T B i x ¯ i 1 , i = 1 , 2 , , m .
Hence, ( x 0 T B i x 0 ) 1 2 x 0 T B i x ¯ i . It shows that
i = 1 m y i * ( y i + ( x 0 T B i x 0 ) 1 2 ) i = 1 m y i * ( y i + ( x T B i x ¯ i ) ) ,
which contradicts (10). Therefore,
( y 1 + ( x 0 T B 1 x 0 ) 1 2 , y 2 + ( x 0 T B 2 x 0 ) 1 2 , , y m + ( x 0 T B m x 0 ) 1 2 ) ( y 1 + ( x T B 1 x ¯ 1 ) , y 2 + ( x T B 2 x ¯ 2 ) , , y m + ( x T B m x ¯ m ) ) ( i n t ( R + m ) ) .
Hence,
( F 1 ( x 0 ) + ( x 0 T B 1 x 0 ) 1 2 , F 2 ( x 0 ) + ( x 0 T B 2 x 0 ) 1 2 , , F m ( x 0 ) + ( x 0 T B m x 0 ) 1 2 ) ( y 1 + ( x T B 1 x ¯ 1 ) , y 2 + ( x T B 2 x ¯ 2 ) , , y m + ( x T B m x ¯ m ) ) R m \ ( i n t ( R + m ) ) .
It completes the proof of the theorem. □
Theorem 4 (Strong duality). 
Suppose that ( x , y ) is a weak minimizer of (SP), z = ( z j ) j J , z j G ( x , u j ) ( R + ) , j J , and x ¯ i R n , i = 1 , 2 , , m . Suppose that, for some y i * > 0 , i = 1 , 2 , , m , with i = 1 m y i * = 1 and z j * 0 , with z j * 0 for finitely many j J and z j * = 0 , j J \ J ( x ) . Equations (5.2)–(5.5) are satisfied at the point ( x , y , x ¯ 1 , x ¯ 2 , , x ¯ m , z , y * , z * ) . Then, ( x , y , x ¯ 1 , x ¯ 2 , , x ¯ m , z , y * , z * ) is a feasible solution of (MWD). If the Theorem 6.1 holds between the problems (SP) and (MWD), then ( x , y , x ¯ 1 , x ¯ 2 , , x ¯ m , z , y * , z * ) is a weak maximizer of (MWD).
Proof. 
As (2)–(5) are satisfied at the point ( x , y , x ¯ 1 , , x ¯ m , z , y * , z * ) , we have
i = 1 m y i * ( D F i ( x , y i ) + ( B i x ¯ i ) T ) + j J ( x ) z j * D G ( . , u j ) ( x , z j ) ( ( H x , x ( 0 + ) ) ) 0 , x A ,
z j * z j = 0 , j J ( x ) ,
x ¯ i T B i x ¯ i 1 , i = 1 , 2 , , m ,
and
( x T B i x ) 1 2 = x T B i x ¯ i , i = 1 , 2 , , m .
Hence, ( x , y , x ¯ 1 , x ¯ 2 , , x ¯ m , z , y * , z * ) is a feasible solution of (MWD). Assume that the weak duality Theorem 3 holds between the problems (SP) and (MWD). Let ( x , y , x ¯ 1 , x ¯ 2 , , x ¯ m , z , y * , z * ) be not a weak maximizer of (MWD). Then, there exists a feasible solution ( x , y , x ^ 1 , x ^ 2 , , x ^ m , z , y 1 * , z 1 * ) of (MWD), such that
( y 1 + ( x T B 1 x ¯ 1 ) , y 2 + ( x T B 2 x ¯ 2 ) , , y m + ( x T B m x ¯ m ) ) ( y 1 + ( x T B 1 x ^ 1 ) , y 2 + ( x T B 2 x ^ 2 ) , , y m + ( x T B m x ^ m ) ) ( int ( R + m ) ) .
where y = ( y 1 , , y m ) R m . As ( x T B i x ) 1 2 = x T B i x ¯ i , i = 1 , 2 , , m , we have
( y 1 + ( x T B 1 x ) 1 2 , y 2 + ( x T B 2 x ) 1 2 , , y m + ( x T B m x ) 1 2 ) ( y 1 + ( x T B 1 x ^ 1 ) , y 2 + ( x T B 2 x ^ 2 ) , , y m + ( x T B m x ^ m ) ) ( int ( R + m ) ) ,
which contradicts the Theorem 3 between (SP) and (MWD). Hence, ( x , y , x ¯ 1 , , x ¯ m , z , y * , z * ) is a weak maximizer of (MWD). □
Theorem 5 (Converse duality). 
Let A be an arcwise connected subset of R n . Suppose that ( x , y , x ¯ 1 , x ¯ 2 , , x ¯ m , z , y * , z * ) is a feasible solution of (MWD), with
( x T B i x ) 1 2 = x T B i x ¯ i , i = 1 , 2 , , m .
Let ρ i , ρ i , ρ j R , for i = 1 , 2 , , m and j J ( x ) . Suppose that F i , . T B i x ¯ i , i = 1 , 2 , , m , and G ( . , u j ) , j J ( x ) , are ρ i - R + -arcwise connected, ρ i - R + -arcwise connected, and ρ j - R + -arcwise connected set-valued maps, respectively, on A, with respect to 1, satisfying (1). We suppose that the contingent epiderivatives D F i ( x , y i ) and D G ( . , u j ) ( x , z j ) exist. If x S , then ( x , y ) is a weak minimizer of (SP).
Proof. 
Let ( x , y ) be not a weak minimizer of (SP). Then, x S and y = ( y 1 , y 2 , , y m ) F ( x ) exist, such that
( y 1 + ( x T B 1 x ) 1 2 , y 2 + ( x T B 2 x ) 1 2 , , y m + ( x T B m x ) 1 2 ) ( y 1 + ( x T B 1 x ) 1 2 , y 2 + ( x T B 2 x ) 1 2 , , y m + ( x T B m x ) 1 2 ) ( int ( R + m ) ) .
As y * R + m \ { θ R m } , we have
i = 1 m y i * ( y i + ( x T B i x ) 1 2 ) < i = 1 m y i * ( y i + ( x T B i x ) 1 2 ) .
Since F i , i = 1 , 2 , , m , is ρ i - R + -arcwise connected on A with respect to 1 and ( x , y i ) gr ( F i ) , we have
F i ( x ) y i ρ i x x 2 D F i ( x , y i ) ( H x , x ( 0 + ) ) + R + .
Hence,
y i y i ρ i x x 2 D F i ( x , y i ) ( H x , x ( 0 + ) ) + R + .
Therefore,
y i * ( y i y i ) ρ i x x 2 y i * y i * D F i ( x , y i ) ( H x , x ( 0 + ) ) .
Again, as . T B i x ¯ i , i = 1 , 2 , , m , and G ( . , u j ) , j J ( x ) , are ρ i - R + -arcwise connected and ρ j - R + -arcwise connected, respectively, on A, with respect to 1, we have
x T B i x ¯ i x T B i x ¯ i ρ i x x 2 ( B i x ¯ i ) T ( H x , x ( 0 + ) )
and
G ( x , u j ) z j ρ j x x 2 D G ( . , u j ) ( x , z j ) ( H x , x ( 0 + ) ) + R + .
As x S , there exists z j G ( x , u j ) ( R + ) , j J ( x ) . So,
z j z j ρ j x x 2 D G ( . , u j ) ( x , z j ) ( H x , x ( 0 + ) ) + R + .
Therefore,
y i * ( x T B i x ¯ i x T B i x ¯ i ) ρ i x x 2 y i * y i * ( B i x ¯ i ) T ( H x , x ( 0 + ) )
and
z j * ( z j z j ) ρ j x x 2 z j * z j * D G ( . , u j ) ( x , z j ) ( H x , x ( 0 + ) ) .
From (15)–(17), we have
i = 1 m y i * ( y i y i + x T B i x ¯ i x T B i x ¯ i ) + j J ( x ) z j * ( z j z j ) x x 2 i = 1 m y i * ( ρ i + ρ i ) x x 2 j J ( x ) z j * ρ j i = 1 m y i * ( D F i ( x , y i ) + ( B i x ¯ i ) T ) + j J ( x ) z j * D G ( . , u j ) ( x , z j ) ( H x , x ( 0 + ) ) 0 .
By (1), we have
i = 1 m y i * ( y i y i + x T B i x ¯ i x T B i x ¯ i ) + j J ( x ) z j * ( z j z j ) x x 2 i = 1 m y i * ( ρ i + ρ i ) + j J ( x ) z j * ρ j 0 .
As j J ( x ) z j * z j 0 , z j * 0 , and z j ( R + ) , j J ( x ) , we have
j J ( x ) z j * ( z j z j ) 0 .
Hence,
i = 1 m y i * ( y i y i + x T B i x ¯ i x T B i x ¯ i ) 0 .
From the generalized Schwarz inequality, we have
( x T B i x ) 1 2 ( x ¯ i T B i x ¯ i ) 1 2 x T B i x ¯ i .
Again, by assumption, we have
( x T B i x ) 1 2 = x T B i x ¯ i , i = 1 , 2 , , m .
Therefore,
i = 1 m y i * ( y i y i + ( x T B i x ) 1 2 ( x ¯ i T B i x ¯ i ) 1 2 ( x T B i x ) 1 2 ) 0 .
As x ¯ i T B i x ¯ i 1 , i = 1 , 2 , , m , (from the constraints of (MWD)), we have
( x T B i x ) 1 2 ( x T B i x ) 1 2 ( x ¯ i T B i x ¯ i ) 1 2 .
Hence,
i = 1 m y i * ( y i + ( x T B i x ) 1 2 ) i = 1 m y i * ( y i + ( x T B i x ) 1 2 ) ,
which contradicts (14). So, ( x , y ) is a weak minimizer of (SP). □

7. Wolfe Type Dual

We consider the Wolfe type dual (WD) of the problem (SP), where F i and G ( . , u j ) are contingent epiderivable set-valued maps:
maximize ( y 1 + ( x T B 1 x ¯ 1 ) , y 2 + ( x T B 2 x ¯ 2 ) , , y m + ( x T B m x ¯ m ) ) + j J ( x ) z j * z j 1 R m subject to i = 1 m y i * ( D F i ( x , y i ) + ( B i x ¯ i ) T ) + j J ( x ) z j * D G ( . , u j ) ( x , z j ) ( H x , x ( 0 + ) ) 0 , x A , x ¯ i T B i x ¯ i 1 , x ¯ i R n , i = 1 , 2 , , m , x A , y = ( y 1 , y 2 , , y m ) F ( x ) , z = ( z j ) j J ( x ) , z j G ( x , u j ) , j J , y i * > 0 , i = 1 , 2 , , m , i = 1 m y i * = 1 , a n d z * = ( z j * ) j J , z j * 0 , j J , and z j * 0 , for finitely many j J .
Definition 11.
A feasible point ( x , y , x ¯ 1 , x ¯ 2 , , x ¯ m , z , y * , z * ) of (WD) is said to be a weak maximizer of (WD) if for all feasible points ( x , y , x ^ 1 , x ^ 2 , , x ^ m , z , y 1 * , z 1 * ) of (WD),
( y 1 + ( x T B 1 x ¯ 1 ) , y 2 + ( x T B 2 x ¯ 2 ) , , y m + ( x T B m x ¯ m ) ) + j J ( x ) z j * z j 1 R m ( y 1 + ( x T B 1 x ^ 1 ) , y 2 + ( x T B 2 x ^ 2 ) , , y m + ( x T B m x ^ m ) ) + j J ( x ) z j * z j 1 R m ,
where y = ( y 1 , y 2 , , y m ) , y = ( y 1 , y 2 , , y m ) R m .
We can prove the duality theorems of Wolfe type associated with the problem (SP). The proofs are very similar to Theorems 3–5, and hence we omit it.
Theorem 6 (Weak duality). 
Let A be an arcwise connected subset of R n and x 0 S . Let ( x , y , x ¯ 1 , x ¯ 2 , , x ¯ m , z , y * , z * ) be a feasible solution of (WD). Let ρ i , ρ i , ρ j R , for i = 1 , 2 , , m and j J ( x ) . Suppose that F i , . T B i x ¯ i , i = 1 , 2 , , m , and G ( . , u j ) , j J ( x ) , are ρ i - R + -arcwise connected, ρ i - R + -arcwise connected, and ρ j - R + -arcwise connected set-valued maps, respectively, on A, with respect to 1, satisfying (1). Suppose that the contingent epiderivatives D F i ( x , y i ) and D G ( . , u j ) ( x , z j ) exist. Then,
( F 1 ( x 0 ) + ( x 0 T B 1 x 0 ) 1 2 , F 2 ( x 0 ) + ( x 0 T B 2 x 0 ) 1 2 , , F m ( x 0 ) + ( x 0 T B m x 0 ) 1 2 ) ( y 1 + ( x T B 1 x ¯ 1 ) , y 2 + ( x T B 2 x ¯ 2 ) , , y m + ( x T B m x ¯ m ) ) + j J ( x ) z j * z j 1 R m .
Theorem 7 (Strong duality). 
Suppose that ( x , y ) is a weak minimizer of (SP), z = ( z j ) j J , z j G ( x , u j ) ( R + ) , j J , and x ¯ i R n , i = 1 , 2 , , m . Suppose that for some y i * > 0 , i = 1 , 2 , , m , with i = 1 m y i * = 1 and z j * 0 , with z j * 0 for finitely many j J and z j * = 0 , j J \ J ( x ) , Equations (2)–(5) are satisfied at the point ( x , y , x ¯ 1 , x ¯ 2 , , x ¯ m , z , y * , z * ) . Then, ( x , y , x ¯ 1 , , x ¯ m , z , y * , z * ) is a feasible solution of (WD). If the Theorem 6 holds between the problems (SP) and (WD), then ( x , y , x ¯ 1 , x ¯ 2 , , x ¯ m , z , y * , z * ) is a weak maximizer of (WD).
Theorem 8 (Converse duality). 
Let A be an arcwise connected subset of R n . Suppose that ( x , y , x ¯ 1 , x ¯ 2 , , x ¯ m , z , y * , z * ) is a feasible solution of (WD), with
( x T B i x ) 1 2 = x T B i x ¯ i , i = 1 , 2 , , m
and
j J ( x ) z j * z j 0 .
Let ρ i , ρ i , ρ j R , for i = 1 , 2 , , m and j J ( x ) . Suppose that F i , . T B i x ¯ i , i = 1 , 2 , , m , and G ( . , u j ) , j J ( x ) , are ρ i - R + -arcwise connected, ρ i - R + -arcwise connected, and ρ j - R + -arcwise connected set-valued maps, respectively, on A, with respect to 1, satisfying (1). We suppose that the contingent epiderivatives D F i ( x , y i ) and D G ( . , u j ) ( x , z j ) exist. If x S , then ( x , y ) is a weak minimizer of (SP).

8. Mixed Type Dual

We consider the mixed type dual (MD) of the problem (SP), where F i and G ( . , u j ) are contingent epiderivable set-valued maps:
maximize ( y 1 + ( x T B 1 x ¯ 1 ) , y 2 + ( x T B 2 x ¯ 2 ) , , y m + ( x T B m x ¯ m ) ) + j J ( x ) z j * z j 1 R m subject to i = 1 m y i * ( D F i ( x , y i ) + ( B i x ¯ i ) T ) + j J ( x ) z j * D G ( . , u j ) ( x , z j ) ( H x , x ( 0 + ) ) 0 , x A , z j * z j 0 , j J ( x ) , x ¯ i T B i x ¯ i 1 , x ¯ i R n , i = 1 , 2 , , m , x A , y = ( y 1 , y 2 , , y m ) F ( x ) , z = ( z j ) j J , z j G ( x , u j ) , j J , y i * > 0 , i = 1 , 2 , , m , i = 1 m y i * = 1 , and z * = ( z j * ) j J , z j * 0 , j J , and z j * 0 , for finitely many j J .
Definition 12.
A feasible point ( x , y , x ¯ 1 , x ¯ 2 , , x ¯ m , z , y * , z * ) of (MD) is said to be a weak maximizer of (MD) if for all feasible points ( x , y , x ^ 1 , x ^ 2 , , x ^ m , z , y 1 * , z 1 * ) of (MD),
( y 1 + ( x T B 1 x ¯ 1 ) , y 2 + ( x T B 2 x ¯ 2 ) , , y m + ( x T B m x ¯ m ) ) + j J ( x ) z j * z j 1 R m ( y 1 + ( x T B 1 x ^ 1 ) , y 2 + ( x T B 2 x ^ 2 ) , , y m + ( x T B m x ^ m ) ) + j J ( x ) z j * z j 1 R m ,
where y = ( y 1 , y 2 , , y m ) , y = ( y 1 , y 2 , , y m ) R m .
We develop the duality results of mixed type of the problem (SP). The proofs are very similar to Theorems 3–5, and hence we omit it.
Theorem 9 (Weak duality). 
Let A be an arcwise connected subset of R n and x 0 S . Let ( x , y , x ¯ 1 , x ¯ 2 , , x ¯ m , z , y * , z * ) be a feasible solution of (MD). Let ρ i , ρ i , ρ j R , for i = 1 , 2 , , m and j J ( x ) . Suppose that F i , . T B i x ¯ i , i = 1 , 2 , , m , and G ( . , u j ) , j J ( x ) , are ρ i - R + -arcwise connected, ρ i - R + -arcwise connected, and ρ j - R + -arcwise connected set-valued maps, respectively, on A, with respect to 1, satisfying (1). Let the contingent epiderivatives D F i ( x , y i ) and D G ( . , u j ) ( x , z j ) exist. Then,
( F 1 ( x 0 ) + ( x 0 T B 1 x 0 ) 1 2 , F 2 ( x 0 ) + ( x 0 T B 2 x 0 ) 1 2 , , F m ( x 0 ) + ( x 0 T B m x 0 ) 1 2 ) ( y 1 + ( x T B 1 x ¯ 1 ) , y 2 + ( x T B 2 x ¯ 2 ) , , y m + ( x T B m x ¯ m ) ) + j J ( x ) z j * z j 1 R m .
Theorem 10 (Strong duality). 
Suppose that ( x , y ) is a weak minimizer of (SP), z = ( z j ) j J , z j G ( x , u j ) ( R + ) , j J , and x ¯ i R n , i = 1 , 2 , , m . Suppose that for some y i * > 0 , i = 1 , 2 , , m , with i = 1 m y i * = 1 and z j * 0 , with z j * 0 for finitely many j J and z j * = 0 , j J \ J ( x ) . Equations (2)–(5) are satisfied at the point ( x , y , x ¯ 1 , x ¯ 2 , , x ¯ m , z , y * , z * ) . Then, ( x , y , x ¯ 1 , x ¯ 2 , , x ¯ m , z , y * , z * ) is a feasible solution of (MD). If the Theorem 9 holds between the problems (SP) and (MD), then
( x , y , x ¯ 1 , x ¯ 2 , , x ¯ m , z , y * , z * )
is a weak maximizer of (MD).
Theorem 11 (Converse duality). 
Let A be an arcwise connected subset of R n . Suppose that ( x , y , x ¯ 1 , x ¯ 2 , , x ¯ m , z , y * , z * ) is a feasible solution of (MD), with ( x T B i x ) 1 2 = x T B i x ¯ i , i = 1 , 2 , , m . Let ρ i , ρ i , ρ j R , for i = 1 , 2 , , m and j J ( x ) . Suppose that F i , . T B i x ¯ i , i = 1 , 2 , , m , and G ( . , u j ) , j J ( x ) , are ρ i - R + -arcwise connected, ρ i - R + -arcwise connected, and ρ j - R + -arcwise connected set-valued maps, respectively, on A, with respect to 1, satisfying (1). We suppose that the contingent epiderivatives D F i ( x , y i ) and D G ( . , u j ) ( x , z j ) exist. If x S , then ( x , y ) is a weak minimizer of (SP).

9. Conclusions

In this paper, we have established the sufficient KKT optimality conditions of a set-valued semi-infinite programming problem (SP) under ρ -cone arcwise connectedness assumptions. We studied the duality theorems of Mond–Weir, Wolfe, and mixed types associated with the problem (SP).

Author Contributions

Conceptualization, K.D.; methodology, K.D. and S.T.; validation, K.D. and S.T. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

The authors would like to thank anonymous referees for their careful reading.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Hanson, M.A. On sufficiency of the Kuhn-Tucker conditions. J. Math. Anal. Appl. 1981, 80, 545–550. [Google Scholar] [CrossRef] [Green Version]
  2. Craven, B.D. Invex functions and constrained local minima. Bull. Austral. Math. Soc. 1981, 24, 357–366. [Google Scholar] [CrossRef] [Green Version]
  3. Corley, H.W. Existence and Lagrangian duality for maximizations of set-valued functions. J. Optim. Theory Appl. 1987, 54, 489–501. [Google Scholar] [CrossRef]
  4. Zalmai, G.J. Generalized sufficiency criteria in continuous-time programming with application to a class of variational-type inequalities. J. Math. Anal. Appl. 1990, 153, 331–355. [Google Scholar] [CrossRef] [Green Version]
  5. Goberna, M.A.; Lopez, M.A. Linear semi-infinite programming theory: An updated survey. Eur. J. Oper. Res. 2002, 143, 390–405. [Google Scholar] [CrossRef]
  6. Shapiro, A. Semi-infinite programming, duality, discretization and optimality condition. Optimization 2009, 58, 133–161. [Google Scholar] [CrossRef]
  7. Shapiro, A. On duality theory of convex semi-infinite programming. Optimization 2005, 54, 535–543. [Google Scholar] [CrossRef] [Green Version]
  8. Kostyukova, O.I.; Tchemisova, T.V. Sufficient optimality conditions for convex semi-infinite programming. Optim. Methods Softw. 2010, 25, 279–297. [Google Scholar] [CrossRef]
  9. Mishra, S.K.; Jaiswal, M. Optimality conditions and duality for nondifferentiable multiobjective semi-infinite programming. Vietnam J. Math. 2012, 40, 331–343. [Google Scholar]
  10. Avriel, M. Nonlinear Programming: Theory and Method; Prentice-Hall: Englewood Cliffs, NJ, USA, 1976. [Google Scholar]
  11. Fu, J.; Wang, Y. Arcwise connected cone-convex functions and mathematical programming. J. Optim. Theory Appl. 2003, 118, 339–352. [Google Scholar] [CrossRef]
  12. Lalitha, C.; Dutta, J.; Govil, M.G. Optimality criteria in set-valued optimization. J. Aust. Math. Soc. 2003, 75, 221–232. [Google Scholar] [CrossRef] [Green Version]
  13. Yu, G. Optimality of global proper efficiency for cone-arcwise connected set-valued optimization using contingent epiderivative. Asia-Pac. J. Oper. Res. 2013, 30, 1340004. [Google Scholar] [CrossRef]
  14. Yihong, X.; Min, L. Optimality conditions for weakly efficient elements of set-valued optimization with α-order near cone-arcwise connectedness. J. Syst. Sci. Math. Sci. 2016, 36, 1721. [Google Scholar]
  15. Yu, G. Global proper efficiency and vector optimization with cone-arcwise connected set-valued maps. Numer. Algebra Control Optim. 2016, 6, 35. [Google Scholar] [CrossRef]
  16. Peng, Z.; Xu, Y. Second-order optimality conditions for cone-subarcwise connected set-valued optimization problems. Acta Math. Appl. Sin. Engl. Ser. 2018, 34, 183–196. [Google Scholar] [CrossRef]
  17. Aubin, J.P. Contingent derivatives of set-valued maps and existence of solutions to nonlinear inclusions and differential inclusions. In Mathematical Analysis and Applications, Part A; Nachbin, L., Ed.; Academic Press: New York, NY, USA, 1981; pp. 160–229. [Google Scholar]
  18. Aubin, J.P.; Frankowska, H. Set-Valued Analysis; Birhäuser: Boston, MA, USA, 1990. [Google Scholar]
  19. Cambini, A.; Martein, L.; Vlach, M. Second order tangent sets and optimality conditions. Math. Jpn. 1999, 49, 451–461. [Google Scholar]
  20. Jahn, J.; Rauh, R. Contingent epiderivatives and set-valued optimization. Math. Method Oper. Res. 1997, 46, 193–211. [Google Scholar] [CrossRef]
  21. Borwein, J. Multivalued convexity and optimization: A unified approach to inequality and equality constraints. Math. Program. 1977, 13, 183–199. [Google Scholar] [CrossRef]
  22. Das, K.; Nahak, C. Approximate quasi efficiency of set-valued optimization problems via weak subdifferential. SeMA J. 2017, 74, 523–542. [Google Scholar] [CrossRef]
  23. Das, K.; Nahak, C. Set-valued minimax programming problems under generalized cone convexity. Rend. Circ. Mat. Palermo 2017, 66, 361–374. [Google Scholar] [CrossRef]
  24. Das, K.; Nahak, C. Sufficiency and duality of set-valued semi-infinite programming problems under generalized cone convexity. Acta Univ. Matthiae Belii Ser. Math. 2020, 2020, 95–111. [Google Scholar]
  25. Das, K.; Nahak, C. Set-valued optimization problems via second-order contingent epiderivative. Yugosl. J. Oper. Res. 2021, 31, 75–94. [Google Scholar] [CrossRef]
  26. Treanta, S.; Das, K. On robust saddle-point criterion in optimization problems with curvilinear integral functionals. Mathematics 2021, 9, 1790. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Das, K.; Treanţă, S. On Constrained Set-Valued Semi-Infinite Programming Problems with ρ-Cone Arcwise Connectedness. Axioms 2021, 10, 302. https://doi.org/10.3390/axioms10040302

AMA Style

Das K, Treanţă S. On Constrained Set-Valued Semi-Infinite Programming Problems with ρ-Cone Arcwise Connectedness. Axioms. 2021; 10(4):302. https://doi.org/10.3390/axioms10040302

Chicago/Turabian Style

Das, Koushik, and Savin Treanţă. 2021. "On Constrained Set-Valued Semi-Infinite Programming Problems with ρ-Cone Arcwise Connectedness" Axioms 10, no. 4: 302. https://doi.org/10.3390/axioms10040302

APA Style

Das, K., & Treanţă, S. (2021). On Constrained Set-Valued Semi-Infinite Programming Problems with ρ-Cone Arcwise Connectedness. Axioms, 10(4), 302. https://doi.org/10.3390/axioms10040302

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