Next Article in Journal
Geometrically Non-Linear Plane Elasticity Problem in the Area of an Angular Boundary Cut-Out
Next Article in Special Issue
Special Issue “Optimisation Models and Applications”
Previous Article in Journal
Existence and Uniqueness Results for a Pantograph Boundary Value Problem Involving a Variable-Order Hadamard Fractional Derivative
Previous Article in Special Issue
Designing a Secure Mechanism for Image Transferring System Based on Uncertain Fractional Order Chaotic Systems and NLFPID Sliding Mode Controller
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On Mond–Weir-Type Robust Duality for a Class of Uncertain Fractional Optimization Problems

1
School of Mathematics and Statistics, Chongqing Technology and Business University, Chongqing 400067, China
2
Chongqing Key Laboratory of Social Economy and Applied Statistics, Chongqing Technology and Business University, Chongqing 400067, China
Axioms 2023, 12(11), 1029; https://doi.org/10.3390/axioms12111029
Submission received: 6 October 2023 / Revised: 29 October 2023 / Accepted: 31 October 2023 / Published: 2 November 2023
(This article belongs to the Special Issue Optimization Models and Applications)

Abstract

:
This article is focused on the investigation of Mond–Weir-type robust duality for a class of semi-infinite multi-objective fractional optimization with uncertainty in the constraint functions. We first establish a Mond–Weir-type robust dual problem for this fractional optimization problem. Then, by combining a new robust-type subdifferential constraint qualification condition and a generalized convex-inclusion assumption, we present robust ε -quasi-weak and strong duality properties between this uncertain fractional optimization and its uncertain Mond–Weir-type robust dual problem. Moreover, we also investigate robust ε -quasi converse-like duality properties between them.

1. Introduction

Let T be a nonempty infinite index set. Suppose that f i : R n R , i = 1 , , p , and h t : R n R , t T . Let us consider the semi-infinite optimization problem:
( MP ) Min R + p f 1 ( x ) , , f p ( x ) s . t . h t ( x ) 0 , t T , x R n .
The study of optimization problem ( MP ) is a very interesting topic and has been considered extensively by many scholars from different points of view, see [1,2,3,4,5,6,7,8,9,10,11,12,13]. However, most semi-infinite optimization models of real-world problems are contaminated by prediction errors or asymmetry knowledge. Thus, it is necessary to consider semi-infinite optimization problems under uncertain data. This optimization problem ( MP ) with uncertainty can be captured by
( UMP ) Min R + p f 1 ( x ) , , f p ( x ) s . t . h t ( x , v t ) 0 , t T , x R n .
Here, h t : R n × R q R , t T , are given functions, v t , t T , are uncertain parameters which belongs to compact sets V t R q .
As we know, robust optimization [14,15,16] is an useful approach to solve optimization problems with uncertainty. Following robust optimization methodology, we usually associate UMP with its robust counterpart
( RMP ) Min R + p f 1 ( x ) , , f p ( x ) s . t . h t ( x , v t ) 0 , v t V t , t T , x R n .
Recently, following robust optimization methodology, many interesting results devoted to ( UMP ) and its generalizations have been obtained from several different perspectives. By using scalarizing methods and robust optimization, Lee and Lee [17] establish necessary optimality theorems for robust weakly and properly efficient solutions of a multi-objective optimization problem with uncertainty. By virtue of a new concept of generalized convexity and robust type constraint qualification conditions, Chen et al. [18] give some optimality conditions and duality results for an uncertain nonconvex and nonsmooth multi-objective optimization problem. Guo and Yu [19] obtain optimality conditions for robust approximate quasi-weakly efficient solutions for uncertain multi-objective convex optimization problems. By combining robust optimization and scalarization technique, Sun et al. [20] give some new characterizations of Wolfe type robust approximate duality and saddle point theorems for a nonsmooth robust multi-objective optimization problem. Sun et al. [21] investigate optimality conditions for robust ϵ -quasi efficient solutions of a class of uncertain semi-infinite multi-objective optimization under some tools of non-smooth analysis and a new modified scalarization technique. In addition, nonsmooth robust ϵ -duality properties and ϵ -quasi saddle point theorems are also established. New results on optimality and duality results for uncertain multiobjective polynomial optimization problems are given in [22]. By using tangential subdifferential and robust optimization, Liu et al. [23] obtained some characterizations of robust optimal solution sets for nonconvex uncertain semi-infinite optimization problems.
On the other hand, the fractional multi-objective optimization problem is an important subclass of multi-objective optimization problems. In the last decades, a wide variety of interesting works devoted to fractional multi-objective optimization problems and its generalizations have been given, see, for example, [24,25,26,27,28,29,30,31,32,33]. We observe that there are some papers devoted to the study of uncertain fractional multi-objective optimization problems under a robust optimization approach. In [34], the authors study approximate optimality conditions and Wolfe-type robust approximate duality of robust approximate weakly efficient solutions for uncertain fractional multi-objective optimization problems. Li et al. [35] establish optimality theorems and robust duality properties for minimax convex–concave fractional optimization problems with uncertainty. Antczak [36] establish a new parametric approach for robust approximate quasi-efficient solutions of robust fractional multi-objective optimization problems. Feng and Sun [37] obtain some new results for robust weakly ϵ -efficient solutions for an uncertain fractional multi-objective semi-infinite optimization by employing conjugate analysis. Very recently, by employing robust limiting constraint qualification conditions and generalized convexity assumptions, Thuy and Su [38] consider optimality conditions and duality results for nonsmooth fractional multi-objective semi-infinite optimization problems with uncertain data.
In this paper, our main concern is to give new duality results of robust ϵ -quasi-efficient solutions for fractional multi-objective semi-infinite optimization problems ( UFP , for brevity) with uncertainty appearing in the constraint functions. We first introduce the robust counterpart model ( RFP , for brevity) for UFP . Then, with the help of a robust-type subdifferential constraint qualification, we present a necessary approximate optimality condition for robust ϵ -quasi-efficient solutions for ( UFP ). Subsequently, we introduce a Mond–Weir-type robust approximate dual problem of ( UFP ) based on the obtained necessary optimality conditions. Then, we investigate robust weak, strong and converse-like duality results between them under a new assumption of generalized convex-inclusion for Lipschitz functions.
This paper is organized as follows. In Section 2, we first recall some basic concepts in nonsmooth analysis and present approximate optimality results for robust ϵ -quasi-efficient solutions of ( UFP ). In Section 3, we introduce a Mond–Weir-type robust approximate dual problem for ( UFP ), and establish the robust ϵ -quasi duality results between them. As a special case, we also deal with robust ϵ -quasi duality results of the uncertain multi-objective optimization problem ( UMP ) and its robust approximate dual problem.

2. Mathematical Preliminaries

In this paper, let us recall some concepts and preliminary results [39,40]. Let R p be the p-dimensional Euclidean space. We use the notation · for the Euclidean norm for R p . The nonnegative orthant of R p is defined by R + p : = { x = ( x 1 , , x n ) | x k 0 , k = 1 , , n } . We always use the symbol · , · for the inner product in R p . The closed unit ball of R p is denoted by B * . For a nonempty infinite index set T, the linear space R ( T ) [41] is denoted by
R ( T ) : = { γ T = ( γ t ) t T | γ t = 0 for all t T except for finitely many γ t 0 } .
Let R + ( T ) be the nonnegative cone of R ( T ) , i.e.,
R + ( T ) : = { γ T R ( T ) | γ t 0 , t T } .
Let ϕ : R p R be a locally Lipschitz function. The Clarke generalized directional derivative of ϕ at x R p in the direction d R p is defined by
ϕ c ( x ; d ) : = lim sup y x , t 0 ϕ ( y + t d ) ϕ ( y ) t .
The one-sided directional derivative of ϕ at x R p in direction d R p is defined by
ϕ ( x ; d ) : = lim t 0 ϕ ( x + t d ) ϕ ( x ) t .
We say that ϕ is quasidifferentiable at x R p iff, for each d R n , φ ( x ; d ) exists and φ ( x ; d ) = φ c ( x ; d ) . The Clarke subdifferential c ϕ ( x ) of ϕ at x R p is defined by
c ϕ ( x ) : = ξ * R p | ϕ c ( x ; d ) ξ * , d , d R p .
Obviously,
ϕ c ( x ; d ) = sup ξ c ϕ ( x ) ξ , d , d R n .
On the other hand, if ϕ : R p R is a convex function, c ϕ ( x ) coincides with the convex subdifferential ϕ ( x ) , that is
ϕ ( x ) : = { ξ * R p | ϕ ( y ) ϕ ( x ) ξ * , y x , y R p } .
Let Ω R p be a nonempty subset. The Clarke normal cone to Ω at x Ω is defined by
N c ( Ω , x ) : = { ξ R p | ξ * , w 0 , w T Ω ( x ) } .
Here, T Ω ( x ) is the Clarke tangent cone to Ω at x Ω . Clearly, if Ω R n is a nonempty closed convex set, N c ( Ω , x ) becomes the following normal cone:
N ( Ω , x ) : = { ξ * R p | ξ * , y x 0 , y Ω } .
In what follows, let f i , g i : R n R , i = 1 , , p , and h t : R n R , t T . We consider the following fractional multi-objective optimization problem
( FP ) Min R + p f 1 ( x ) g 1 ( x ) , , f p ( x ) g p ( x ) s . t . h t ( x ) 0 , t T , x R n .
The fractional optimization problem ( FP ) under uncertain data in the constraint functions becomes
( UFP ) Min R + p f 1 ( x ) g 1 ( x ) , , f p ( x ) g p ( x ) s . t . h t ( x , v t ) 0 , t T , x R n .
Here h t : R n × R q R . v t V t R q , t T are uncertain parameters.
For ( UFP ) , we consider its robust counterpart, namely
( RFP ) Min R + p f 1 ( x ) g 1 ( x ) , , f p ( x ) g p ( x ) s . t . h t ( x , v t ) 0 , v t V t , t T , x R n .
In this paper, without special statements, let f i , i = 1 , , p , be locally Lipschitz functions with f i ( x ) 0 , x R n , and g i , i = 1 , , p , be locally Lipschitz functions with g i ( x ) > 0 , x R n .
Now, we give the following important notations, which will be used later in this paper.
Definition 1. 
For ( UFP ) . We say that F is the robust feasible set of ( UFP ) iff
F : = x R n | h t ( x , v t ) 0 , v t V t , t T .
Now, we consider the concept of robust ϵ -quasi efficient solution for ( UFP ) . We refer the readers to [19,21,37] for other kinds of robust approximate efficient solutions.
Definition 2. 
Let ϵ R + p { 0 } . x ¯ F is a robust ϵ-quasi efficient solution of ( UFP ) if there is not x F , such that
f i ( x ) g i ( x ) f i ( x ¯ ) g i ( x ¯ ) ϵ i x x ¯ , f o r a l l i = 1 , , p ,
and
f j ( x ) g j ( x ) < f j ( x ¯ ) g j ( x ¯ ) ϵ j x x ¯ , f o r s o m e j { 1 , , p } .
Remark 1. 
Note that g i 1 , the concept of robust ε-quasi efficient solution of ( UFP ) deduces to the robust ε-quasi efficient solution of ( UMP ) , i.e., there is not x F , such that
f i ( x ) f i ( x ¯ ) ϵ i x x ¯ , f o r a l l i = 1 , , p ,
and
f j ( x ) < f j ( x ¯ ) ϵ j x x ¯ , f o r s o m e j { 1 , , p } .
For more details, see [20,21,42].
Definition 3 
([43] (Definition 3.2)). Consider ( UFP ) . We say that the robust-type subdifferential constraint qualification condition RSCQ holds at x ¯ F , iff
N c ( F , x ¯ ) λ T T ( x ¯ ) , v T V T t T λ t x c h t ( x ¯ , v t ) ,
where T ( x ¯ ) = λ T R + ( T ) | λ t h t ( x ¯ , v t ) = 0 , v t V t , t T .
Next, we recall the following necessary optimality conditions for robust ϵ -quasi-efficient solutions for ( UFP ) under the RSCQ . For convenience, let ϵ : = ( ϵ 1 , , ϵ p ) R + p { 0 } .
Proposition 1 
([44] (Theorem 1)). Let ϵ R + p { 0 } . Assume that ( RSCQ ) holds at x ¯ F . If x ¯ is a robust ϵ-quasi-efficient solution of ( UFP ) , then there exist η ¯ t 0 , and v ¯ t V t , t T , such that
0 i = 1 p c f i ( x ¯ ) + i = 1 p ϕ i ( x ¯ ) c ( g i ) ( x ¯ ) + t T η ¯ t c h t ( · , v ¯ t ) ( x ¯ ) + 2 i = 1 p ε i g i ( x ¯ ) B * ,
and
η ¯ t h t ( x ¯ , v ¯ t ) = 0 , t T .
Here, ϕ i ( · ) = f i ( x ¯ ) g i ( x ¯ ) ϵ i · x ¯ , i = 1 , , p .
Remark 2. 
Proposition 1 extends [45] (Theorem 3.1) from the case of scalar optimization to the multi-objective setting.
In the case that g i 1 , the following result can be easily obtained by Proposition 1.
Proposition 2. 
Let ϵ R + p { 0 } . Assume that ( RSCQ ) holds at x ¯ F . If x ¯ is a robust ϵ-quasi-efficient solution of ( UMP ) , then there exist η ¯ t 0 , and v ¯ t V t , t T , such that
0 i = 1 p c f i ( x ¯ ) + t T η ¯ t c h t ( · , v ¯ t ) ( x ¯ ) + 2 i = 1 p ε i B * ,
and
η ¯ t h t ( x ¯ , v ¯ t ) = 0 , t T .

3. Main Results

In this section, based on the optimality conditions obtained in Proposition 1, we establish a robust Mond-Weir-type approximate dual problem for ( UMFP ), and then investigate robust duality properties between them. Here, we only consider their robust ϵ -quasi-efficient solutions. For the sake of convenience in the sequel, we set f : = ( f 1 , , f p ) , g : = ( g 1 , , g p ) , h T : = ( h t ) t T , η T : = ( η t ) t R + ( T ) , V T : = t T V t , and v T : = ( v t ) t T V T .
Let y R n and ϵ R + p { 0 } . For given v t V t , t T , the Mond-Weir-type uncertain approximate dual problem ( UFD ) of ( UFP ) is
( UFD ) Max R + p f 1 ( y ) g 1 ( y ) , , f p ( y ) g p ( y ) s . t . 0 i = 1 p c f i ( y ) + i = 1 p f i ( y ) g i ( y ) c ( g i ) ( y ) + t T η t c h t ( · , v t ) ( y ) + 2 i = 1 p ϵ i g i ( y ) B * , η t h t ( y , v t ) 0 , t T , y R n , ϵ i 0 , i = 1 , , p , η t 0 , t T .
The optimistic counterpart of ( UFD ) is defined by
( OFD ) Max R + p f 1 ( y ) g 1 ( y ) , , f p ( y ) g p ( y ) s . t . 0 i = 1 p c f i ( y ) + i = 1 p f i ( y ) g i ( y ) c ( g i ) ( y ) + t T η t c h t ( · , v t ) ( y ) + 2 i = 1 p ϵ i g i ( y ) B * , η t h t ( y , v t ) 0 , t T , y R n , ϵ i 0 , i = 1 , , p , η t 0 , v t V t , t T .
Here, the maximization is also over all the parameters v t V t , t T . The feasible set of ( OFD ) is defined as
F ^ : = ( y , η T , v T ) R n × R + ( T ) × V T | 0 i = 1 p c f i ( y ) + i = 1 p f i ( y ) g i ( y ) c ( g i ) ( y ) + t T η t c h t ( · , v t ) ( y ) + 2 i = 1 p ϵ i g i ( y ) B * , η t h t ( y , v t ) 0 , t T .
Remark 3. 
(i)
Obviously, if g i ( x ) 1 , i = 1 , , p , ( UFD ) becomes the following conventional Mond-Weir-type uncertain approximate dual problem of ( UMP )
( UMD ) Max R + p f 1 ( y ) , , f p ( y ) s . t . 0 i = 1 p c f i ( y ) + t T η t c h t ( · , v t ) ( y ) + 2 i = 1 p ϵ i B * , η t h t ( y , v t ) 0 , t T , y R n , ϵ i 0 , i = 1 , , p , η t 0 , t T .
and ( OFD ) becomes the following Mond-Weir-type optimistic dual problem of ( UMP )
( OMD ) Max R + p f 1 ( y ) , , f p ( y ) s . t . 0 i = 1 p c f i ( y ) + t T η t c h t ( · , v t ) ( y ) + 2 i = 1 p ϵ i B * , η t h t ( y , v t ) 0 , t T , y R n , ϵ i 0 , i = 1 , , p , η t 0 , v t V t , t T .
Here, we denote the feasible set of ( OMD ) by
F ¯ : = ( y , η T , v T ) R n × R + ( T ) × V T | 0 i = 1 p c f i ( y ) + t T η t c h t ( · , v t ) ( y ) + 2 i = 1 p ϵ i g i ( y ) B * , η t h t ( y , v t ) 0 , t T .
(ii)
In the case that ϵ = 0 and there is no uncertainty in the constraint functions. Then, ( UFP ) becomes ( FP ) , and ( OMD ) collapses to
Max R + p f 1 ( y ) g 1 ( y ) , , f p ( y ) g p ( y ) s . t . 0 i = 1 p f i ( y ) + i = 1 p f i ( y ) g i ( y ) c ( g i ) ( y ) + t T η t c h t ( y ) , η t h t ( y ) 0 , t T , y R n , η t 0 , t T .
Now, similar to Definition 2, we introduce robust ϵ -quasi efficient solutions for ( UFD ) .
Definition 4. 
Let ε R + p { 0 } .   ( y ¯ , η ¯ T , v ¯ T ) F ^ is said to be a robust ε-quasi efficient solution of ( UFD ) , iff it is an ε-quasi efficient solution of ( OFD ) , i.e., there is no ( y , η T , v T ) F ^ , such that
f i ( y ) g i ( y ) f i ( y ¯ ) g i ( y ¯ ) + ϵ i y y ¯ , f o r a l l i = 1 , , p ,
and
f j ( y ) g j ( y ) > f j ( y ¯ ) g j ( y ¯ ) + ϵ j y y ¯ , f o r s o m e j { 1 , , p } .
Remark 4. 
In particular, if g i 1 , the concept of robust ε-quasi efficient solution of ( UFD ) deduces to the robust ε-quasi efficient solution of ( UMD ) , i.e., there is no ( y , η T , v T ) F ¯ , such that
f i ( y ) f i ( y ¯ ) + ϵ i y y ¯ , f o r a l l i = 1 , , p ,
and
f j ( y ) > f j ( y ¯ ) + ϵ j y y ¯ , f o r s o m e j { 1 , , p } .
In order to give robust duality relations for ( UFP ) and ( UFD ) , we introduce the new definition of generalized convex-inclusion for Lipschitz functions, which is inspired by [32] (Definition 3.4) and [21] (Definition 3.3).
Definition 5. 
Let Ω R n . ( f , g , h T ) is said to generalized convex-inclusion on Ω at x Ω , iff for any y Ω , ξ i * c f i ( x ) , ξ i * * c ( g i ) ( x ) , i = 1 , , p , and γ t * x c h t ( x , v t ) , v t V t , t T , there exists ω R n , such that
f i ( y ) f i ( x ) > ξ i * , ω , i = 1 , , p ,
g i ( y ) + g i ( x ) ξ i * * , ω , i = 1 , , p ,
h t ( y , v t ) h t ( x , v t ) γ t * , ω , t T ,
b * , ω y x , b * B * ,
and
0 c g i ( y ) , i = 1 , , p .
Remark 5. 
(i)
In the special case that g i 1 , the concept of generalized convex-inclusion reduces to the concept of generalized convexity, i.e., ( f , h T ) is generalized convex on Ω at x Ω , iff for any y Ω , ξ i * c f i ( x ) , i = 1 , , p , and γ t * x c g t ( x , v t ) , v t V t , t T , there exists ω R n , such that
f i ( y ) f i ( x ) > ξ i * , ω , i = 1 , , p ,
h t ( y , v t ) h t ( x , v t ) γ t * , ω , t T ,
and
b * , ω y x , b * B * .
(ii)
If g i 1 and there is uncertain data on f i , i = 1 , , p , Definition 5 reduces to [21] (Definition 3.3).
(iii)
If g i 1 and there is no uncertain data on h t , t T , Definition 5 reduces to the concept of generalized convexity-inclusion introduced in [32] (Definition 3.4), i.e., for any y Ω , ξ i * c f i ( x ) , ξ i * * c ( g i ) ( x ) , i = 1 , , p , and γ t * c h t ( x ) , t T , there exists ω R n , such that
f i ( y ) f i ( x ) > ξ i * , ω , i = 1 , , p ,
g i ( y ) + g i ( x ) ξ i * * , ω , i = 1 , , p ,
h t ( y ) h t ( x ) γ t * , ω , t T ,
b * , ω y x , b * B * ,
and
0 c g i ( y ) , i = 1 , , p .
Note that this concept has been used to establish sufficient optimality conditions for weakly ϵ-quasi-efficient solution for fractional optimization problem. For more details, please see [32] (Theorem 3.5).
Now, we show robust approximate duality properties for ( UFP ) and ( UFD ) by showing approximate duality properties between the robust counterpart ( RMP ) and the optimistic counterpart ( OFD ) . In what follows, we set
ω 1 ω 2 ω 2 ω 1 R + p { 0 } , ω 1 , ω 2 R p ,
ω 1 ω 2 ω 2 ω 1 R + p { 0 } , ω 1 , ω 2 R p .
The following result gives robust ϵ -quasi-weak duality between ( UFP ) and ( UFD ) .
Theorem 1. 
Let ϵ R + p { 0 } . Suppose that x F and ( y , η T , v T ) F ^ . If ( f , g , h T ) is generalized convex-inclusion on R n at y R n , then,
f 1 ( x ) g 1 ( x ) , , f p ( x ) g p ( x ) f 1 ( y ) g 1 ( y ) 2 ϵ 1 x y , , f p ( y ) g p ( y ) 2 ϵ p x y .
Proof. 
Suppose to the contrary that
f 1 ( x ) g 1 ( x ) , , f p ( x ) g p ( x ) f 1 ( y ) g 1 ( y ) 2 ϵ 1 y x , , f p ( y ) g p ( y ) 2 ϵ p y x .
Then,
f i ( x ) g i ( x ) f i ( y ) g i ( y ) 2 ϵ i y x , for all i = 1 , , p ,
and
f i ( x ) g i ( x ) < f j ( y ) g j ( y ) 2 ϵ j y x , for some j { 1 , , p } .
On the other hand, note that ( y , η T , v T ) F ^ . Then, y R n , η t 0 , v t V t , t T , and
0 i = 1 p c f i ( y ) + i = 1 p f i ( y ) g i ( y ) c ( g i ) ( y ) + t T η t c h t ( · , v t ) ( y ) + 2 i = 1 p ϵ i g i ( y ) B * ,
and
η t h t ( y , v t ) 0 , t T .
By (5), there exist ξ i * c f i ( y ) , ξ i * * c ( g i ) ( y ) , i = 1 , , p , ζ t * c h t ( · , v t ) ( y ) , t T , and b * B * , such that
i = 1 p ξ i * + i = 1 p f i ( y ) g i ( y ) ξ i * * + t T η t ζ t * + 2 i = 1 p ϵ i g i ( y ) b * = 0 .
Since ( f , g , h T ) is generalized convex-inclusion on R n at y R n , we have for such ξ i * c f i ( y ) , ξ i * * c ( g i ) ( y ) , i = 1 , , p , and ζ t * c h t ( · , v t ) ( y ) , t T , there exists ϑ R n , such that
f i ( x ) f i ( y ) > ξ i * , ϑ , i = 1 , , p ,
g i ( x ) + g i ( y ) ξ i * * , ϑ , i = 1 , , p ,
h t ( x , v t ) h t ( y , v t ) ζ t * , ϑ , t T ,
b * , ϑ x y , b * B * ,
and
0 c g i ( y ) , i = 1 , , p .
Together with (7)–(9), these follow that
i = 1 p f i ( x ) f i ( y ) g i ( y ) g i ( x ) + 2 ϵ i g i ( y ) y x > i = 1 p f i ( y ) + ξ i * , ϑ f i ( y ) g i ( y ) g i ( y ) + f i ( y ) g i ( y ) ξ i * * , ϑ + 2 ϵ i g i ( y ) b * , ϑ = i = 1 p ξ i * + i = 1 p f i ( y ) g i ( y ) ξ i * * + 2 i = 1 p ϵ i g i ( y ) b * , ϑ = i = 1 p η t ζ t * , ϑ t T η t h t ( x , v t ) + t T η t h t ( y , v t ) .
Together with η t h t ( x , v t ) 0 , x F , and η t h t ( y , v t 0 , we have
i = 1 p f i ( x ) f i ( y ) g i ( y ) g i ( x ) + 2 ϵ i g i ( y ) y x > 0 .
Then, there exists i 0 { 1 , , p } , such that
f i 0 ( x ) f i 0 ( y ) g i 0 ( y ) g i 0 ( x ) + 2 ϵ i 0 g i 0 ( y ) y x > 0 ,
which follows that
f i 0 ( x ) g i 0 ( x ) f i 0 ( y ) g i 0 ( y ) + 2 ϵ i 0 g i 0 ( y ) g i 0 ( x ) y x > 0 .
Moreover, it follows from 0 c g i ( y ) , i = 1 , , p , that
g i 0 ( x ) g i 0 ( y ) .
Together with (10) and (11), we have
f i 0 ( x ) g i 0 ( x ) f i 0 ( y ) g i 0 ( y ) + 2 ϵ i 0 y x > 0 .
which is a contradiction to (5) and (6). Thus, the conclusion holds. □
Now, we give the following example to justify the importance of the assumption of generalized convex-inclusion in Theorem 1.
Example 1. 
Let V t : = [ 1 t , 1 + t ] , t T : = 0 , 1 2 . Let f 1 , f 2 , g 1 , g 2 : R R and g t : R × R R , t T , be defined by
f 1 ( x ) = f 2 ( x ) : = 1 2 | x | + 1 6 x 3 , g 1 ( x ) = g 2 ( x ) : = | x | + 1 ,
and
h t ( x , v t ) : = t x 2 t x 2 v t ,
where x R and v t V t , t T . Then, ( UFP ) becomes
Min R + 2 1 2 | x | + 1 6 x 3 | x | + 1 , 1 2 | x | + 1 6 x 3 | x | + 1 s . t . t x 2 t x 2 v t 0 , t 0 , 1 2 , x R ,
and ( RFP ) becomes
Min R + 2 1 2 | x | + 1 6 x 3 | x | + 1 , 1 2 | x | + 1 6 x 3 | x | + 1 s . t . t x 2 t x 2 v t 0 , v t [ 1 t , 1 + t ] , t 0 , 1 2 , x R .
Obviously, F = [ 1 , 2 ] . Let us consider x ¯ : = 1 F . Then,
f 1 ( x ¯ ) g 1 ( x ¯ ) , f 2 ( x ¯ ) g 2 ( x ¯ ) = 1 6 , 1 6 .
Now, consider the dual problem ( UFD ) . In this setting, ( OFD ) becomes
Max R + 2 f 1 ( y ) g 1 ( y ) , f 2 ( y ) g 2 ( y ) s . t . 0 c f 1 ( y ) + c f 2 ( y ) + f 1 ( y ) g 1 ( y ) c ( g 1 ) ( y ) + f 2 ( y ) g 2 ( y ) c ( g 2 ) ( y ) + t T η t c h t ( · , v t ) ( y ) + 2 ϵ 1 g 1 ( y ) B * + 2 ϵ 2 g 2 ( y ) B * , η t h t ( y , v t ) 0 , t 0 , 1 2 , y R , ϵ 1 0 , ϵ 2 0 , η t 0 , v t [ 1 t , 1 + t ] , t 0 , 1 2 .
Clearly, for any y R and v T V T , we have
c f 1 ( y ) = c f 2 ( y ) = 1 2 y 2 1 2 , 1 2 y 2 + 1 2 ,
c ( g 1 ) ( y ) = c ( g 2 ) ( y ) = 1 , 1 ,
and
c h t ( · , v t ) ( y ) = 2 t y t , t T .
By selecting y ¯ : = 1 , η ¯ t : = 0 , and v ¯ t : = t , we have
c f 1 ( y ¯ ) + c f 2 ( y ¯ ) + f 1 ( y ¯ ) g 1 ( y ¯ ) c ( g 1 ) ( y ¯ ) + f 2 ( y ¯ ) g 2 ( y ¯ ) c ( g 2 ) ( y ¯ ) + t T η ¯ t c h t ( · , v ¯ t ) ( y ¯ ) + 2 ϵ 1 g 1 ( y ¯ ) B * + 2 ϵ 2 g 2 ( y ¯ ) B * = 4 ϵ 1 4 ϵ 2 1 3 , 4 ϵ 1 + 4 ϵ 2 + 7 3 ,
and
η ¯ t h t ( y ¯ , v ¯ t ) 0 , t 0 , 1 2 .
These mean that ( y ¯ , η ¯ T , v ¯ T ) F ^ .
Now, take an arbitrarily ϵ = ( ϵ 1 , ϵ 2 ) R + 2 { 0 } such that ε i < 1 12 , i = 1 , 2 . Clearly,
f 1 ( y ¯ ) g 1 ( y ¯ ) 2 ϵ 1 x ¯ y ¯ , f 2 ( y ¯ ) g 2 ( y ¯ ) 2 ϵ 2 x ¯ y ¯ = 1 3 2 ε 1 , 1 3 2 ε 2 1 6 , 1 6 = f 1 ( x ¯ ) g 1 ( x ¯ ) , f 2 ( x ¯ ) g 2 ( x ¯ ) .
Thus, Theorem 1 is not applicable since ( f , g , h T ) is not generalized convex-inclusion at y ¯ . To do this, by choosing ξ ¯ i : = 0 c f i ( y ¯ ) , i = 1 , 2 , we have
f i ( x ¯ ) f i ( y ¯ ) = 2 3 < 0 = ξ ¯ k , ω , ω R .
Similarly, we obtain the following robust weak duality between ( UMP ) and ( UMD ) .
Corollary 1. 
Let ϵ R + p { 0 } . Suppose that x F and ( y , η T , v T ) F ¯ . If ( f , h T ) is generalized convex on R n at y R n , then,
f 1 ( x ) , , f p ( x ) f 1 ( y ) 2 ϵ 1 x y , , f p ( y ) 2 ϵ p x y .
Remark 6. 
Clearly, by virtue of Example 1, we can also illustrate that the assumption of generalized convexity imposed in Corollary 1 is indispensable.
Now, we give robust strong duality results between ( UFP ) and ( UFD ) .
Theorem 2. 
Let ϵ R + p { 0 } . Assume that ( RSCQ ) holds at x ¯ F . Suppose that ( f , g , h T ) is generalized convex-inclusion on R n at y R n . If x ¯ is a robust ϵ-quasi-efficient solution of ( UFP ) , then there exist η ¯ T R + ( T ) and v ¯ T V T , such that ( x ¯ , η ¯ T , v ¯ T ) F ^ is a robust 2 ϵ -quasi-efficient solution of ( UFD ) .
Proof. 
Assume that x ¯ F is a robust ϵ -quasi-efficient solution of ( UFP ) . By Theorem 1, there exist η ¯ t 0 , and v ¯ t V t , t T , such that
0 i = 1 p f i ( x ¯ ) i = 1 p ϕ i ( x ¯ ) g i ( x ¯ ) + t T η ¯ t h t ( · , v ¯ t ) ( x ¯ ) + 2 i = 1 p ε i g i ( x ¯ ) B * ,
and
η ¯ t h t ( x ¯ , v ¯ t ) = 0 , t T .
From (12), (13) and ϕ i ( x ¯ ) = f i ( x ¯ ) g i ( x ¯ ) , we have
( x ¯ , η ¯ T , v ¯ T ) F ^ .
By Theorem 1, for all ( y , η T , v T ) F ^ , we have
f 1 ( x ¯ ) g 1 ( x ¯ ) , , f p ( x ¯ ) g p ( x ¯ ) f 1 ( y ) g 1 ( y ) 2 ϵ 1 x ¯ y , , f p ( y ) g p ( y ) 2 ϵ p x ¯ y .
Thus, ( x ¯ , η ¯ T , v ¯ T ) is a robust 2 ϵ -quasi-efficient solutions of ( UFD ) . Thus, the conclusion holds. □
Remark 7. 
In [32] (Theorem 4.2), the authors established duality properties for ϵ-quasi-weakly efficient solutions between ( FP ) and its Mond Weir-type dual problem. Therefore, Theorem 2 encompasses [32] (Theorem 4.2), where the corresponding results were given in terms of the similar methods.
Similarly, we give robust strong duality properties for robust ϵ -quasi efficient solutions between ( UMP ) and ( UMD ) .
Corollary 2. 
Let ϵ R + p { 0 } . Assume that ( RSCQ ) holds at x ¯ F . Suppose that ( f , h T ) is generalized convex on R n at y R n . If x ¯ is a robust ϵ-quasi-efficient solution of ( UMP ) , then there exist η ¯ T R + ( T ) and v ¯ T V T , such that ( x ¯ , η ¯ T , v ¯ T ) F ¯ is a robust 2 ϵ -quasi-efficient solution of ( UMD ) .
Now, we give a robust converse-like duality property between ( UFP ) and ( UFD ) .
Theorem 3. 
Let ε R + p { 0 } and ( x ¯ , η ¯ T , v ¯ T ) F ^ . If ( f , g , h T ) is generalized convex-inclusion on R n at x ¯ F , then, x ¯ F is a robust 2 ε -quasi efficient solution of ( UMP ) .
Proof. 
Sine ( x ¯ , η ¯ T , v ¯ T ) F ^ and ( f , g , h T ) is generalized convex-inclusion on R n at x ¯ , it follows from Theorem 1 that
f 1 ( x ) g 1 ( x ) , , f p ( x ) g p ( x ) f 1 ( x ¯ ) g 1 ( x ¯ ) 2 ϵ 1 x x ¯ , , f p ( x ¯ ) g p ( x ¯ ) 2 ϵ p x x ¯ | , x F .
Therefore, x ¯ F is a robust 2 ε -quasi efficient solution of ( UFP ) and the proof is complete. □
Remark 8. 
Note that the converse-like duality result obtained in Theorem 3 extends [32] (Theorem 4.4) from the deterministic (i.e., with singleton uncertainty sets) to the robust setting. Moreover, Theorem 3 extends [43] (Theorem 4.3) from the scalar case to the multi-objective setting.
Similarly, we have the following results for ( UMP ) and ( UMD ) , which has been considered in [21] (Theorem 4.3).
Corollary 3. 
Let ε R + p { 0 } and ( x ¯ , η ¯ T , v ¯ T ) F ¯ . If ( f , h T ) is generalized convex on R n at x ¯ F , then, x ¯ F is a robust ε-quasi efficient solution of ( UMP ) .

4. Conclusions

In this paper, we consider robust ε -quasi-efficient solutions for a class of uncertain fractional optimization problems. By employing robust optimization and the obtained optimality conditions, a Mond–Weir-type robust dual problem for the fractional optimization problem is established. Then, we give robust ε -quasi-weak, strong and converse duality properties between them in terms of generalized convex-inclusion assumptions. We also show that the obtained results extend the corresponding results obtained in [21,32,37].
In the future, similar to [21,43], it is of interest to formulate Mixed-type robust approximate dual problem of uncertain fractional optimization problems, and study robust ε -quasi-weak, strong, and converse duality properties between them.

Funding

This research was supported by the Natural Science Foundation of Chongqing (Grant no.: cstc2021jcyj-msxmX1191) and the Research Fund of Chongqing Technology and Business University (Grant no.: 2156011).

Data Availability Statement

Not applicable.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Chankong, V.; Haimes, Y.Y. Multiobjective Decision Making: Theory and Methodology; North-Holland: New York, NY, USA, 1983. [Google Scholar]
  2. Liu, J. ϵ-duality theorem of nondifferentiable nonconvex multiobjective programming. J. Optim. Theory Appl. 1991, 69, 153–167. [Google Scholar] [CrossRef]
  3. Caristi, G.; Ferrara, M.; Stefanescu, A. Semi-infinite multiobjective programming with generalized invexity. Math. Rep. 2010, 12, 217–233. [Google Scholar]
  4. Fan, X.; Cheng, C.; Wang, H. Density of stable convex semi-infinite vector optimization problems. Oper. Res. Lett. 2012, 40, 140–143. [Google Scholar] [CrossRef]
  5. Huy, N.Q.; Kim, D.S. Lipschitz behavior of solutions to nonconvex semi-infinite vector optimization problems. J. Glob. Optim. 2013, 56, 431–448. [Google Scholar] [CrossRef]
  6. Verma, R.U. Weak ϵ-efficiency conditions for multiobjective fractional programming. Appl. Math. Comput. 2013, 219, 6819–6827. [Google Scholar] [CrossRef]
  7. Chuong, T.D.; Kim, D.S. Approximate solutions of multiobjective optimization problems. Positivity 2016, 20, 187–207. [Google Scholar] [CrossRef]
  8. Kim, D.S.; Son, T.Q. An approach to ε-duality theorems for nonconvex semi-infinite multiobjective optimization problems. Taiwan J. Math. 2018, 22, 1261–1287. [Google Scholar] [CrossRef]
  9. Peng, Z.Y.; Peng, J.W.; Long, X.J.; Yao, J.C. On the stability of solutions for semi-infinite vector optimization problems. J. Glob. Optim. 2018, 70, 55–69. [Google Scholar] [CrossRef]
  10. Peng, Z.Y.; Wang, X.; Yang, X.M. Connectedness of approximate efficient solutions for generalized semi-infinite vector optimization problems. Set-Valued Var. Anal. 2019, 27, 103–118. [Google Scholar] [CrossRef]
  11. Son, T.Q.; Tuyen, N.V.; Wen, C.F. Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints. Acta Math. Vietnam 2020, 45, 435–448. [Google Scholar] [CrossRef]
  12. Long, X.J.; Liu, J.; Huang, N.J. Characterizing the solution set for nonconvex semi-infinite programs involving tangential subdifferentials. Numer. Funct. Anal. Optim. 2021, 42, 279–297. [Google Scholar] [CrossRef]
  13. Sun, X.K.; Mo, X.Q.; Teo, K.L. On weighted robust approximate solutions for semi-infinite optimization with uncertain data. J. Nonlinear Convex Anal. 2021, 22, 2507–2524. [Google Scholar]
  14. Ben-Tal, A.; Nemirovski, A. Robust optimization-methodology and applications. Math. Program. 2002, 92, 453–480. [Google Scholar] [CrossRef]
  15. Ben-Tal, A.; Ghaoui, L.E.; Nemirovski, A. Robust Optimization; Princeton University Press: Princeton, NJ, USA, 2009. [Google Scholar]
  16. Bertsimas, D.; Brown, D.B.; Caramanis, C. Theory and applications of robust optimization. SIAM Rev. 2011, 53, 464–501. [Google Scholar] [CrossRef]
  17. Lee, G.M.; Lee, J.H. On nonsmooth optimality theorems for robust multiobjective optimization problems. J. Nonlinear Convex Anal. 2015, 16, 2039–2052. [Google Scholar]
  18. Chen, J.W.; Köbis, E.; Yao, J.C. Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints. J. Optim. Theory Appl. 2019, 181, 411–436. [Google Scholar] [CrossRef]
  19. Guo, T.T.; Yu, G.L. Optimality conditions of the approximate quasi-weak robust efficiency for uncertain multi-objective convex optimization. Pac. J. Optim. 2019, 15, 623–638. [Google Scholar]
  20. Sun, X.K.; Tang, L.P.; Zeng, J. Characterizations of approximate duality and saddle point theorems for nonsmooth robust vector optimization. Numer. Funct. Anal. Optim. 2020, 41, 462–482. [Google Scholar] [CrossRef]
  21. Sun, X.K.; Teo, K.L.; Long, X.J. Some characterizations of approximate solutions for robust semi-infinite optimization problems. J. Optim. Theory Appl. 2021, 191, 281–310. [Google Scholar] [CrossRef]
  22. Sun, X.K.; Tan, W.; Teo, K.L. Characterizing a class of robust vector polynomial optimization via sum of squares conditions. J. Optim. Theory Appl. 2023, 197, 737–764. [Google Scholar] [CrossRef]
  23. Liu, J.; Long, X.J.; Sun, X.K. Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferential. J. Glob. Optim. 2023, 87, 481–501. [Google Scholar] [CrossRef]
  24. Egudo, R. Multiobjective fractional duality. Bull. Austral. Math. Soc. 1988, 37, 367–378. [Google Scholar] [CrossRef]
  25. Liu, J.C.; Yokoyama, K. ϵ-Optimality and duality for multiobjective fractional programming. Comput. Math. Appl. 1999, 37, 119–128. [Google Scholar] [CrossRef]
  26. Long, X.J.; Huang, N.J.; Liu, Z.B. Optimality conditions, duality and saddle points for nondifferentiable multiobjective fractional programs. J. Ind. Manag. Optim. 2008, 4, 287–298. [Google Scholar] [CrossRef]
  27. Long, X.J. Optimality conditions and duality for nondifferentiable multiobjective fractional programming problems with (C, α, ρ, d)-convexity. J. Optim. Theory Appl. 2011, 148, 197–208. [Google Scholar] [CrossRef]
  28. Khanh, P.Q.; Tung, L.T. First- and second-order optimality conditions for multiobjective fractional programming. Top 2015, 23, 419–440. [Google Scholar] [CrossRef]
  29. Chuong, T.D. Nondifferentiable fractional semi-infinite multiobjective optimization problems. Oper. Res. Lett. 2016, 44, 260–266. [Google Scholar] [CrossRef]
  30. Stancu-Minasian, I.M. A ninth bibliography of fractional programming. Optimization 2019, 68, 2125–2169. [Google Scholar] [CrossRef]
  31. Shitkovskaya, T.; Hong, Z.; Kim, D.S.; Piao, G.R. Approximate necessary optimality in fractional semi-infinite multiobjective optimization. J. Nonlinear Convex Anal. 2020, 21, 195–204. [Google Scholar]
  32. Shitkovskaya, T.; Jiao, L.; Kim, D.S. Multi-criteria optimization problems with fractional objectives: Approximate optimality and approximate duality. J. Nonlinear Convex Anal. 2021, 22, 1117–1131. [Google Scholar]
  33. Su, T.V.; Hang, D.D. Optimality and duality in nonsmooth multiobjective fractional programming problem with constraints. 4OR-Q. J. Oper. Res. 2022, 20, 105–137. [Google Scholar]
  34. Sun, X.K.; Long, X.J.; Fu, H.Y.; Li, X.B. Some characterizations of robust optimal solutions for uncertain fractional optimization and applications. J. Ind. Manag. Optim. 2017, 13, 803–824. [Google Scholar] [CrossRef]
  35. Li, X.B.; Wang, Q.L.; Lin, Z. Optimality conditions and duality for minimax fractional programming problems with data uncertainty. J. Ind. Manag. Optim. 2019, 15, 1133–1151. [Google Scholar] [CrossRef]
  36. Antczak, T. Parametric approach for approximate efficiency of robust multiobjective fractional programming problems. Math. Methods Appl. Sci. 2021, 44, 11211–11230. [Google Scholar] [CrossRef]
  37. Sun, X.K.; Feng, X.Y.; Teo, K.L. Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data. Optim. Lett. 2022, 16, 1457–1476. [Google Scholar] [CrossRef]
  38. Thuy, N.T.T.; Su, T.V. Robust optimality conditions and duality for nonsmooth multiobjective fractional semi-infinite programming problems with uncertain data. Optimization 2023, 72, 1745–1775. [Google Scholar] [CrossRef]
  39. Rockafellar, R.T. Convex Analysis; Princeton University Press: Princeton, NJ, USA, 1970. [Google Scholar]
  40. Clarke, F.H. Optimization and Nonsmooth Analysis; Willey: New York, NY, USA, 1983. [Google Scholar]
  41. Goberna, M.; López, M.A. Linear Semi-Infinite Optimization; Wiley: Chichester, UK, 1998. [Google Scholar]
  42. Sun, X.K.; Teo, K.L.; Long, X.J. Characterizations of robust ε-quasi optimal solutions for nonsmooth optimization problems with uncertain data. Optimization 2021, 70, 847–870. [Google Scholar] [CrossRef]
  43. Sun, X.K.; Teo, K.L.; Zeng, J.; Liu, L.Y. Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty. Optimization 2020, 69, 2109–2129. [Google Scholar] [CrossRef]
  44. Feng, X.Y.; Sun, X.K. Characterizations of approximate optimality conditions for fractional semi-infinite optimization problems with uncertainty. Appl. Math. Mech. 2022, 43, 682–689. [Google Scholar]
  45. Zeng, J.; Xu, P.; Fu, H.Y. On robust approximate optimal solutions for fractional semi-infinite optimization with uncertainty data. J. Inequal. Appl. 2019, 2019, 45. [Google Scholar] [CrossRef]
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

Guo, X. On Mond–Weir-Type Robust Duality for a Class of Uncertain Fractional Optimization Problems. Axioms 2023, 12, 1029. https://doi.org/10.3390/axioms12111029

AMA Style

Guo X. On Mond–Weir-Type Robust Duality for a Class of Uncertain Fractional Optimization Problems. Axioms. 2023; 12(11):1029. https://doi.org/10.3390/axioms12111029

Chicago/Turabian Style

Guo, Xiaole. 2023. "On Mond–Weir-Type Robust Duality for a Class of Uncertain Fractional Optimization Problems" Axioms 12, no. 11: 1029. https://doi.org/10.3390/axioms12111029

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