Next Article in Journal
Generalizing the Orbifold Model for Voice Leading
Previous Article in Journal
“It Is Like a Feeling”: Theorizing Emotion in Mathematics through Complex Embodiment
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Mond-Weir and Wolfe Duality of Set-Valued Fractional Minimax Problems in Terms of Contingent Epi-Derivative of Second-Order

1
Department of Mathematics, Taki Government College, Taki 743429, India
2
Department of Applied Mathematics, University Politehnica of Bucharest, 060042 Bucharest, Romania
3
Nonlinear Analysis and Applied Mathematics—Research Group, Department of Mathematics, Faculty of Sciences, King Abdulaziz University, Jeddah 21589, Saudi Arabia
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(6), 938; https://doi.org/10.3390/math10060938
Submission received: 22 February 2022 / Revised: 8 March 2022 / Accepted: 12 March 2022 / Published: 15 March 2022

Abstract

:
This paper is devoted to provide sufficient Karush Kuhn Tucker (in short, KKT) conditions of optimality of second-order for a set-valued fractional minimax problem. In addition, we define duals of the types Mond-Weir and Wolfe of second-order for the problem. Further we obtain the theorems of duality under contingent epi-derivative together with generalized cone convexity suppositions of second-order.

1. Introduction

A fractional minimax optimization programming is a particular type of optimization problem. It has applications in various fields of engineering sciences, mathematics, and economics. In the year of 1985, Bector and Bhatia [1], and in 1992, Weir [2] developed the conditions of optimality and developed the theorems of duality of differentiable fractional minimax problems. In 1987, Zamlai [3] demonstrated the sufficient and necessary conditions of optimality and constituted theorems of duality for fractional minimax problems using invexity suppositions in its broader sense. Liu and Wu [4] determined the sufficient conditions of optimality and developed the theorems of duality for fractional minimax problems with the assistance of ( F , ρ ) convexity suppositions in 1998. In the year of 2003, Ahmad [5] demonstrated the sufficient conditions of optimality and provided the theorems of duality for fractional minimax problems via ρ invexity suppositions. In 1999, Lai et al. [6] determined the sufficient and necessary conditions of optimality and developed the theorems of duality for parametric type in terms of convexity in its broader sense. In 2002, Lai and Lee [7] constituted the theorems of duality for fractional minimax problems involving convexity in its larger sense. In 2003, Liang and Shi [8] studied the sufficient conditions of optimality and provided the theorems of duality for fractional minimax problems involving the notion of ( F , α , ρ , d ) convexity. In the year of 2006, Ahmad and Husain [9] studied the sufficient conditions of optimality and developed the theorems of duality for fractional minimax problems in terms of ( F , α , ρ , d ) convexity.
A set-valued function is one for which image of elements of domain set of the map is a set. A set-valued optimization problem (in short, SOP) is an optimization problem with a set-valued objective function and constraints involving set-valued functions. Since last two decades, many authors have been expressing their interests in extending many results of vector optimization problems (in short, VOP) to SOP. In 2008, Li et al. [10,11] constituted the sufficient and necessary conditions of optimality via contingent derivative of higher-order. They also developed the kind of Mond-Weir theorems of duality of higher-order for SOP under convexity suppositions. In the year of 2015, Das and Nahak [12] demonstrated the sufficient optimality conditions of SOP in terms of generalized convexity and contingent derivative of higher-order. They also developed theorems of duality of Wolfe, Mond-Weir, and mixed kinds. They [12] also introduced the notion ρ -cone convexity of second-order using contingent epi-derivative of second-order. Das and Nahak [13] developed the KKT sufficient conditions of optimality of set-valued minimax problems in terms of contingent epi-derivative along with cone convexity in generalized sense. They also provided the theorems of duality of Wolfe, Mond-Weir, and mixed kinds. In 2020, Das and Nahak [14] constituted the sufficient conditions of optimality of KKT type for set-valued fractional minimax problems. They also defined the duals of Wolfe, Mond-Weir, and mixed kinds and provided the theorems of duality. For other different but connected ideas on this subject, the reader is directed to the following books [15,16].
In this study, we will look upon the sufficient conditions of KKT type of second-order for a set-valued fractional minimax problem (FMP) via cone convexity in its generalized sense and contingent epi-derivative of second-order. We provide duality relationships of Mond-Weir and Wolfe kinds between the problem (FMP) and the dual problems of second-order.
The paper is organized in the following manner. We give some introductory ideas and definitions of set-valued functions in Section 2. In the Section 3, we look at the sufficient conditions of KKT type of second-order and prove the theorems of duality of Mond-Weir and Wolfe kinds for (FMP) in terms of cone convexity in its generalized sense of second-order.

2. Definitions and Preliminaries

Let us assume that R k denotes the k-dimensional Euclidean space and Δ is non-empty subset of R k . Then we call Δ a cone if t Δ Δ , for all t 0 . In addition, the cone Δ is known as solid if the interior of Δ , denoted by int ( Δ ) , is non-empty. Moreover, the cone Δ is referred to as pointed if Δ ( Δ ) = { 0 R k } , 0 R k being the zero element of R k and closed if closure of Δ , represented by Δ ¯ , becomes Δ itself. Additionally, the cone Δ is called convex if t Δ + ( 1 t ) Δ Δ , for all t [ 0 , 1 ] .
The non-negative orthant of R k , denoted by R + k , is defined by
R + k = { r = ( r 1 , , r j , , r k ) R k : r j 0 , for all j = 1 , 2 , , k } .
It is clear that int ( R + k ) { 0 R k } is a pointed solid convex cone and R + k is a closed pointed solid convex cone of R k .
With respect to (in short, w.r.t.) the pointed solid convex cone R + k of R k , there are basically two types of cone-orders in R k . For two elements r 1 , r 2 R k , we have
r 1 r 2 if r 2 r 1 R + k
and
r 1 < r 2 if r 2 r 1 int ( R + k ) .
In finite dimensional Euclidean space, the concepts of minimality and weak minimality are defined as follows.
Definition 1.
Let Θ be a non-empty subset of R k . Then
(i)
r Θ  is stated to be a minimal point of Θ if there is not any r Θ \ { r } , such that
r r .
(ii)
r Θ  is stated to be a weakly minimal point of Θ if there is not any r Θ , such that
r < r .
Let us consider that min ( Θ ) and w-min ( Θ ) denote the sets of minimal points and weakly minimal points of Θ . These two sets can be expressed in the following ways.
min ( Θ ) = { r Θ : ( r R + k ) Θ = { r } }
and
w - min ( Θ ) = { r Θ : ( r int ( R + k ) ) Θ = } .
In real normed space, we recall the concepts of contingent cone and second-order contingent set.
Definition 2
([17,18]). Suppose that W is a real normed space, Θ is a non-empty subset of W, and w is an element of Θ ¯ . We denote the contingent cone to the set Θ at the point w by C ( Θ , w ) .
w W is an element of C ( Θ , w ) if there are sequences { t n } in R and { w n } in W, with t n 0 + and w n w , as n + , such that
w + t n w n Θ , for all n N ,
or, there are sequences { s n } in R and { w n } in Θ, with s n > 0 and w n w , as n + , such that
s n ( w n w ) w , as n + .
Definition 3
([17,18,19]). Suppose that W is a real normed space, Θ is a non-empty subset of W, w Θ ¯ , and w ^ W . We denote the second-order contingent set to the set Θ at the point w in the direction w ^ by C 2 ( Θ , w , w ^ ) .
w W is an element of C 2 ( Θ , w , w ^ ) if there are sequences { t n } in R and { w n } in W, with t n 0 + and w n w , as n + , such that
w + t n w ^ + 1 2 t n 2 w n Θ , for all n N ,
or, there are sequences { s n } , { s n } in R and { w n } in Θ, with s n , s n > 0 , s n + , s n + , s n s n 2 , and w n w , as n + , such that
s n ( w n w ) w ^ and s n ( s n ( w n w ) w ^ ) w , as n + .
Suppose that Z and W are real normed spaces, 2 W denotes the set of all subsets of W, and Δ is a pointed solid convex cone in W. Assume that F : Z 2 W is a set-valued function from Z to W. So, F ( z ) W , for all z Z . The domain, graph, and epi-graph of F can be defined like this:
dom ( F ) = { z Z : F ( z ) } ,
gr ( F ) = { ( z , w ) Z × W : w F ( z ) } ,
and
epi ( F ) = { ( z , w ) Z × W : w F ( z ) + Δ } .
Suppose that Z is a non-empty subset of Z, z Z , z Z , w W , F : Z 2 W be a set-valued function, along with Z dom ( F ) and w F ( z ) . Jahn and Rauh [20] introduced the idea of contingent epi-derivative. It is quite important in the theory of SOP.
Definition 4
([20]). A single-valued map d F ( z , w ) : Z W is stated to be contingent epi-derivative of F at ( z , w ) if
epi ( d F ( z , w ) ) = C ( epi ( F ) , ( z , w ) ) .
Jahn et al. [21] developed the concept of contingent epi-derivative of second-order. It has very crucial role in the theory of SOP.
Definition 5
([21]). A single-valued map d 2 F ( z , w , z , w ) : Z W is stated to be contingent epi-derivative of second-order of F at ( z , w ) in a direction ( z , w ) if
epi ( d 2 F ( z , w , z , w ) ) = C 2 ( epi ( F ) , ( z , w ) , ( z , w ) ) .
The concept of cone convexity was introduced by Borwein [22] in the theory of SOP.
Definition 6
([22]). Suppose that Z is a convex subset of Z. A set-valued function F : Z 2 W , along with Z dom ( F ) , is said to be Δ-convex on Z if f o r a l l z 1 , z 2 Z and t [ 0 , 1 ] ,
t F ( z 1 ) + ( 1 t ) F ( z 2 ) F ( t z 1 + ( 1 t ) z 2 ) + Δ .
The cone convexity can be expressed with the assistance of contingent epi-derivative.
Lemma 1
([20]). Assume that Z is a convex subset of Z and F : Z 2 W is Δ-convex on Z . Then
F ( z ) w d F ( z , w ) ( z z ) + Δ , for all z , z Z and w F ( z ) .
Zhu et al. [23] presented the concept of cone convexity of second-order in the theory of SOP.
Definition 7
([23]). Suppose that Z is a non-empty subset of Z and F : Z 2 W is a set-valued function, along with Z dom ( F ) . Let z , z ^ Z , w F ( z ) , and w ^ F ( z ^ ) + Δ . We suppose that F is contingent epiderivable of second-order at ( z , w ) in the direction ( z ^ z , w ^ w ) . Then F is stated to be second-order Δ-convex at ( z , w ) in the direction ( z ^ z , w ^ w ) on Z if
F ( z ) w d 2 F ( z , w , z ^ z , w ^ w ) ( z z ) + Δ , for all z Z .
Definition 8.
A set-valued function F : R k 2 R l is stated to be upper semicontinuous on R k if for any open subset W of R l , F + ( W ) = { z R k : F ( z ) W } is an open set in R k .
Definition 9.
Suppose that W is a non-empty subset of R l . Then W is stated to be R + l -semicompact in R l if every open cover being of the form { ( w j + R + l ) c : w j W , j J } has a finite subcover, where J is an index set.
Definition 10.
A set-valued function F : R k 2 R l is stated to be R + l -semicompact-valued if for all z dom ( F ) , the set F ( z ) is R + l -semicompact in R l .
Corley [24] provided the existence theorems for optimization problems having cone semicompact-valued and upper semicontinuous set-valued functions.
Theorem 1
([24]). Suppose that Z is an compact subset of Z, and Δ is a convex cone in W such that Δ ¯ is pointed. Let F : Z 2 W be an upper semicontinuous and Δ-semicompact-valued. Then there is a solution of the optimization problem defined as max z Z F ( z ) .
Suppose that C is a non-empty subset of R k and D is a non-empty compact subset of R l . Suppose that M 1 and M 2 is two positive semidefinite matrices of order k × k . Let F , H : R k × R l 2 R and G : R k 2 R m be set-valued functions, along with
C × D dom ( F ) dom ( H ) and C dom ( G ) .
Let us consider the following set-valued fractional minimax problem.
minimize z C max w D F ( z , w ) + ( z T M 1 z ) 1 2 H ( z , w ) ( z T M 2 z ) 1 2 subject to G ( z ) ( R + m ) .
Let us define a set-valued function Ψ : C × D R k × R l 2 R by
Ψ ( z , w ) = F ( z , w ) + ( z T M 1 z ) 1 2 H ( z , w ) ( z T M 2 z ) 1 2 , f o r a l l ( z , w ) C × D .
assuming that
F ( z , w ) + ( z T M 1 z ) 1 2 0 , for all ( z , w ) C × D
and
H ( z , w ) ( z T M 2 z ) 1 2 > 0 , for all ( z , w ) C × D .
We suppose that for all z C , Ψ ( z , . ) : R l 2 R is upper semicontinuous and R + -semicompact-valued on D. In Theorem 1, we suppose that Z = R l , W = R , and Δ = R + . Therefore, max w D Ψ ( z , w ) always exists, for all z C . Since Ψ ( z , w ) R , there is one and only one solution of the problem max w D Ψ ( z , w ) , for each z C . The feasible set of (FMP), denoted by S , can be defined as
S = { z C : G ( z ) ( R + m ) } .
The minimizer of (FMP) is defined in following manner.
Definition 11.
We suppose that z S and y = max w D Ψ ( z , w ) . Then the point ( z , y ) is stated to minimize (FMP) if there does not exist any point ( z , y ) , with z S , y = max w D Ψ ( z , w ) , and z z , such that y < y .
For z C , let us define
I ( z ) = { j { 1 , , m } : 0 G j ( z ) } ,
J ( z ) = { 1 , , m } \ I ( z ) ,
B ( z ) = w D : max w D Ψ ( z , w ) Ψ ( z , w ) ,
and
K ( z ) = { ( n , z , w ˜ ) N × R + n × R l n : 1 n k + 1 , z = ( z 1 , , z n ) R + n , with i = 1 n z i = 1 , w ˜ = ( w 1 ¯ , , w n ¯ ) , with w i ¯ B ( z ) , i = 1 , , n } .
Since Ψ ( z , . ) is upper semicontinuous and R + -semicompact-valued on D , f o r a l l z C , we have
B ( z ) , f o r a l l z S .
Let M be an k × k positive semidefinite matrix. So,
z T M w ( z T M z ) 1 2 ( w T M w ) 1 2 , for all z , w R k .
Moreover, if ( w T M w ) 1 2 1 , we have
z T M w ( z T M z ) 1 2 .

3. Main Results

Das and Nahak [12,13,14,25,26] and Das and Treanţă [27] introduced the concept of ρ -cone convexity in set-valued optimization theory. They obtained the sufficient conditions of KKT type and constituted the theorems of duality of different types of SOP in terms of ρ -cone convexity and contingent epi-derivative. For ρ = 0 , ρ -cone convexity becomes the usual concept of cone convexity (Borwein [22]).
Definition 12
([25,26]). Suppose that C is a convex subset of R k , ρ R , 1 = ( 1 , , 1 ) int ( R + l ) , and F : R k 2 R l is a set-valued function, along with C dom ( F ) . Then F is stated to be ρ- R + l -convex w.r.t. 1 on C if
t F ( z 1 ) + ( 1 t ) F ( z 2 ) F ( t z 1 + ( 1 t ) z 2 ) + ρ t ( 1 t ) z 1 z 2 2 1 + R + l , for all z 1 , z 2 C and for all t [ 0 , 1 ] .
Das and Nahak [26] composed an example of set-valued function which is ρ -cone convex for some ρ R , but not cone convex. They represented ρ -cone convexity with the assistance of contingent epi-derivative.
Theorem 2
([26]). Suppose that C be is convex subset of R k , z C , ρ R , 1 int ( R + l ) , F : R k 2 R l is ρ- R + l -convex w.r.t. 1 on C, and w F ( z ) . Then,
F ( z ) w d F ( z , w ) ( z z ) + ρ z z 2 1 + R + l , for all z C .
Das and Nahak [12] introduced ρ -cone convexity of second-order with the assistance of contingent epi-derivative of second-order.
Definition 13
([12]). Suppose that C is a non-empty subset of R k , z , z ^ C , ρ R , 1 int ( R + l ) , and F : R k 2 R l is a set-valued function, along with C dom ( F ) , w F ( z ) , and w ^ F ( z ^ ) + R + l . We suppose that F is contingent epiderivable of second-order at ( z , w ) in the direction ( z ^ z , w ^ w ) . Then F is stated to be ρ- R + l -convex of second-order w.r.t. 1 at ( z , w ) in the direction ( z ^ z , w ^ w ) on C if
F ( z ) w d 2 F ( z , w , z ^ z , w ^ w ) ( z z ) + ρ z z 2 1 + R + l , for all z C .
Remark 1.
For z ^ = z and w ^ = w ,
F ( z ) w d F ( z , w ) ( z z ) + ρ z z 2 1 + R + l , for all z C .
This case reduces to the concept of ρ- R + l -convexity. If ρ > 0 , then F is stated to be strongly ρ- R + l -convex of second-order, for ρ = 0 , it reduces to the usual concept of R + l -convexity of second-order, and if ρ < 0 , then F is stated to be weakly ρ- R + l -convex of second-order. It is straightforward that strongly ρ- R + l -convexity of second-order ⇒ R + l -convexity of second-order ⇒ weakly ρ- R + l -convexity of second-order.
Das and Nahak [12] composed an example of set-valued function F : R 2 R 2 , which is ρ - R + 2 -convex of second-order for some ρ R , but is not R + 2 -convex of second-order.

3.1. Sufficient Conditions of Optimality of Second-Order

We provide the sufficient conditions of second-order of KKT type of the set-valued fractional minimax problem (FMP). We first prove the following lemma which will be utilized to find out our results.
Lemma 2.
Let z C , y = max w D Ψ ( z , w ) , and w i ¯ B ( z ) , 1 i n . Then there are x i ¯ F ( z , w i ¯ ) and x i ¯ H ( z , w i ¯ ) such that
y = x i ¯ + ( z T M 1 z ) 1 2 x i ¯ ( z T M 2 z ) 1 2 .
Proof. 
As w i ¯ B ( z ) , i = 1 , , n ,
max w D Ψ ( z , w ) Ψ ( z , w i ¯ ) .
Since y = max w D Ψ ( z , w ) , we have
y Ψ ( z , w i ¯ ) , i = 1 , , n .
As y Ψ ( z , w i ¯ ) , there are x i ¯ F ( z , w i ¯ ) and x i ¯ H ( z , w i ¯ ) such that
y = x i ¯ + ( z T M 1 z ) 1 2 x i ¯ ( z T M 2 z ) 1 2 ,
which completes the proof. □
Theorem 3.
Suppose that C is a convex subset of R k , z is a feasible solution of (FMP), and y = max w D Ψ ( z , w ) . Let n N , (where 1 n k + 1 ), w , v R k , w i ¯ B ( z ) , ( i = 1 , , n ) , x i ¯ F ( z , w i ¯ ) , and x i ¯ H ( z , w i ¯ ) such that
y = x i ¯ + ( z T M 1 z ) 1 2 x i ¯ ( z T M 2 z ) 1 2 .
Let u C , r i F ( u , w i ¯ ) + R + , s i ( H ) ( u , w i ¯ ) + R + , ( i = 1 , , n ) and t j G j ( u ) , ( j = 1 , , m ) . We suppose that F ( . , w i ¯ ) is ρ i - R + -convex of second-order at ( z , x i ¯ ) in the direction ( u z , r i x i ¯ ) , ( . ) T M 1 w is ρ ¯ i - R + -convex, H ( . , w i ¯ ) is ρ i - R + -convex of second-order at ( z , x i ¯ ) in the direction ( u z , s i + x i ¯ ) , ( . ) T M 2 v is ρ ¯ i - R + -convex and G j is ν j - R + -convex of second-order at ( z , w j ) in the direction ( u z , t j w j ) , respectively w.r.t. 1, on C. Suppose that there exist z = ( z 1 , , z n ) R + n , with i = 1 n z i = 1 , w = ( w 1 , , w m ) R + m , and w j G j ( x ) ( R + ) , ( j = 1 , , m ) , such that
i = 1 n z i ( d 2 F ( . , w i ¯ ) ( z , x i ¯ , u z , r i x i ¯ ) + M 1 w + y ( d 2 ( H ) ( . , w i ¯ ) ( z , x i ¯ , u z , s i + x i ¯ ) + M 2 v ) ) ( z z ) + j = 1 m w j d 2 G j ( z , w j , u z , t j w j ) ( z z ) 0 , for all z C ,
j = 1 m w j w j = 0 ,
w T M 1 w 1 , v T M 2 v 1 ,
( z T M 1 z ) 1 2 = z T M 1 w ,
( z T M 2 z ) 1 2 = z T M 2 v ,
and
i = 1 n z i ρ i + ρ i ¯ + y ( ρ i + ρ i ¯ ) + j = 1 m w j ν j 0 .
Then the point ( z , y ) minimizes the problem (FMP).
Proof. 
Suppose that the point ( z , y ) does not minimize the problem (FMP). Then there are z S and y = max w D Ψ ( z , w ) , with z z , such that
y < y .
Let y i Ψ ( z , w i ¯ ) . Since y = max w D Ψ ( z , w ) and w i ¯ B ( z ) D , we have
y i y .
Hence,
y i < y .
As y = x i ¯ + ( z T M 1 z ) 1 2 x i ¯ ( z T M 2 z ) 1 2 , we have
x i ¯ + ( z T M 1 z ) 1 2 y ( x i ¯ ( z T M 2 z ) 1 2 ) = 0 , for all i = 1 , , n .
As y i Ψ ( z , w i ¯ ) , there are x i F ( z , w i ¯ ) and x i H ( z , w i ¯ ) such that
y i = x i + ( z T M 1 z ) 1 2 x i ( z T M 2 z ) 1 2 .
Therefore,
x i + ( z T M 1 z ) 1 2 x i ( z T M 2 z ) 1 2 < y .
So,
x i + ( z T M 1 z ) 1 2 y ( x i ( z T M 2 z ) 1 2 ) < 0 , for all i = 1 , , n .
Hence,
i = 1 n z i x i + ( z T M 1 w ) y ( x i ( z T M 2 v ) ) i = 1 n z i x i + ( z T M 1 z ) 1 2 y ( x i ( z T M 2 z ) 1 2 ) < 0 = i = 1 n z i x i ¯ + ( z T M 1 z ) 1 2 y ( x i ¯ ( z T M 2 z ) 1 2 ) = i = 1 n z i x i ¯ + ( z T M 1 w ) y ( x i ¯ ( z T M 2 v ) ) .
Since z S , there is
w j G j ( z ) ( R + ) .
As w j 0 ( j = 1 , , m ) ,
w j w j 0 , for all j , j = 1 , , m .
So,
j = 1 m w j w j 0 .
Again, from (4), we have
j = 1 m w j w j = 0 .
Therefore,
j = 1 m w j w j j = 1 m w j w j .
Hence,
i = 1 n z i x i + ( z T M 1 w ) y ( x i ( z T M 2 v ) ) + j = 1 m w j w j < i = 1 n z i x i ¯ + ( z T M 1 w ) y ( x i ¯ ( z T M 2 v ) ) + j = 1 m w j w j .
As F ( . , w i ¯ ) is ρ i - R + -convex of second-order at ( z , x i ¯ ) in the direction ( u z , r i w i ¯ ) w.r.t. 1, on C and x i ¯ F ( z , w i ¯ ) , we have
F ( z , w i ¯ ) x i ¯ d 2 F ( . , w i ¯ ) ( z , x i ¯ , u z , r i x i ¯ ) ( z z ) + ρ i z z 2 + R + .
Since x i F ( z , w i ¯ ) , we have
x i x i ¯ d 2 F ( . , w i ¯ ) ( z , x i ¯ , u z , r i x i ¯ ) ( z z ) + ρ i z z 2 + R + .
Since ( . ) T M 1 w is ρ ¯ i - R + -convex w.r.t. 1, on C, we have
z T M 1 w z T M 1 w M 1 w ( z z ) + ρ i ¯ z z 2 + R + .
As H ( . , w i ¯ ) is ρ i - R + -convex of second-order at ( z , x i ¯ ) in the direction ( u z , s i + x i ¯ ) w.r.t. 1, on C and x i ¯ H ( z , w i ¯ ) , we have
H ( z , w i ¯ ) + x i ¯ d 2 ( H ) ( . , w i ¯ ) ( z , x i ¯ , u z , s i + x i ¯ ) ( z z ) + ρ i z z 2 + R + .
Since x i H ( z , w i ¯ ) , we have
x i + x i ¯ d 2 ( H ) ( . , w i ¯ ) ( z , x i ¯ , u z , s i + x i ¯ ) ( z z ) + ρ i z z 2 + R + .
As ( . ) T M 2 v is ρ ¯ i - R + -convex w.r.t. 1, on C, we have
z T M 2 v z T M 2 v M 2 v ( z z ) + ρ i ¯ z z 2 + R + .
As G j is ν j - R + -convex of second-order at ( z , w j ) in the direction ( u z , t j w j ) , respectively w.r.t. 1, on C and w j G j ( z ) ( R + ) , we have
G j ( z ) w j d 2 G j ( z , w j , u z , t j w j ) ( z z ) + ν j z z 2 + R + .
Since w j G j ( z ) ( R + ) , we have
w j w j d 2 G j ( z , w j , u z , t j w j ) ( z z ) + ν j z z 2 + R + .
From (3), (8), and (12)–(16), we have
i = 1 n z i x i + ( z T M 1 w ) y ( x i ( z T M 2 v ) ) + j = 1 m w j w j i = 1 n z i x i ¯ + ( z T M 1 w ) y ( x i ¯ ( z T M 2 v ) ) + j = 1 m w j w j .
It contradicts Equation (11). Hence, the point ( z , y ) minimizes the problem (FMP). □
The succeeding example can be adopted to verify Theorem 3.
Example 1.
Suppose that for all ( z , w ) R 2 × R 2 , the set-valued maps F : R 2 × R 2 2 R , H : R 2 × R 2 2 R , and G : R 2 2 R 2 are defined as
F ( z , w ) = { x | z 1 z 2 | + w : x z 2 } , i f   z ( 0 , 0 ) , z ( 2 , 2 ) , z = ( z 1 , z 2 ) , { x + w : x [ 4 , 0 ] } , i f   z = ( 2 , 2 ) , { 0 } , i f   z = ( 0 , 0 ) , { | z 1 z 2 | } , i f   w = ( 0 , 0 ) ,
H ( z , w ) = 1 ,
and
G ( z ) = { ( x 2 + z 2 , x 2 + z 2 ) : x R } , i f   z ( 0 , 0 ) , z ( 2 , 2 ) , { ( x + 4 , x + 4 ) : x 0 } , i f   z = ( 2 , 2 ) , { ( 0 , 0 ) } , i f   z = ( 0 , 0 ) .
Consider two positive semi-definite (symmetric) real matrices
M 1 = 1 1 1 1
and
M 2 = 0 0 0 0 .
Let C = [ 0 , 1 ] × [ 0 , 1 ] and D = [ 1 , 0 ] × [ 1 , 0 ] . Then C is a convex subset of R 2 and D is a non-empty compact subset of R 2 . Clearly,
F ( z , w ) + ( z T M 1 z ) 1 2 0 , for all ( z , w ) C × D
and
H ( z , w ) ( z T M 2 z ) 1 2 = 1 > 0 , for all ( z , w ) C × D .
The set-valued map Ψ : R 2 × R 2 2 R , defined as
Ψ ( z , w ) = F ( z , w ) + ( z T M 1 z ) 1 2 H ( z , w ) ( z T M 2 z ) 1 2 , for all ( z , w ) C × D ,
can be considered as
Ψ ( z , w ) = { x + w : x z 2 } , i f   z ( 0 , 0 ) , z ( 2 , 2 ) , { x + w : x [ 4 , 0 ] } , i f   z = ( 2 , 2 ) , { 0 } , i f   z = ( 0 , 0 ) , { 0 } , i f   w = ( 0 , 0 ) ,
It is clear that for all z C , Ψ ( z , . ) : R 2 2 R is upper semicontinuous and R + -semicompact-valued on D. Let z = ( 0 , 0 ) , y = max w D Ψ ( z , w ) = 0 , and w j = 0 G j ( z ) ( R + ) , ( j = 1 , 2 ) . Obviously, B ( z ) = D . Let n = 2 , w = ( 1 , 0 ) R 2 , v = ( 0 , 1 ) R 2 , w 1 ¯ = ( 1 , 0 ) B ( z ) , and w 2 ¯ = ( 0 , 1 ) B ( z ) . Suppose that there exist x i ¯ = 0 F ( z , w i ¯ ) and x i ¯ = 1 H ( z , w i ¯ ) such that
0 = y = x i ¯ + ( z T M 1 z ) 1 2 x i ¯ ( z T M 2 z ) 1 2 .
Let u = ( 1 , 1 ) C , r i = 3 F ( u , w i ¯ ) + R + , s i = 1 ( H ) ( u , w i ¯ ) + R + , ( i = 1 , 2 ) , and t j = 2 G j ( u ) , ( j = 1 , 2 ) . Choose ρ i = 1 , ρ ¯ i = 0 , ρ i = 0 , ρ ¯ i = 0 , and ν j = 1 . We can prove that F ( . , w i ¯ ) is ρ i - R + -convex of second-order at ( z , x i ¯ ) = ( ( 0 , 0 ) , 0 ) in the direction ( u z , r i x i ¯ ) = ( ( 1 , 1 ) , 3 ) , ( . ) T M 1 w is ρ ¯ i - R + -convex, H ( . , w i ¯ ) is ρ i - R + -convex of second-order at ( z , x i ¯ ) = ( ( 0 , 0 ) , 1 ) in the direction ( u z , s i + x i ¯ ) = ( ( 1 , 1 ) , 0 ) , ( . ) T M 2 v is ρ ¯ i - R + -convex and G j is ν j - R + -convex of second-order at ( z , w j ) = ( ( 0 , 0 ) , 0 ) in the direction ( u z , t j w j ) = ( ( 1 , 1 ) , 2 ) , respectively w.r.t. 1, on C. So, there exist z = ( z 1 , z 2 ) = ( 1 2 , 1 2 ) R + 2 , with i = 1 2 z i = 1 and w = ( w 1 , w 2 ) = ( 1 , 1 ) R + 2 such that Equations (3)–(7) along with (8) are satisfied. Then the point ( z , y ) = ( ( 0 , 0 ) , 0 ) minimizes the problem (FMP).

3.2. Mond-Weir Type Dual of Second-Order

Let us consider a Mond-Weir dual of second-order (MWD) associated with (FMP), assuming that F ( . , w i ¯ ) , H ( . , w i ¯ ) and G j are contingent epiderivable of second-order, where w i ¯ B ( z ) and z C .
maximize y subject to i = 1 n z i ( d 2 F ( . , w i ¯ ) ( z , x i ¯ , u z , r i x i ¯ ) + M 1 w + y ( d 2 ( H ) ( . , w i ¯ ) ( x , x i ¯ , u z , s i + x i ¯ ) + M 2 v ) ) ( z z ) + j = 1 m w j d 2 G j ( z , w j , u z , t j w j ) ( z z ) 0 , for all z C , for some n N , ( 1 n k + 1 ) , w i ¯ B ( z ) , x i ¯ F ( z , w i ¯ ) , x i ¯ H ( z , w i ¯ ) , and y = x i ¯ + ( z T M 1 z ) 1 2 x i ¯ ( z T M 2 z ) 1 2 , j = 1 m w j w j 0 , w T M 1 w 1 , v T M 2 v 1 , ( z T M 1 z ) 1 2 = z T M 1 w , ( z T M 2 z ) 1 2 = z T M 2 v , for some w , v R k , z C , y = max w D Ψ ( z , w ) , w = ( w 1 , , w m ) , w j G j ( z ) , z = ( z 1 , , z n ) , w = ( w 1 , , w m ) , z i 0 , w j 0 , and i = 1 n z i = 1 , where i = 1 , , n and j = 1 , , m .
Definition 14.
A feasible solution ( z , y , w , z , w ) of (MWD) is stated to maximize the problem (MWD) if there is not any feasible solution ( z , y , w , z 1 , w 1 ) of the problem (MWD) such that
y < y .
Theorem 4.
Suppose that C is a convex subset of R k , z 0 is a feasible solution of (FMP) and ( z , y , w , z , w ) is a feasible solution of the dual problem (MWD). Let u C , r i F ( u , w i ¯ ) + R + , s i ( H ) ( u , w i ¯ ) + R + , ( i = 1 , , n ) and t j G j ( u ) , ( j = 1 , , m ) . We suppose that F ( . , w i ¯ ) is ρ i - R + -convex of second-order at ( z , x i ¯ ) in the direction ( u z , r i x i ¯ ) , ( . ) T M 1 w is ρ ¯ i - R + -convex, H ( . , w i ¯ ) is ρ i - R + -convex of second-order at ( z , x i ¯ ) in the direction ( u z , s i + x i ¯ ) , ( . ) T M 2 v is ρ ¯ i - R + -convex and G j is ν j - R + -convex of second-order at ( z , w j ) in the direction ( u z , t j w j ) , respectively w.r.t. 1, on C, satisfying
i = 1 n z i ρ i + ρ i ¯ + y ( ρ i + ρ i ¯ ) + j = 1 m w j ν j 0 .
Then,
max w D Ψ ( z 0 , w ) y .
Proof. 
Let us assume that for y 0 = max w D Ψ ( z 0 , w ) ,
y 0 < y .
Let y i Ψ ( z 0 , w i ¯ ) . Since y 0 = max w D Ψ ( z 0 , w ) and w i ¯ B ( z ) D , we have
y i y 0 .
Hence,
y i < y .
As y = x i ¯ + ( z T M 1 z ) 1 2 x i ¯ ( z T M 2 x ) 1 2 , we have
x i ¯ + ( z T M 1 z ) 1 2 y ( x i ¯ ( z T M 2 z ) 1 2 ) = 0 , for all i = 1 , , n .
Since y i Ψ ( z 0 , w i ¯ ) , there exist x i F ( z 0 , w i ¯ ) and x i H ( z 0 , w i ¯ ) such that
y i = x i + ( z 0 T M 1 z 0 ) 1 2 x i ( z 0 T M 2 z 0 ) 1 2 .
Therefore,
x i + ( z 0 T M 1 z 0 ) 1 2 x i ( z 0 T M 2 z 0 ) 1 2 < y .
So,
x i + ( z 0 T M 1 z 0 ) 1 2 y ( x i ( z 0 T M 2 z 0 ) 1 2 ) < 0 , for all i = 1 , , n .
We have
i = 1 n z i x i + ( z 0 T M 1 w ) y ( x i ( z 0 T M 2 v ) ) i = 1 n z i x i + ( z 0 T M 1 z 0 ) 1 2 y ( x i ( z 0 T M 2 z 0 ) 1 2 ) , [ by applying ( MWD ) ] < 0 = i = 1 n z i x i ¯ + ( z T M 1 z ) 1 2 y ( x i ¯ ( z T M 2 z ) 1 2 ) = i = 1 n z i x i ¯ + ( z T M 1 w ) y ( x i ¯ ( z T M 2 v ) ) , [ by applying the constraints of ( MWD ) ] .
As z 0 S , there exists
w j G j ( z 0 ) ( R + ) .
As w j 0 ( j = 1 , , m ) , we have
w j w j 0 , for all j , ( j = 1 , , m ) .
So,
j = 1 m w j w j 0 .
By applying constraints of (MWD),
j = 1 m w j w j 0 .
Therefore,
j = 1 m w j w j j = 1 m w j w j .
Hence,
i = 1 n z i x i + ( z 0 T M 1 w ) y ( x i ( z 0 T M 2 v ) ) + j = 1 m w j w j < i = 1 n z i x i ¯ + ( z T M 1 w ) y ( x i ¯ ( z T M 2 v ) ) + j = 1 m w j w j .
As F ( . , w i ¯ ) is ρ i - R + -convex of second-order at ( z , x i ¯ ) in the direction ( u z , r i x i ¯ ) w.r.t. 1, on C and x i ¯ F ( z , w i ¯ ) , we have
F ( z 0 , w i ¯ ) x i ¯ d 2 F ( . , w i ¯ ) ( z , x i ¯ , u z , r i x i ¯ ) ( z 0 z ) + ρ i z 0 z 2 + R + .
As x i F ( z 0 , w i ¯ ) , we have
x i x i ¯ d 2 F ( . , w i ¯ ) ( z , x i ¯ , u z , r i x i ¯ ) ( z 0 z ) + ρ i z 0 z 2 + R + .
Since ( . ) T M 1 w is ρ ¯ i - R + -convex w.r.t. 1, on C, we have
z 0 T M 1 w z T M 1 w M 1 w ( z 0 z ) + ρ i ¯ z 0 z 2 + R + .
As H ( . , w i ¯ ) is ρ i - R + -convex of second-order at ( z , x i ¯ ) in the direction ( u z , s i + x i ¯ ) w.r.t. 1, on C and x i ¯ H ( z , w i ¯ ) , we have
H ( z 0 , w i ¯ ) + x i ¯ d 2 ( H ) ( . , w i ¯ ) ( z , x i ¯ , u z , s i + x i ¯ ) ( z 0 x ) + ρ i z 0 z 2 + R + .
As x i H ( z 0 , w i ¯ ) , we have
x i + x i ¯ d 2 ( H ) ( . , w i ¯ ) ( z , x i ¯ , u z , s i + x i ¯ ) ( z 0 z ) + ρ i z 0 z 2 + R + .
Since ( . ) T M 2 v is ρ ¯ i - R + -convex w.r.t. 1, on C, we have
z 0 T M 2 v z T M 1 v M 2 v ( z 0 z ) + ρ i ¯ z 0 z 2 + R + .
As G j is ν j - R + -convex of second-order at ( z , w j ) in the direction ( u z , t j w j ) , respectively w.r.t. 1, on C and w j G j ( z ) ( R + ) , we have
G j ( z 0 ) w j d 2 G j ( z , w j , u z , t j w j ) ( z 0 z ) + ν j z 0 x 2 + R + .
Since w j G j ( z 0 ) ( R + ) , we have
w j w j d 2 G j ( z , w j , u z , t j w j ) ( z 0 x ) + ν j z 0 z 2 + R + .
By applying the constraints of the dual problem (MWD) along with Equations (17), (21)–(25), we have
i = 1 n z i x i + ( z 0 T M 1 w ) y ( x i ( z 0 T M 2 v ) ) + j = 1 m w j w j i = 1 n z i x i ¯ + ( z T M 1 w ) y ( x i ¯ ( z T M 2 v ) ) + j = 1 m w j w j .
It contradicts Equation (20). Therefore,
max w D Ψ ( z 0 , w ) y .
Theorem 5.
Suppose that the point ( z , y ) minimizes the problem (FMP) and w j G j ( z ) ( R + ) , ( j = 1 , , m ) . We suppose that for some n N , ( 1 n k + 1 ) , z i 0 , w i ¯ B ( z ) , ( i = 1 , , n ) with i = 1 n z i = 1 and w j 0 , ( j = 1 , , m ) , the point ( z , y , w , z , w ) satisfies Equations (3)–(7). Then ( z , y , w , z , w ) is a feasible solution of the dual problem (MWD). If Theorem 4 is satisfied, then the point ( z , y , w , z , w ) maximizes the problem (MWD).
Proof. 
Since the point ( z , y , w , z , w ) satisfies Equations (3)–(7),
i = 1 n z i ( d 2 F ( . , w i ¯ ) ( z , x i ¯ , u z , r i x i ¯ ) + M 1 w + y ( d 2 ( H ) ( . , w i ¯ ) ( z , x i ¯ , u z , s i + x i ¯ ) + M 2 v ) ) ( z z ) + j = 1 m w j d 2 G j ( z , w j , u z , t j w j ) ( z z ) 0 , for all z C ,
j = 1 m w j w j = 0 ,
w T M 1 w 1 , v T M 2 v 1 ,
( z T M 1 z ) 1 2 = z T M 1 w ,
and
( z T M 2 z ) 1 2 = z T M 2 v .
So, ( z , y , w , z , w ) is a feasible solution of the dual problem (MWD). Suppose that Theorem 4 is satisfied and the point ( z , y , w , z , w ) does not maximize the problem (MWD). Assume that ( z , y , w , z 1 , w 1 ) is a feasible solution for the dual problem (MWD) such that
y < y .
It contradicts Theorem 4. Hence, the point ( z , y , w , z , w ) maximizes the problem (MWD). □
Theorem 6.
Suppose that C is a convex subset of R k and ( z , y , w , z , w ) is a feasible solution of (MWD). Let u C , r i F ( u , w i ¯ ) + R + , s i ( H ) ( u , w i ¯ ) + R + , ( i = 1 , , n ) and t j G j ( u ) , ( j = 1 , , m ) . We suppose that F ( . , w i ¯ ) is ρ i - R + -convex of second-order at ( z , x i ¯ ) in the direction ( u z , r i x i ¯ ) , ( . ) T M 1 w is ρ ¯ i - R + -convex, H ( . , w i ¯ ) is ρ i - R + -convex of second-order at ( z , x i ¯ ) in the direction ( u z , s i + x i ¯ ) , ( . ) T M 2 v is ρ ¯ i - R + -convex and G j is ν j - R + -convex of second-order at ( z , w j ) in the direction ( u z , t j w j ) , respectively w.r.t. 1, on C, satisfying Equation (17). If z is a feasible solution of (FMP), then the point ( z , y ) minimizes the problem (FMP).
Proof. 
Let us assume that the point ( z , y ) does not minimize the problem (FMP). Then there is z S and y = max w D Ψ ( z , w ) , with y y , such that
y < y .
Let y i Ψ ( z , w i ¯ ) . Since y = max w D Ψ ( z , w ) and w i ¯ B ( z ) D ,
y i y .
Hence,
y i < y .
As y = x i ¯ + ( z T M 1 z ) 1 2 x i ¯ ( z T M 2 z ) 1 2 , we have
x i ¯ + ( z T M 1 z ) 1 2 y ( x i ¯ ( z T M 2 z ) 1 2 ) = 0 , for all i = 1 , , n .
Since y i Ψ ( z , w i ¯ ) , there are x i F ( z , w i ¯ ) and x i H ( z , w i ¯ ) such that
y i = x i + ( z T M 1 z ) 1 2 x i ( z T M 2 z ) 1 2 .
Therefore,
x i + ( z T M 1 z ) 1 2 x i ( z T M 2 z ) 1 2 < y .
So,
x i + ( z T M 1 z ) 1 2 y ( x i ( z T M 2 z ) 1 2 ) < 0 , for all i = 1 , , n .
Hence,
i = 1 n z i x i + ( z T M 1 w ) y ( x i ( z T M 2 v ) ) i = 1 n z i x i + ( z T M 1 z ) 1 2 y ( x i ( z T M 2 z ) 1 2 ) , [ by applying ( MWD ) ] < 0 = i = 1 n z i x i ¯ + ( z T M 1 z ) 1 2 y ( x i ¯ ( z T M 2 z ) 1 2 ) = i = 1 n z i x i ¯ + ( z T M 1 w ) y ( x i ¯ ( z T M 2 v ) ) , [ by applying ( MWD ) ] .
As z S , there is
w j G j ( z ) ( R + ) .
Since w j 0 ( j = 1 , , m ) ,
w j w j 0 , for all j , j = 1 , , m .
So,
j = 1 m w j w j 0 .
By applying the constraints of the dual problem (MWD), we have
j = 1 m w j w j 0 .
Therefore,
j = 1 m w j w j j = 1 m w j w j .
Hence,
i = 1 n z i x i + ( z T M 1 w ) y ( x i ( z T M 2 v ) ) + j = 1 m w j w j < i = 1 n z i x i ¯ + ( z T M 1 w ) y ( x i ¯ ( z T M 2 v ) ) + j = 1 m w j w j .
As F ( . , w i ¯ ) is ρ i - R + -convex of second-order at ( z , x i ¯ ) in the direction ( u z , r i x i ¯ ) w.r.t. 1, on C and x i ¯ F ( z , w i ¯ ) , we have
F ( z , w i ¯ ) x i ¯ d 2 F ( . , w i ¯ ) ( z , x i ¯ , u z , r i x i ¯ ) ( z z ) + ρ i z z 2 + R + .
As x i F ( z , w i ¯ ) , we have
x i x i ¯ d 2 F ( . , w i ¯ ) ( z , x i ¯ , u z , r i x i ¯ ) ( z z ) + ρ i z z 2 + R + .
Since ( . ) T M 1 w is ρ ¯ i - R + -convex w.r.t. 1, on C, we have
z T M 1 w z T M 1 w M 1 w ( z z ) + ρ i ¯ z z 2 + R + .
As H ( . , w i ¯ ) is ρ i - R + -convex of second-order at ( z , x i ¯ ) in the direction ( u z , s i + x i ¯ ) w.r.t. 1, on C and x i ¯ H ( z , w i ¯ ) , we have
H ( z , w i ¯ ) + x i ¯ d 2 ( H ) ( . , w i ¯ ) ( z , x i ¯ , u z , s i + x i ¯ ) ( z z ) + ρ i z z 2 + R + .
As x i H ( z , w i ¯ ) , we have
x i + x i ¯ d 2 ( H ) ( . , w i ¯ ) ( z , x i ¯ , u z , s i + x i ¯ ) ( z z ) + ρ i z z 2 + R + .
As ( . ) T M 2 v is ρ ¯ i - R + -convex w.r.t. 1, on C, we have
z T M 2 v z T M 1 v M 2 v ( z z ) + ρ i ¯ z z 2 + R + .
As G j is ν j - R + -convex of second-order at ( z , w j ) in the direction ( u z , t j w j ) , respectively w.r.t. 1, on C and w j G j ( z ) ( R + ) , we have
G j ( z ) w j d 2 G j ( z , w j , u z , t j w j ) ( z z ) + ν j z z 2 + R + .
Since w j G j ( z ) ( R + ) , we have
w j w j d 2 G j ( z , w j , u z , t j w j ) ( z z ) + ν j z z 2 + R + .
By applying the constraints of the dual problem (MWD) along with Equations (17), (29)–(33), we have
i = 1 n z i x i + ( z T M 1 w ) y ( x i ( z T M 2 v ) ) + j = 1 m w j w j i = 1 n z i x i ¯ + ( z T M 1 w ) y ( x i ¯ ( z T M 2 v ) ) + j = 1 m w j w j ,
which contradicts (28). Hence, the point ( z , y ) minimizes the problem (FMP). □

3.3. Wolfe Type Dual of Second-Order

Let us consider a Wolfe type dual of second-order (WD) associated with (FMP), assuming that F ( . , w i ¯ ) , H ( . , w i ¯ ) and G j are contingent epiderivable of second-order, where w i ¯ B ( z ) and z C .
maximize y + j = 1 m w j w j subject to i = 1 n z i ( d 2 F ( . , w i ¯ ) ( z , x i ¯ , u z , r i x i ¯ ) + M 1 w + y ( d 2 ( H ) ( . , w i ¯ ) ( z , x i ¯ , u z , s i + x i ¯ ) + M 2 v ) ) ( z z ) + j = 1 m w j d 2 G j ( z , w j , u z , t j w j ) ( z z ) 0 , for all z C , for some n N , ( 1 n k + 1 ) , w i ¯ B ( z ) , x i ¯ F ( z , w i ¯ ) , x i ¯ H ( z , w i ¯ ) , and y = x i ¯ + ( z T M 1 z ) 1 2 x i ¯ ( z T M 2 z ) 1 2 , w T M 1 w 1 , v T M 2 v 1 , ( z T M 1 z ) 1 2 = z T M 1 w , ( z T M 2 z ) 1 2 = z T M 2 v , for some w , v R k , z C , y = max w D Ψ ( z , w ) , w = ( w 1 , , w m ) , w j G j ( z ) , z = ( z 1 , , z n ) , w = ( w 1 , , w m ) , z i 0 , w j 0 , and i = 1 n z i = 1 , where i = 1 , , n and j = 1 , , m .
Definition 15.
A feasible solution ( z , y , w , z , w ) of the dual problem (WD) is stated to maximize the problem (WD) if there is not any feasible solution ( z , y , w , z ¯ , w ¯ ) of the dual problem (WD) such that
y + j = 1 m w j w j < y + j = 1 m w ¯ j w j ,
where w = ( w 1 , , w m ) , w = ( w 1 , , w m ) , w = ( w 1 , , w m ) , and w ¯ = ( w ¯ 1 , , w ¯ m ) .
We can prove the theorems of duality of Wolfe kind. The proofs resemble those of Theorems 4–6. As a result, we do not include it.
Theorem 7.
Suppose that C is a convex subset of R k , z 0 is a feasible solution of (FMP) and ( z , y , w , z , w ) is a feasible solution of (WD). Let u C , r i F ( u , w i ¯ ) + R + , s i ( H ) ( u , w i ¯ ) + R + , ( i = 1 , , n ) and t j G j ( u ) , ( j = 1 , , m ) . We suppose that F ( . , w i ¯ ) is ρ i - R + -convex of second-order at ( z , x i ¯ ) in the direction ( u z , r i x i ¯ ) , ( . ) T M 1 w is ρ ¯ i - R + -convex, H ( . , w i ¯ ) is ρ i - R + -convex of second-order at ( z , x i ¯ ) in the direction ( u z , s i + x i ¯ ) , ( . ) T M 2 v is ρ ¯ i - R + -convex and G j is ν j - R + -convex of second-order at ( z , w j ) in the direction ( u z , t j w j ) , respectively w.r.t. 1, on C, satisfying Equation (17). Then,
max w D Ψ ( z 0 , w ) y + j = 1 m w j w j .
Theorem 8.
Suppose that the point ( z , y ) minimizes the problem (FMP) and w j G j ( z ) ( R + ) , ( j = 1 , , m ) . We suppose that for some n N , ( 1 n k + 1 ) , z i 0 , w i ¯ B ( z ) , ( i = 1 , , n ) with i = 1 n z i = 1 and w j 0 , ( j = 1 , , m ) , the point ( z , y , w , z , w ) satisfies Equations (3)–(7). Then the point ( z , y , w , z , w ) is a feasible solution of the dual problem (WD). If Theorem 7 is satisfied, then the point ( z , y , w , z , w ) maximizes the problem (WD).
Theorem 9.
Suppose that C is a convex subset of R k and ( z , y , w , z , w ) is a feasible solution of (WD), along with j = 1 m w j w j 0 . Let u C , r i F ( u , w i ¯ ) + R + , s i ( H ) ( u , w i ¯ ) + R + , ( i = 1 , , n ) and t j G j ( u ) , ( j = 1 , , m ) . We suppose that F ( . , w i ¯ ) is ρ i - R + -convex of second-order at ( z , x i ¯ ) in the direction ( u z , r i x i ¯ ) , ( . ) T M 1 w is ρ ¯ i - R + -convex, H ( . , w i ¯ ) is ρ i - R + -convex of second-order at ( z , x i ¯ ) in the direction ( u z , s i + x i ¯ ) , ( . ) T M 2 v is ρ ¯ i - R + -convex and G j is ν j - R + -convex of second-order at ( z , w j ) in the direction ( u z , t j w j ) , respectively w.r.t. 1, on C, satisfying Equation (17). If z is a feasible solution of (FMP), then the point ( z , y ) minimizes the problem (FMP).

4. Conclusions

We deal with a set-valued fractional minimax problem where set-valued maps are used for the constraint and objective functions. We use the idea of second-order ρ -cone convexity of set-valued maps as a generalization of cone convex set-valued maps. We investigate the required conditions of the KKT type of second-order for the set-valued fractional minimax problem and prove the theorems of duality of second-order Mond-Weir and Wolfe types in terms of contingent epi-derivative, as well as cone convexity in its broad sense. As a special case, our results reduce to the existing ones of scalar-valued fractional minimax problems. One can study conditions of optimality for approximate solutions and symmetric duals of the set-valued fractional minimax problem under second-order ρ -cone convexity suppositions. Under second-order ρ -cone convexity suppositions, one can study variational inequality, complementarity problems, and control problems in the setting of set-valued maps. These types of problems can also be studied for approximate quasi efficient solutions.

Author Contributions

Conceptualization, K.D.; methodology, K.D.; software, S.T.; validation, K.D., S.T. and T.S.; formal analysis, S.T.; investigation, K.D.; resources, S.T.; data curation, T.S.; writing—original draft preparation, K.D.; writing—review and editing, K.D.; visualization, S.T.; supervision, S.T.; project administration, T.S.; funding acquisition, T.S. All authors have read and agreed to the published version of the manuscript.

Funding

The Deanship of Scientific Research (DSR) at King Abdulaziz University, Jeddah, Saudi Arabia has funded this project, under grant no. (FP-138-43).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

The authors appreciate the editors’ and referees’ informative comments, which helped to strengthen the paper’s presentation.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Bector, C.R.; Bhatia, B.L. Sufficient optimality conditions and duality for a minmax problem. Util. Math. 1985, 27, 229–247. [Google Scholar]
  2. Weir, T. Pseudoconvex minimax programming. Util. Math. 1992, 42, 234–240. [Google Scholar]
  3. Zalmai, G.J. Optimality criteria and duality for a class of minimax programming problems with generalized invexity conditions. Util. Math. 1987, 32, 35–57. [Google Scholar]
  4. Liu, J.C.; Wu, C.S. On minimax fractional optimality conditions with (F,ρ)-convexity. J. Math. Anal. Appl. 1998, 219, 36–51. [Google Scholar] [CrossRef] [Green Version]
  5. Ahmad, I. Optimality conditions and duality in fractional minimax programming involving generalized ρ-invexity. Int. J. Manag. Syst. 2003, 19, 165–180. [Google Scholar]
  6. Lai, H.C.; Liu, J.C.; Tanaka, K. Necessary and sufficient conditions for minimax fractional programming. J. Math. Anal. Appl. 1999, 230, 311–328. [Google Scholar] [CrossRef] [Green Version]
  7. Lai, H.C.; Lee, J.C. On duality theorems for nondifferentiable minimax fractional programming. J. Comput. Appl. Math. 2002, 146, 115–126. [Google Scholar] [CrossRef]
  8. Liang, Z.A.; Shi, Z.W. Optimality conditions and duality for minimax fractional programming with generalized convexity. J. Math. Anal. Appl. 2003, 277, 474–488. [Google Scholar] [CrossRef] [Green Version]
  9. Ahmad, I.; Husain, Z. Optimality conditions and duality in nondifferentiable minimax fractional programming with generalized convexity. J. Optim. Theory Appl. 2006, 129, 255–275. [Google Scholar] [CrossRef]
  10. Li, S.J.; Teo, K.L.; Yang, X.Q. Higher-order MondWeir duality for set-valued optimization. J. Comput. Appl. Math. 2008, 217, 339–349. [Google Scholar] [CrossRef] [Green Version]
  11. Li, S.J.; Teo, K.L.; Yang, X.Q. Higher-order optimality conditions for set-valued optimization. J. Optim. Theory Appl. 2008, 137, 533–553. [Google Scholar] [CrossRef]
  12. Das, K.; Nahak, C. Sufficiency and duality of set-valued optimization problems via higher-order contingent derivative. J. Adv. Math. Stud. 2015, 8, 137–151. [Google Scholar]
  13. Das, K.; Nahak, C. Set-valued minimax programming problems under generalized cone convexity. Rend. Circ. Mat. Palermo 2017, 66, 361–374. [Google Scholar] [CrossRef]
  14. Das, K.; Nahak, C. Optimality conditions for set-valued minimax fractional programming problems. SeMA J. 2020, 77, 161–179. [Google Scholar] [CrossRef]
  15. Debnath, P.; Konwar, N.; Radenovic, S. Metric Fixed Point Theory: Applications in Science, Engineering and Behavioural Sciences; Springer: Singapore, 2021. [Google Scholar]
  16. Todorčević, V. Harmonic Quasiconformal Mappings and Hyperbolic Type Metrics; Springer: Cham, Switzerland, 2019. [Google Scholar]
  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. Japonica 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. Jahn, J.; Khan, A.; Zeilinger, P. Second-order optimality conditions in set optimization. J. Optim. Theory Appl. 2005, 125, 331–347. [Google Scholar] [CrossRef]
  22. Borwein, J. Multivalued convexity and optimization: A unified approach to inequality and equality constraints. Math. Program. 1977, 13, 183–199. [Google Scholar] [CrossRef]
  23. Zhu, S.K.; Li, S.J.; Teo, K.L. Second-order Karush-Kuhn-Tucker optimality conditions for set-valued optimization. J. Glob. Optim. 2014, 58, 673–692. [Google Scholar] [CrossRef]
  24. Corley, H.W. Existence and Lagrangian duality for maximizations of set-valued functions. J. Optim. Theory Appl. 1987, 54, 489–501. [Google Scholar] [CrossRef]
  25. Das, K.; Nahak, C. Sufficient optimality conditions and duality theorems for set-valued optimization problem under generalized cone convexity. Rend. Circ. Mat. Palermo 2014, 63, 329–345. [Google Scholar] [CrossRef]
  26. Das, K.; Nahak, C. Set-valued fractional programming problems under generalized cone convexity. Opsearch 2016, 53, 157–177. [Google Scholar] [CrossRef]
  27. Das, K.; Treanta, S. On constrained set-valued semi-infinite programming problems with ρ-cone arcwise connectedness. Axioms 2021, 10, 302. [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.; Saeed, T. Mond-Weir and Wolfe Duality of Set-Valued Fractional Minimax Problems in Terms of Contingent Epi-Derivative of Second-Order. Mathematics 2022, 10, 938. https://doi.org/10.3390/math10060938

AMA Style

Das K, Treanţă S, Saeed T. Mond-Weir and Wolfe Duality of Set-Valued Fractional Minimax Problems in Terms of Contingent Epi-Derivative of Second-Order. Mathematics. 2022; 10(6):938. https://doi.org/10.3390/math10060938

Chicago/Turabian Style

Das, Koushik, Savin Treanţă, and Tareq Saeed. 2022. "Mond-Weir and Wolfe Duality of Set-Valued Fractional Minimax Problems in Terms of Contingent Epi-Derivative of Second-Order" Mathematics 10, no. 6: 938. https://doi.org/10.3390/math10060938

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