Next Article in Journal
Proposed Shaft Coupling Based on RPRRR Mechanism: Positional Analysis and Consequences
Next Article in Special Issue
A Self Adaptive Three-Step Numerical Scheme for Variational Inequalities
Previous Article in Journal
Poisson Bracket Filter for the Effective Lagrangians
Previous Article in Special Issue
Robust Optimality Conditions for a Class of Fractional Optimization Problems
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On Sufficiency Conditions for Some Robust Variational Control Problems

1
Financial Mathematics and Actuarial Science (FMAS)—Research Group, Department of Mathematics, Faculty of Sciences, King Abdulaziz University, Jeddah 21589, Saudi Arabia
2
Department of Applied Mathematics, University Politehnica of Bucharest, 060042 Bucharest, Romania
3
Academy of Romanian Scientists, 54 Splaiul Independentei, 050094 Bucharest, Romania
4
Fundamental Sciences Applied in Engineering—Research Center (SFAI), University Politehnica of Bucharest, 060042 Bucharest, Romania
*
Author to whom correspondence should be addressed.
Axioms 2023, 12(7), 705; https://doi.org/10.3390/axioms12070705
Submission received: 21 June 2023 / Revised: 15 July 2023 / Accepted: 18 July 2023 / Published: 20 July 2023

Abstract

:
We study the sufficient optimality conditions for a class of fractional variational control problems involving data uncertainty in the cost functional. Concretely, by using the parametric technique, we prove the sufficiency of the robust necessary optimality conditions by considering convexity, quasi-convexity, strictly quasi-convexity, and/or monotonic quasi-convexity assumptions of the involved functionals.

1. Introduction

To study practical, concrete, or real-life problems coming from economics, decision theory, production inventory, data classification, game theory, or portfolio selection, optimization models and control theory are widely used. Since practical problems are often governed by estimation or measurement, some errors may occur. Most of the time, the presence of various errors may contradict the computational results associated with the original problem. To overcome this issue, the use of a robust approach to represent data, the presence of fuzzy numbers, or the use of interval analysis, has become an important research direction in the last decades.
Optimizing the ratio of two objective or cost functions or functionals, means to study a fractional optimization problem. Thus, Dinkelbach [1] and Jagannathan [2] succeeded to transform it into an equivalent non-fractional optimization problem, by considering a parametric approach. In time, many researchers have considered this technique to study and solve various fractional variational problems. We mention the works of Mititelu [3], Antczak and Pitea [4], Mititelu and Treanţă [5], Antczak [6]. For other ideas on this subject, interested readers are directed to Patel [7], Nahak [8], Manesh et al. [9], Kim and Kim [10,11,12] and references therein. Noor [13] considered and introduced some new concepts of the biconvex functions involving an arbitrary bifunction and function. More precisely, Noor has shown that the optimality conditions for the general biconvex functions can be characterized by a class of bivariational-like inequalities.
Optimization and variational problems with uncertain data arise when we have inadequate information, old sources, a large volume of data, sample disparity, or some other factors leading to data uncertainty. To investigate these cases, the robust technique is intensively used in studying the optimization problem with data uncertainty. This approach reduces the uncertainty associated with the original problem. Several researchers stated and investigated different optimization or variational problems involving data uncertainty, and they tried to establish novel and efficient results (see Jeyakumar et al. [14], Beck and Tal [15], Baranwal et al. [16], Treanţă [17,18], Preeti et al. [19], Jayswal et al. [20]).
Over time, optimal control problems subject to nonlinear equality and/or inequality-type constraints (governed by ordinary differential equations) have been formulated and studied by many researchers. But, since so many phenomena are subject to laws involving partial differential equations or partial differential inequations (PDEs/PDIs), it is generated the need for a consistent analysis of scalar/vector variational control problems with PDE/PDI or isoperimetric-type constraints and multiple/path-independent curvilinear integral cost functionals. Of course, the multiple/curvilinear integrals in the calculus of variations have been considered and studied so far, but, these multiple/curvilinear integrals were not sufficiently analyzed in the context of robust optimal control models. Because of the increasing complexity of the environment, the initial data often suffer from inaccuracy. Therefore, an adequate uncertainty framework is necessary to formulate the model and new methods have to be adapted or developed to provide optimal or efficient solutions in a certain sense. The current paper is situated around the studies of robust/uncertain optimization problems.
Next, we formulate a fractional variational control problem with mixed constraints and data uncertainty in the cost functional (given by path-independent curvilinear-type integral). Further, we state the robust necessary optimality conditions and prove their sufficiency by using the convexity, quasi-convexity, strictly quasi-convexity, and/or monotonic quasi-convexity assumptions of the involved functionals. Moreover, we introduce and describe the robust Kuhn-Tucker points associated with the considered optimization problem. The most important and principal credits of the present paper are the following: (i) we introduce, by using the parametric technique, the notions of robust optimal solution and robust Kuhn-Tucker point for the case of curvilinear integral-type functionals, (ii) we state novel proofs for the main results, and (iii) we build a new framework determined by spaces of functions and by curvilinear integral-type functionals.
We continue the paper as follows. Section 2 states the basic concepts, notations, and assumptions used to formulate the principal results. In Section 3, by considering suitable convexity, quasi-convexity, strictly quasi-convexity, and/or monotonic quasi-convexity hypotheses, we establish robust sufficient optimality conditions for the considered problem. In addition, we describe the notion of robust Kuhn-Tucker point. Finally, in Section 4 we present the conclusions and formulate some future research directions for this paper.

2. Auxiliary Tools

In the following, we consider the basic concepts, notations, and assumptions used to formulate the principal results. Thus, we start with the classical finite-dimensional Euclidean spaces R m , R n and R l , with t = ( t η ) , η = 1 , m ¯ (that is, t = ( t 1 , , t m ) ), u = ( u ι ) , ι = 1 , n ¯ , and v = ( v j ) , j = 1 , l ¯ as arbitrary points of R m , R n and R l , respectively. Let H = H t 0 , t 1 R m be a hyper-parallelepiped, having the diagonally opposite corners t 0 = ( t 0 η ) and t 1 = ( t 1 η ) , η = 1 , m ¯ , and let C H be a curve (piecewise differentiable), joining the points t 0 = ( t 0 η ) and t 1 = ( t 1 η ) in R m . Define
U = u : H R n | u = piecewise smooth function ,
V = v : H R l | v = piecewise continuous function
as the space of piecewise smooth functions (state variables), and the space of piecewise continuous functions (control variables), respectively, and assume the product space U × V is endowed with the norm induced by the following inner product
( u , v ) , ( b , z ) = C u ( t ) · b ( t ) + v ( t ) · z ( t ) d t π
= C ι = 1 n u ι ( t ) b ι ( t ) + j = 1 l v j ( t ) z j ( t ) d t π , ( u , v ) , ( b , z ) U × V .
Using the above mathematical notations and elements, by denoting u η ( t ) = u t η ( t ) , we formulate the following first-order P D E & P D I -constrained fractional optimization problem, with data uncertainty in the objective functional, as follows
( P ) min ( u ( · ) , v ( · ) ) C Δ π ( t , u ( t ) , u η ( t ) , v ( t ) , f ) d t π C Θ π ( t , u ( t ) , u η ( t ) , v ( t ) , g ) d t π
subject to A β ( t , u ( t ) , u η ( t ) , v ( t ) ) 0 , β = 1 , q ¯ , t H , B η ι ( t , u ( t ) , u η ( t ) , v ( t ) ) : = u t η ( t ) Q η ι ( t , u ( t ) , v ( t ) ) = 0 , ι = 1 , n ¯ , η = 1 , m ¯ , t H , u ( t 0 ) = u 0 = given , u ( t 1 ) = u 1 = given ,
where f and g are some uncertainty parameters in the convex compact sets F R and G R , respectively, and Δ = ( Δ π ) : H × U 2 × V × F R m , Θ = ( Θ π ) : H × U 2 × V × G R m { 0 } , A β : H × U 2 × V R , β = 1 , q ¯ , B η ι : H × U 2 × V R , ι = 1 , n ¯ , η = 1 , m ¯ , are assumed to be continuously differentiable functionals.
Definition 1.
The above functionals
C Δ π ( t , u ( t ) , u η ( t ) , v ( t ) , f ) d t π
and
C Θ π ( t , u ( t ) , u η ( t ) , v ( t ) , g ) d t π
are named path-independent if D η Δ π = D π Δ η and D η Θ π = D π Θ η , for π η .
Assumption 1.
By considering the above functionals
C Δ π ( t , u ( t ) , u η ( t ) , v ( t ) , f ) d t π
and
C Θ π ( t , u ( t ) , u η ( t ) , v ( t ) , g ) d t π
are path-independent, the following working hypothesis is assumed:
d L : = D η h π u η ( u u 0 ) d t π
is a total exact differential, with L ( t 0 ) = L ( t 1 ) , h { Δ , Θ } .
The robust counterpart for ( P ) , reducing the possible uncertainties in ( P ) , is given as
( RP ) min ( u ( · ) , v ( · ) ) C max f F Δ π ( t , u ( t ) , u η ( t ) , v ( t ) , f ) d t π C min g G Θ π ( t , u ( t ) , u η ( t ) , v ( t ) , g ) d t π subject to A β ( t , u ( t ) , u η ( t ) , v ( t ) ) 0 , β = 1 , q ¯ , t H , B η ι ( t , u ( t ) , u η ( t ) , v ( t ) ) = 0 , ι = 1 , n ¯ , η = 1 , m ¯ , t H , u ( t 0 ) = u 0 = given , u ( t 1 ) = u 1 = given ,
where Δ = ( Δ π ) , Θ = ( Θ π ) , A = ( A β ) and B = ( B η ι ) are defined as in ( P ) .
The set of all feasible solutions to ( RP ) , which is the same as the set of all feasible solutions to ( P ) , is defined as
D = { ( u , v ) U × V | A β ( t , u ( t ) , u η ( t ) , v ( t ) ) 0 , B η ι ( t , u ( t ) , u η ( t ) , v ( t ) ) = 0 ,
u ( t 0 ) = u 0 = given , u ( t 1 ) = u 1 = given , t H } .
For ( u , v ) D , we assume that Δ 0 and Θ > 0 . Further, by considering the positive real number
R f , g 0 = min ( u ( · ) , v ( · ) ) C max f F Δ π ( t , u ( t ) , u η ( t ) , v ( t ) , f ) d t π C min g G Θ π ( t , u ( t ) , u η ( t ) , v ( t ) , g ) d t π = C max f F Δ π ( t , u 0 ( t ) , u η 0 ( t ) , v 0 ( t ) , f ) d t π C min g G Θ π ( t , u 0 ( t ) , u η 0 ( t ) , v 0 ( t ) , g ) d t π ,
on the line of Jagannathan [2], Dinkelbach [1], and following Mititelu and Treanţă [5], we build a non-fractional optimization problem associated with ( P ) , as
( NP ) min ( u ( · ) , v ( · ) ) C Δ π ( t , u ( t ) , u η ( t ) , v ( t ) , f ) d t π R f , g 0 C Θ π ( t , u ( t ) , u η ( t ) , v ( t ) , g ) d t π subject to A β ( t , u ( t ) , u η ( t ) , v ( t ) ) 0 , β = 1 , q ¯ , t H , B η ι ( t , u ( t ) , u η ( t ) , v ( t ) ) = 0 , ι = 1 , n ¯ , η = 1 , m ¯ , t H , u ( t 0 ) = u 0 = given , u ( t 1 ) = u 1 = given .
The robust counterpart for ( NP ) is given by
( RNP ) min ( u ( · ) , v ( · ) ) { C max f F Δ π ( t , u ( t ) , u η ( t ) , v ( t ) , f ) d t π R f , g 0 C min g G Θ π ( t , u ( t ) , u η ( t ) , v ( t ) , g ) d t π } subject to A β ( t , u ( t ) , u η ( t ) , v ( t ) ) 0 , β = 1 , q ¯ , t H , B η ι ( t , u ( t ) , u η ( t ) , v ( t ) ) = 0 , ι = 1 , n ¯ , η = 1 , m ¯ , t H , u ( t 0 ) = u 0 = given , u ( t 1 ) = u 1 = given .
Next, for a simple presentation, we will use the following abbreviations throughout the paper: u = u ( t ) , v = v ( t ) , u ¯ = u ¯ ( t ) , v ¯ = v ¯ ( t ) , u ^ = u ^ ( t ) , v ^ = v ^ ( t ) ,   ζ = ( t , u ( t ) , u η ( t ) , v ( t ) ) , ζ ¯ = ( t , u ¯ ( t ) , u ¯ η ( t ) , v ¯ ( t ) ) , ζ ^ = ( t , u ^ ( t ) , u ^ η ( t ) , v ^ ( t ) ) .
Definition 2.
A point ( u ¯ , v ¯ ) D is said to be a robust optimal solution to ( P ) , if
C max f F Δ π ( ζ ¯ , f ) d t π C min g G Θ π ( ζ ¯ , g ) d t π C max f F Δ π ( ζ , f ) d t π C min g G Θ π ( ζ , g ) d t π ,
for all ( u , v ) D .
Definition 3.
A point ( u ¯ , v ¯ ) D is said to be a robust optimal solution to ( NP ) , if
C max f F Δ π ( ζ ¯ , f ) d t π R f , g C min g G Θ π ( ζ ¯ , g ) d t π C max f F Δ π ( ζ , f ) d t π R f , g C min g G Θ π ( ζ , g ) d t π ,
for all ( u , v ) D .
Remark 1.
We can observe that D is the set of feasible solutions to ( NP ) (and, also, for ( RNP ) ).
Remark 2.
The robust optimal solutions to ( P ) (or ( NP ) ) are also robust optimal solutions to ( RP ) (or ( RNP ) ).
Next, in order to prove the principal results of this paper, we present the definition of convex, quasi-convex, strictly quasi-convex, and monotonic quasi-convex curvilinear integral functionals (see, for instance, Treanţă [21]).
Definition 4.
A curvilinear integral functional C Δ π ( ζ , f ¯ ) d t π is said to be convex at ( u ¯ , v ¯ ) U × V if the following inequality
C Δ π ( ζ , f ¯ ) d t π C Δ π ( ζ ¯ , f ¯ ) d t π C ( u u ¯ ) Δ π u ( ζ ¯ , f ¯ ) + ( v v ¯ ) Δ π v ( ζ ¯ , f ¯ ) d t π
+ C ( u η u ¯ η ) Δ π u η ( ζ ¯ , f ¯ ) d t π
holds, for all ( u , v ) U × V .
Definition 5.
A curvilinear integral functional C Δ π ( ζ , f ¯ ) d t π is said to be quasi-convex at ( u ¯ , v ¯ ) U × V if the following inequality
C Δ π ( ζ , f ¯ ) d t π C Δ π ( ζ ¯ , f ¯ ) d t π
implies
C ( u u ¯ ) Δ π u ( ζ ¯ , f ¯ ) + ( v v ¯ ) Δ π v ( ζ ¯ , f ¯ ) d t π
+ C ( u η u ¯ η ) Δ π u η ( ζ ¯ , f ¯ ) d t π 0 ,
for all ( u , v ) U × V .
Definition 6.
A curvilinear integral functional C Δ π ( ζ , f ¯ ) d t π is said to be strictly quasi-convex at ( u ¯ , v ¯ ) U × V if the following inequality
C Δ π ( ζ , f ¯ ) d t π C Δ π ( ζ ¯ , f ¯ ) d t π
implies
C ( u u ¯ ) Δ π u ( ζ ¯ , f ¯ ) + ( v v ¯ ) Δ π v ( ζ ¯ , f ¯ ) d t π
+ C ( u η u ¯ η ) Δ π u η ( ζ ¯ , f ¯ ) d t π < 0 ,
for all ( u , v ) ( u ¯ , v ¯ ) U × V .
Definition 7.
A curvilinear integral functional C Δ π ( ζ , f ¯ ) d t π is said to be monotonic quasi-convex at ( u ¯ , v ¯ ) U × V if the following inequality
C Δ π ( ζ , f ¯ ) d t π = C Δ π ( ζ ¯ , f ¯ ) d t π
implies
C ( u u ¯ ) Δ π u ( ζ ¯ , f ¯ ) + ( v v ¯ ) Δ π v ( ζ ¯ , f ¯ ) d t π
+ C ( u η u ¯ η ) Δ π u η ( ζ ¯ , f ¯ ) d t π = 0 ,
for all ( u , v ) U × V .
Remark 3.
The relationships between the various convexities proposed in this article are discussed and illustrated with suitable examples in previous research works (see, for instance, Mititelu and Treanţă [5] and Jayswal et al. [22]).

3. Robust Sufficient Optimality Conditions

Next, by considering suitable convexity, quasi-convexity, strictly quasi-convexity, and/or monotonic quasi-convexity hypotheses, we establish robust sufficient optimality conditions for the considered problem. In addition, in accordance with Treanţă and Arana-Jiménez [23], we describe the notion of robust Kuhn-Tucker point.
The next Proposition provides an auxiliary result to establish the robust sufficient optimality conditions for ( P ) (see Saeed [24]).
Proposition 1.
If ( u ¯ , v ¯ ) D is a robust optimal solution to ( P ) , then there exists the positive real number R f , g such that ( u ¯ , v ¯ ) D is a robust optimal solution to ( NP ) . Moreover, if ( u ¯ , v ¯ ) D is a robust optimal solution to ( NP ) and R f , g = C max f F Δ π ( ζ ¯ , f ) d t π C min g G Θ π ( ζ ¯ , g ) d t π , then ( u ¯ , v ¯ ) D is a robust optimal solution to ( P ) .
The next result formulates the robust necessary conditions of optimality for ( P ) (see Saeed [24]).
Theorem 1.
Consider ( u ¯ , v ¯ ) D is a robust optimal solution for the robust fractional optimization problem ( P ) and max f F Δ π ( ζ , f ) = Δ π ( ζ , f ¯ ) , min g G Θ π ( ζ , g ) = Θ π ( ζ , g ¯ ) . Then, there exist θ ¯ R and the piecewise differentiable functions μ ¯ = ( μ ¯ β ( t ) ) R + q , λ ¯ = ( λ ¯ η ι ( t ) ) R n m , satisfying
θ ¯ Δ π , u ( ζ ¯ , f ¯ ) R f , g Θ π , u ( ζ ¯ , g ¯ ) + μ ¯ T A u ( ζ ¯ ) + λ ¯ T B u ( ζ ¯ )
t η θ ¯ Δ π , u η ( ζ ¯ , f ¯ ) R f , g Θ π , u η ( ζ ¯ , g ¯ ) + μ ¯ T A u η ( ζ ¯ ) + λ ¯ T B u η ( ζ ¯ ) = 0 ,
θ ¯ Δ π , v ( ζ ¯ , f ¯ ) R f , g Θ π , v ( ζ ¯ , g ¯ ) + μ ¯ T A v ( ζ ¯ ) + λ ¯ T B v ( ζ ¯ ) = 0 ,
μ ¯ T A ( ζ ¯ ) = 0 , μ ¯ β 0 , β = 1 , q ¯ ,
θ ¯ 0 ,
for t H , π = 1 , m ¯ , except at points of discontinuity.
Remark 4.
The relations (1)–(4) in Theorem 1 are called robust necessary optimality conditions for the robust fractional optimization problem ( P ) .
Definition 8.
The feasible solution ( u ¯ , v ¯ ) D is said to be a normal robust optimal solution to ( P ) if θ ¯ > 0 (see Theorem 1).
Next, in accordance to Treanţă and Arana-Jiménez [23], we introduce and describe the robust Kuhn-Tucker point associated with ( P ) .
Definition 9.
Let max f F Δ π ( ζ , f ) = Δ π ( ζ , f ¯ ) , min g G Θ π ( ζ , g ) = Θ π ( ζ , g ¯ ) . The robust feasible solution ( u ¯ , v ¯ ) is said to be a robust Kuhn-Tucker point of ( P ) if there exist the piecewise differentiable functions μ ¯ = ( μ ¯ β ( t ) ) R + q , λ ¯ = ( λ ¯ η ι ( t ) ) R n m , satisfying
Δ π , u ( ζ ¯ , f ¯ ) R f , g Θ π , u ( ζ ¯ , g ¯ ) + μ ¯ T A u ( ζ ¯ ) + λ ¯ T B u ( ζ ¯ )
t η Δ π , u η ( ζ ¯ , f ¯ ) R f , g Θ π , u η ( ζ ¯ , g ¯ ) + μ ¯ T A u η ( ζ ¯ ) + λ ¯ T B u η ( ζ ¯ ) = 0 ,
Δ π , v ( ζ ¯ , f ¯ ) R f , g Θ π , v ( ζ ¯ , g ¯ ) + μ ¯ T A v ( ζ ¯ ) + λ ¯ T B v ( ζ ¯ ) = 0 ,
μ ¯ T A ( ζ ¯ ) = 0 , μ ¯ β 0 , β = 1 , q ¯ ,
for t H , π = 1 , m ¯ , except at points of discontinuity.
Taking into account the above-mentioned definition, we formulate the following theorem.
Theorem 2.
If ( u ¯ , v ¯ ) D is a normal robust optimal solution for the robust fractional optimization problem ( P ) , with max f F Δ π ( ζ , f ) = Δ π ( ζ , f ¯ ) , min g G Θ π ( ζ , g ) = Θ π ( ζ , g ¯ ) , then ( u ¯ , v ¯ ) D is a robust Kuhn-Tucker point of ( P ) .
Proof. 
Let us consider max f F Δ π ( ζ , f ) = Δ π ( ζ , f ¯ ) , min g G Θ π ( ζ , g ) = Θ π ( ζ , g ¯ ) . Since ( u ¯ , v ¯ ) D is a robust optimal solution of ( P ) , by Theorem 1, there exist θ ¯ R and the piecewise differentiable functions μ ¯ = ( μ ¯ β ( t ) ) R + q , λ ¯ = ( λ ¯ η ι ( t ) ) R n m , satisfying
θ ¯ Δ π , u ( ζ ¯ , f ¯ ) R f , g Θ π , u ( ζ ¯ , g ¯ ) + μ ¯ T A u ( ζ ¯ ) + λ ¯ T B u ( ζ ¯ )
t η θ ¯ Δ π , u η ( ζ ¯ , f ¯ ) R f , g Θ π , u η ( ζ ¯ , g ¯ ) + μ ¯ T A u η ( ζ ¯ ) + λ ¯ T B u η ( ζ ¯ ) = 0 ,
θ ¯ Δ π , v ( ζ ¯ , f ¯ ) R f , g Θ π , v ( ζ ¯ , g ¯ ) + μ ¯ T A v ( ζ ¯ ) + λ ¯ T B v ( ζ ¯ ) = 0 ,
μ ¯ T A ( ζ ¯ ) = 0 , μ ¯ β 0 , β = 1 , q ¯ ,
θ ¯ 0 ,
for t H , π = 1 , m ¯ , except at points of discontinuity. As ( u ¯ , v ¯ ) D is assumed to be a normal robust optimal solution, we can take θ ¯ = 1 > 0 and this completes the proof. □
Next, under only convexity assumptions of the considered functionals, a result is provided for the sufficiency of the robust necessary optimality conditions established in Theorem 1.
Theorem 3.
Let ( u ¯ , v ¯ ) D be a feasible solution to ( P ) such that the robust necessary optimality conditions given in (1)–(4) are satisfied, max f F Δ π ( ζ , f ) = Δ π ( ζ , f ¯ ) , min g G Θ π ( ζ , g ) = Θ π ( ζ , g ¯ ) , and consider
C θ ¯ Δ π ( ζ , f ¯ ) R f , g Θ π ( ζ , g ¯ ) d t π , C μ ¯ T A ( ζ ) d t π , C λ ¯ T B ( ζ ) d t π
are convex at ( u ¯ , v ¯ ) D . Then the pair ( u ¯ , v ¯ ) is a robust optimal solution to ( P ) .
Proof. 
By contrary, let us suppose that ( u ¯ , v ¯ ) is not a robust optimal solution to ( P ) . Then, there exists ( u ^ , v ^ ) D with the property (according to Proposition 1)
C max f F Δ π ( ζ ^ , f ) d t π R f , g C min g G Θ π ( ζ ^ , g ) d t π
< C max f F Δ π ( ζ ¯ , f ) d t π R f , g C min g G Θ π ( ζ ¯ , g ) d t π .
By considering max f F Δ π ( ζ , f ) = Δ π ( ζ , f ¯ ) , min g G Θ π ( ζ , g ) = Θ π ( ζ , g ¯ ) , we get
C Δ π ( ζ ^ , f ¯ ) d t π R f , g C Θ π ( ζ ^ , g ¯ ) d t π
< C Δ π ( ζ ¯ , f ¯ ) d t π R f , g C Θ π ( ζ ¯ , g ¯ ) d t π .
By hypothesis, we have considered ( u ¯ , v ¯ ) fulfills the conditions ( 1 ) ( 4 ) . By multiplying Equations ( 1 ) and ( 2 ) by ( u ^ u ¯ ) and ( v ^ v ¯ ) , respectively, and integrating them, we get
C ( u ^ u ¯ ) { θ ¯ [ Δ π , u ( ζ ¯ , f ¯ ) R f , g Θ π , u ( ζ ¯ , g ¯ ) ] + μ ¯ T A u ( ζ ¯ ) + λ ¯ T B u ( ζ ¯ )
t η θ ¯ [ Δ π , u η ( ζ ¯ , f ¯ ) R f , g Θ π , u η ( ζ ¯ , g ¯ ) ] + μ ¯ T A u η ( ζ ¯ ) + λ ¯ T B u η ( ζ ¯ ) } d t π
+ C ( v ^ v ¯ ) { θ ¯ [ Δ π , v ( ζ ¯ , f ¯ ) R f , g Θ π , v ( ζ ¯ , g ¯ ) ] + μ ¯ T A v ( ζ ¯ ) + λ ¯ T B v ( ζ ¯ ) } d t π
= C [ ( u ^ u ¯ ) { θ ¯ [ Δ π , u ( ζ ¯ , f ¯ ) R f , g Θ π , u ( ζ ¯ , g ¯ ) ] + μ ¯ T A u ( ζ ¯ ) + λ ¯ T B u ( ζ ¯ ) }
+ ( u ^ η u ¯ η ) { θ ¯ [ Δ π , u η ( ζ ¯ , f ¯ ) R f , g Θ π , u η ( ζ ¯ , g ¯ ) ] + μ ¯ T A u η ( ζ ¯ ) + λ ¯ T B u η ( ζ ¯ ) } ] d t π
+ C ( v ^ v ¯ ) { θ ¯ [ Δ π , v ( ζ ¯ , f ¯ ) R f , g Θ π , v ( ζ ¯ , g ¯ ) ] + μ ¯ T A v ( ζ ¯ ) + λ ¯ T B v ( ζ ¯ ) } d t π = 0 ,
by using the method of integration by parts, the boundary conditions, and the divergence formula.
On the other hand, since C θ ¯ Δ π ( ζ , f ¯ ) R f , g Θ π ( ζ , g ¯ ) d t π is convex at ( u ¯ , v ¯ ) , we have
C θ ¯ [ Δ π ( ζ ^ , f ¯ ) R f , g Θ π ( ζ ^ , g ¯ ) ] θ ¯ [ Δ π ( ζ ¯ , f ¯ ) R f , g Θ π ( ζ ¯ , g ¯ ) ] d t π
C ( u ^ u ¯ ) θ ¯ [ Δ π , u ( ζ ¯ , f ¯ ) R f , g Θ π , u ( ζ ¯ , g ¯ ) ] d t π
+ C ( u ^ η u ¯ η ) θ ¯ [ Δ π , u η ( ζ ¯ , f ¯ ) R f , g Θ π , u η ( ζ ¯ , g ¯ ) ] d t π
+ C ( v ^ v ¯ ) θ ¯ [ Δ π , v ( ζ ¯ , f ¯ ) R f , g Θ π , v ( ζ ¯ , g ¯ ) ] d t π ,
and, by using inequality ( 5 ) , it follows
C ( u ^ u ¯ ) θ ¯ [ Δ π , u ( ζ ¯ , f ¯ ) R f , g Θ π , u ( ζ ¯ , g ¯ ) ] d t π + C ( u ^ η u ¯ η ) θ ¯ [ Δ π , u η ( ζ ¯ , f ¯ ) R f , g Θ π , u η ( ζ ¯ , g ¯ ) ] d t π
+ C ( v ^ v ¯ ) θ ¯ [ Δ π , v ( ζ ¯ , f ¯ ) R f , g Θ π , v ( ζ ¯ , g ¯ ) ] d t π < 0 .
Now, by using the convexity property at ( u ¯ , v ¯ ) of the functional C μ ¯ T A ( ζ ) d t π , we get
C μ ¯ T A ( ζ ^ ) μ ¯ T A ( ζ ¯ ) d t π C ( u ^ u ¯ ) μ ¯ T A u ( ζ ¯ ) d t π
+ C ( u ^ η u ¯ η ) μ ¯ T A u η ( ζ ¯ ) d t π + C ( v ^ v ¯ ) μ ¯ T A v ( ζ ¯ ) d t π .
The previous inequality along with the robust feasibility of ( u ^ , v ^ ) to ( P ) and the optimality condition ( 3 ) , give
C ( u ^ u ¯ ) μ ¯ T A u ( ζ ¯ ) d t π + C ( u ^ η u ¯ η ) μ ¯ T A u η ( ζ ¯ ) d t π
+ C ( v ^ v ¯ ) μ ¯ T A v ( ζ ¯ ) d t π 0 .
Further, by considering, in the same manner, the convexity property at ( u ¯ , v ¯ ) of the integral functional C λ ¯ T B ( ζ ) d t π , and the robust feasibility of ( u ^ , v ^ ) to ( P ) , we obtain
C ( u ^ u ¯ ) λ ¯ T B u ( ζ ¯ ) d t π + C ( u ^ η u ¯ η ) λ ¯ T B u η ( ζ ¯ ) d t π
+ C ( v ^ v ¯ ) λ ¯ T B v ( ζ ¯ ) d t π 0 .
Finally, by adding the relations ( 7 ) , ( 8 ) and ( 9 ) , side by side, we have
C [ ( u ^ u ¯ ) { θ ¯ [ Δ π , u ( ζ ¯ , f ¯ ) R f , g Θ π , u ( ζ ¯ , g ¯ ) ] + μ ¯ T A u ( ζ ¯ ) + λ ¯ T B u ( ζ ¯ ) }
+ ( u ^ η u ¯ η ) { θ ¯ [ Δ π , u η ( ζ ¯ , f ¯ ) R f , g Θ π , u η ( ζ ¯ , g ¯ ) ] + μ ¯ T A u η ( ζ ¯ ) + λ ¯ T B u η ( ζ ¯ ) } ] d t π
+ C ( v ^ v ¯ ) { θ ¯ [ Δ π , v ( ζ ¯ , f ¯ ) R f , g Θ π , v ( ζ ¯ , g ¯ ) ] + μ ¯ T A v ( ζ ¯ ) + λ ¯ T B v ( ζ ¯ ) } d t π < 0 ,
being a contradiction with the relation ( 6 ) , and this completes the proof. □
The next theorems assert new robust sufficient optimality conditions under (strictly, monotonic) quasi-convexity assumptions.
Theorem 4.
Let ( u ¯ , v ¯ ) D be a feasible solution to ( P ) such that the robust necessary optimality conditions given in (1)–(4) are satisfied, max f F Δ π ( ζ , f ) = Δ π ( ζ , f ¯ ) , min g G Θ π ( ζ , g ) = Θ π ( ζ , g ¯ ) , and consider
F ( u , v ; f ¯ , g ¯ ) : = C θ ¯ Δ π ( ζ , f ¯ ) R f , g Θ π ( ζ , g ¯ ) d t π , V ( u , v ) : = C μ ¯ T A ( ζ ) d t π
are quasi-convex and strictly quasi-convex at ( u ¯ , v ¯ ) D , respectively, and X ( u , v ) : = C λ ¯ T B ( ζ ) d t π is monotonic quasi-convex at ( u ¯ , v ¯ ) D . Then the pair ( u ¯ , v ¯ ) is a robust optimal solution to ( P ) .
Proof. 
Let us assume that ( u ¯ , v ¯ ) is not a robust optimal solution to ( P ) , and consider the following non-empty set
S = ( u , v ) D | F ( u , v ; f ¯ , g ¯ ) F ( u ¯ , v ¯ ; f ¯ , g ¯ ) , X ( u , v ) = X ( u ¯ , v ¯ ) , V ( u , v ) V ( u ¯ , v ¯ ) .
By hypothesis, for ( u , v ) S , we get
F ( u , v ; f ¯ , g ¯ ) F ( u ¯ , v ¯ ; f ¯ , g ¯ ) ,
then
C θ ¯ Δ π , u ( ζ ¯ , f ¯ ) R f , g Θ π , u ( ζ ¯ , g ¯ ) ( u u ¯ ) + θ ¯ Δ π , v ( ζ ¯ , f ¯ ) R f , g Θ π , v ( ζ ¯ , g ¯ ) ( v v ¯ ) d t π
+ C θ ¯ Δ π , u η ( ζ ¯ , f ¯ ) R f , g Θ π , u η ( ζ ¯ , g ¯ ) ( u η u ¯ η ) d t π 0 .
For ( u , v ) S , the equality X ( u , v ) = X ( u ¯ , v ¯ ) holds and it follows
C λ ¯ T B u ( ζ ¯ ) ( u u ¯ ) + λ ¯ T B v ( ζ ¯ ) ( v v ¯ ) d t π
+ C λ ¯ T B u η ( ζ ¯ ) ( u η u ¯ η ) d t π = 0 .
Also, for ( u , v ) S , the inequality V ( u , v ) V ( u ¯ , v ¯ ) gives
C μ ¯ T A u ( ζ ¯ ) ( u u ¯ ) + μ ¯ T A v ( ζ ¯ ) ( v v ¯ ) d t π
+ C μ ¯ T A u η ( ζ ¯ ) ( u η u ¯ η ) d t π < 0 .
By hypothesis, we have considered ( u ¯ , v ¯ ) fulfills the conditions ( 1 ) ( 4 ) . By multiplying Equations ( 1 ) and ( 2 ) by ( u u ¯ ) and ( v v ¯ ) , respectively, and integrating them, we get
C ( u u ¯ ) { θ ¯ [ Δ π , u ( ζ ¯ , f ¯ ) R f , g Θ π , u ( ζ ¯ , g ¯ ) ] + μ ¯ T A u ( ζ ¯ ) + λ ¯ T B u ( ζ ¯ )
t η θ ¯ [ Δ π , u η ( ζ ¯ , f ¯ ) R f , g Θ π , u η ( ζ ¯ , g ¯ ) ] + μ ¯ T A u η ( ζ ¯ ) + λ ¯ T B u η ( ζ ¯ ) } d t π
+ C ( v v ¯ ) { θ ¯ [ Δ π , v ( ζ ¯ , f ¯ ) R f , g Θ π , v ( ζ ¯ , g ¯ ) ] + μ ¯ T A v ( ζ ¯ ) + λ ¯ T B v ( ζ ¯ ) } d t π
= C [ ( u u ¯ ) { θ ¯ [ Δ π , u ( ζ ¯ , f ¯ ) R f , g Θ π , u ( ζ ¯ , g ¯ ) ] + μ ¯ T A u ( ζ ¯ ) + λ ¯ T B u ( ζ ¯ ) }
+ ( u η u ¯ η ) { θ ¯ [ Δ π , u η ( ζ ¯ , f ¯ ) R f , g Θ π , u η ( ζ ¯ , g ¯ ) ] + μ ¯ T A u η ( ζ ¯ ) + λ ¯ T B u η ( ζ ¯ ) } ] d t π
+ C ( v v ¯ ) { θ ¯ [ Δ π , v ( ζ ¯ , f ¯ ) R f , g Θ π , v ( ζ ¯ , g ¯ ) ] + μ ¯ T A v ( ζ ¯ ) + λ ¯ T B v ( ζ ¯ ) } d t π = 0 ,
by using the method of integration by parts, the boundary conditions, and the divergence formula. On the other hand, by adding the relations ( 10 ) , ( 11 ) and ( 12 ) , side by side, we have
C [ ( u u ¯ ) { θ ¯ [ Δ π , u ( ζ ¯ , f ¯ ) R f , g Θ π , u ( ζ ¯ , g ¯ ) ] + μ ¯ T A u ( ζ ¯ ) + λ ¯ T B u ( ζ ¯ ) }
+ ( u η u ¯ η ) { θ ¯ [ Δ π , u η ( ζ ¯ , f ¯ ) R f , g Θ π , u η ( ζ ¯ , g ¯ ) ] + μ ¯ T A u η ( ζ ¯ ) + λ ¯ T B u η ( ζ ¯ ) } ] d t π
+ C ( v v ¯ ) { θ ¯ [ Δ π , v ( ζ ¯ , f ¯ ) R f , g Θ π , v ( ζ ¯ , g ¯ ) ] + μ ¯ T A v ( ζ ¯ ) + λ ¯ T B v ( ζ ¯ ) } d t π < 0 ,
being a contradiction with the relation ( 13 ) , and this completes the proof. □
Next, some immediate consequences of the previous theorem can be formulated as follows.
Theorem 5.
Let ( u ¯ , v ¯ ) D be a feasible solution to ( P ) such that the robust necessary optimality conditions given in (1)–(4) are satisfied, max f F Δ π ( ζ , f ) = Δ π ( ζ , f ¯ ) , min g G Θ π ( ζ , g ) = Θ π ( ζ , g ¯ ) , and consider
F ( u , v ; f ¯ , g ¯ ) : = C θ ¯ Δ π ( ζ , f ¯ ) R f , g Θ π ( ζ , g ¯ ) d t π , V ( u , v ) : = C μ ¯ T A ( ζ ) d t π
are strictly quasi-convex and quasi-convex at ( u ¯ , v ¯ ) D , respectively, and X ( u , v ) : = C λ ¯ T B ( ζ ) d t π is monotonic quasi-convex at ( u ¯ , v ¯ ) D . Then the pair ( u ¯ , v ¯ ) is a robust optimal solution to ( P ) .
Proof. 
The proof follows in the same manner as in Theorem 4, by replacing the sign “≤” in ( 10 ) with “<”, and the sign “<” in ( 12 ) with “≤”. □
Theorem 6.
Let ( u ¯ , v ¯ ) D be a feasible solution to ( P ) such that the robust necessary optimality conditions given in (1)–(4) are satisfied, max f F Δ π ( ζ , f ) = Δ π ( ζ , f ¯ ) , min g G Θ π ( ζ , g ) = Θ π ( ζ , g ¯ ) , and consider
F ( u , v ; f ¯ , g ¯ ) : = C θ ¯ Θ ˜ π ( ζ ¯ , f ¯ ) Δ π ( ζ , f ¯ ) Δ ˜ π ( ζ ¯ , f ¯ ) Θ π ( ζ , g ¯ ) d t π , V ( u , v ) : = C μ ¯ T A ( ζ ) d t π
are quasi-convex and strictly quasi-convex at ( u ¯ , v ¯ ) D , respectively, and X ( u , v ) : = C λ ¯ T B ( ζ ) d t π is monotonic quasi-convex at ( u ¯ , v ¯ ) D . Then the pair ( u ¯ , v ¯ ) is a robust optimal solution to ( P ) .
Proof. 
The proof follows in the same manner as in Theorem 4, by replacing the R f , g = C max f F Δ π ( ζ ¯ , f ) d t π C min g G Θ π ( ζ ¯ , g ) d t π : = Δ ˜ π ( ζ ¯ , f ¯ ) Θ ˜ π ( ζ ¯ , f ¯ ) . □
Theorem 7.
Let ( u ¯ , v ¯ ) D be a feasible solution to ( P ) such that the robust necessary optimality conditions given in (1)–(4) are satisfied, max f F Δ π ( ζ , f ) = Δ π ( ζ , f ¯ ) , min g G Θ π ( ζ , g ) = Θ π ( ζ , g ¯ ) , and consider
F ( u , v ; f ¯ , g ¯ ) : = C θ ¯ Θ ˜ π ( ζ ¯ , f ¯ ) Δ π ( ζ , f ¯ ) Δ ˜ π ( ζ ¯ , f ¯ ) Θ π ( ζ , g ¯ ) d t π , V ( u , v ) : = C μ ¯ T A ( ζ ) d t π
are strictly quasi-convex and quasi-convex at ( u ¯ , v ¯ ) D , respectively, and X ( u , v ) : = C λ ¯ T B ( ζ ) d t π is monotonic quasi-convex at ( u ¯ , v ¯ ) D . Then the pair ( u ¯ , v ¯ ) is a robust optimal solution to ( P ) .
Proof. 
The proof follows in the same manner as in Theorem 4, by replacing the R f , g = C max f F Δ π ( ζ ¯ , f ) d t π C min g G Θ π ( ζ ¯ , g ) d t π : = Δ ˜ π ( ζ ¯ , f ¯ ) Θ ˜ π ( ζ ¯ , f ¯ ) , the sign “≤” in ( 10 ) with “<”, and the sign “<” in ( 12 ) with “≤”. □
Theorem 8.
Let ( u ¯ , v ¯ ) D be a feasible solution to ( P ) such that the robust necessary optimality conditions given in (1)–(4) are satisfied, max f F Δ π ( ζ , f ) = Δ π ( ζ , f ¯ ) , min g G Θ π ( ζ , g ) = Θ π ( ζ , g ¯ ) , and consider
F ( u , v ; f ¯ , g ¯ ) : = C θ ¯ Δ π ( ζ , f ¯ ) R f , g Θ π ( ζ , g ¯ ) d t π ,
V ˜ ( u , v ) : = C μ ¯ T A ( ζ ) + λ ¯ T B ( ζ ) d t π
are quasi-convex and strictly quasi-convex at ( u ¯ , v ¯ ) D , respectively. Then the pair ( u ¯ , v ¯ ) is a robust optimal solution to ( P ) .
Proof. 
The proof follows in the same manner as in Theorem 4, by considering the sign “<” in ( 11 ) and ( 12 ) , then adding them. □
Theorem 9.
Let ( u ¯ , v ¯ ) D be a feasible solution to ( P ) such that the robust necessary optimality conditions given in (1)–(4) are satisfied, max f F Δ π ( ζ , f ) = Δ π ( ζ , f ¯ ) , min g G Θ π ( ζ , g ) = Θ π ( ζ , g ¯ ) , and consider
F ( u , v ; f ¯ , g ¯ ) : = C θ ¯ Δ π ( ζ , f ¯ ) R f , g Θ π ( ζ , g ¯ ) d t π ,
V ˜ ( u , v ) : = C μ ¯ T A ( ζ ) + λ ¯ T B ( ζ ) d t π
are strictly quasi-convex and quasi-convex at ( u ¯ , v ¯ ) D , respectively. Then the pair ( u ¯ , v ¯ ) is a robust optimal solution to ( P ) .
Proof. 
The proof follows in the same manner as in Theorem 4, by considering the sign “<” in ( 10 ) , and the sign “≤” in ( 11 ) and ( 12 ) , then adding them. □
Theorem 10.
Let ( u ¯ , v ¯ ) D be a feasible solution to ( P ) such that the robust necessary optimality conditions given in (1)–(4) are satisfied, max f F Δ π ( ζ , f ) = Δ π ( ζ , f ¯ ) , min g G Θ π ( ζ , g ) = Θ π ( ζ , g ¯ ) , and consider
F ( u , v ; f ¯ , g ¯ ) : = C θ ¯ Θ ˜ π ( ζ ¯ , f ¯ ) Δ π ( ζ , f ¯ ) Δ ˜ π ( ζ ¯ , f ¯ ) Θ π ( ζ , g ¯ ) d t π ,
V ˜ ( u , v ) : = C μ ¯ T A ( ζ ) + λ ¯ T B ( ζ ) d t π
are quasi-convex and strictly quasi-convex at ( u ¯ , v ¯ ) D , respectively. Then the pair ( u ¯ , v ¯ ) is a robust optimal solution to ( P ) .
Proof. 
The proof follows in the same manner as in Theorem 4, by replacing the R f , g = C max f F Δ π ( ζ ¯ , f ) d t π C min g G Θ π ( ζ ¯ , g ) d t π : = Δ ˜ π ( ζ ¯ , f ¯ ) Θ ˜ π ( ζ ¯ , f ¯ ) , and by considering the sign “<” in ( 11 ) and ( 12 ) , then adding them. □
Theorem 11.
Let ( u ¯ , v ¯ ) D be a feasible solution to ( P ) such that the robust necessary optimality conditions given in (1)–(4) are satisfied, max f F Δ π ( ζ , f ) = Δ π ( ζ , f ¯ ) , min g G Θ π ( ζ , g ) = Θ π ( ζ , g ¯ ) , and consider
F ( u , v ; f ¯ , g ¯ ) : = C θ ¯ Θ ˜ π ( ζ ¯ , f ¯ ) Δ π ( ζ , f ¯ ) Δ ˜ π ( ζ ¯ , f ¯ ) Θ π ( ζ , g ¯ ) d t π ,
V ˜ ( u , v ) : = C μ ¯ T A ( ζ ) + λ ¯ T B ( ζ ) d t π
are strictly quasi-convex and quasi-convex at ( u ¯ , v ¯ ) D , respectively. Then the pair ( u ¯ , v ¯ ) is a robust optimal solution to ( P ) .
Proof. 
The proof follows in the same manner as in Theorem 4, by replacing the R f , g = C max f F Δ π ( ζ ¯ , f ) d t π C min g G Θ π ( ζ ¯ , g ) d t π : = Δ ˜ π ( ζ ¯ , f ¯ ) Θ ˜ π ( ζ ¯ , f ¯ ) , the sign “≤” in ( 10 ) with “<”, and by considering the sign “≤” in ( 11 ) and ( 12 ) , then adding them. □
Remark 5.
(i) In order to justify the main elements formulated in the paper, some illustrative applications and numerical simulations can be consulted by the reader in the recent research work of Jayswal et al. [22].
(ii) Regarding the research limitations associated with this paper, we could mention the study of the case where the second-order partial derivatives are presented, and, also, the situation when the involved functionals are not necessarily (quasi-) convex.
(iii) In order to highlight the above-mentioned theorems, a suitable illustrative application (from mechanics) is presented and investigated in Treanţă [25].

4. Conclusions

In this paper, under the convexity, quasi-convexity, strictly quasi-convexity, and/or monotonic quasi-convexity hypotheses of the involved functionals, we have established robust sufficient optimality conditions for the considered problem. Also, a characterization of the associated Kuhn-Tucker points has been stated. To the best of the authors’ knowledge, the results presented in this paper are new in the specialized literature. As future research directions of this paper, the authors mention the presence of data uncertainty in the constraints and the associated duality theory.

Author Contributions

Conceptualization, S.T. and T.S.; formal analysis, S.T. and T.S.; funding acquisition, S.T. and T.S.; investigation, S.T. and T.S.; methodology, S.T. and T.S.; validation, S.T. and T.S.; visualization, S.T. and T.S.; writing—original draft, S.T. and T.S.; writing—review and editing, S.T. and T.S. 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.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Dinkelbach, W. On nonlinear fractional programming. Manag. Sci. 1967, 13, 492–498. [Google Scholar] [CrossRef]
  2. Jagannathan, R. Duality for nonlinear fractional programs. Z. Fuer Oper. Res. 1973, 17, 1–3. [Google Scholar] [CrossRef]
  3. Mititelu, Ş. Efficiency and duality for multiobjective fractional variational problems with (ρ, b)-quasiinvexity. Yugosl. J. Oper. Res. 2016, 19, 85–99. [Google Scholar] [CrossRef]
  4. Antczak, T.; Pitea, A. Parametric approach to multitime multiobjective fractional variational problems under (f, ρ)-convexity. Optim. Control Appl. Methods 2016, 37, 831–847. [Google Scholar]
  5. Mititelu, Ş.; Treanţă, S. Efficiency conditions in vector control problems governed by multiple integrals. J. Appl. Math. Comput. 2018, 57, 647–665. [Google Scholar] [CrossRef]
  6. Antczak, T. Parametric approach for approximate efficiency of robust multiobjective fractional programming problems. Math. Methods Appl. Sci. 2021, 44, 11211–11230. [Google Scholar] [CrossRef]
  7. Patel, R.B. Duality for multiobjective fractional variational control problems with (F, ρ)-convexity. Int. J. Stat. Manag. Syst. 2000, 3, 113–134. [Google Scholar] [CrossRef]
  8. Nahak, C. Duality for multiobjective variational control and multiobjective fractional variational control problems with pseudoinvexity. J. Appl. Math. Stoch. Anal. 2006, 2006, 1–15. [Google Scholar] [CrossRef] [Green Version]
  9. Manesh, S.S.; Saraj, M.; Alizadeh, M.; Momeni, M. On robust weakly ϵ-efficient solutions for multi-objective fractional programming problems under data uncertainty. AIMS Math. 2021, 7, 2331–2347. [Google Scholar] [CrossRef]
  10. Kim, M.H.; Kim, G.A. On optimality and duality for generalized fractional robust optimization problems. East Asian Math. J. 2015, 31, 737–742. [Google Scholar] [CrossRef] [Green Version]
  11. Kim, G.A.; Kim, M.H. On sufficiency and duality for fractional robust optimization problems involving (g,ρ)-invex function. East Asian Math. J. 2016, 32, 635–639. [Google Scholar] [CrossRef] [Green Version]
  12. Kim, M.H.; Kim, G.S. Optimality conditions and duality in fractional robust optimization problems. East Asian Math. J. 2015, 31, 345–349. [Google Scholar] [CrossRef] [Green Version]
  13. Noor, M.A. General biconvex functions and bivariational-like inequalities. Nonlinear Funct. Anal. Appl. 2022, 27, 23–44. [Google Scholar]
  14. Jeyakumar, G.; Li, G.; Lee, G.M. Robust duality for generalized convex programming problems under data uncertainty. Nonlinear Anal. Theory Methods Appl. 2012, 75, 1362–1373. [Google Scholar] [CrossRef]
  15. Beck, A.; Tal, A.B. Duality in robust optimization: Primal worst equals dual best. Oper. Res. Lett. 2009, 37, 1–6. [Google Scholar] [CrossRef]
  16. Baranwal, A.; Jayswal, A.; Kardam, P. Robust duality for the uncertain multitime control optimization problems. Int. J. Robust Nonlinear Control 2022, 32, 5837–5847. [Google Scholar] [CrossRef]
  17. Treanţă, S. Efficiency in uncertain variational control problems. Neural. Comput. Appl. 2021, 33, 5719–5732. [Google Scholar] [CrossRef]
  18. Treanţă, S. Robust saddle-point criterion in second-order partial differential equation and partial differential inequation constrained control problems. Int. J. Robust Nonlinear Control 2021, 31, 9282–9293. [Google Scholar] [CrossRef]
  19. Preeti; Jayswal, A.; Arana-Jiménez, M. An exact l1 penalty function method for a multitime control optimization problem with data uncertainty. Optim. Control Appl. Methods 2020, 41, 1705–1717. [Google Scholar]
  20. Jayswal, A.; Preeti; Arana-Jiménez, M. Robust penalty function method for an uncertain multi-time control optimization problems. J. Math. Anal. Appl. 2022, 505, 125453. [Google Scholar] [CrossRef]
  21. Treanţă, S. On Controlled Variational Inequalities Involving Convex Functionals. In Optimization of Complex Systems: Theory, Models, Algorithms and Applications; WCGO 2019. Advances in Intelligent Systems and Computing; Le Thi, H., Le, H., Pham Dinh, T., Eds.; Springer: Berlin/Heidelberg, Germany, 2020; Volume 991, pp. 164–174. [Google Scholar]
  22. Jayswal, A.; Preeti; Treanţă, S. Multi-Dimensional Control Problems: Robust Approach; Springer: Singapore, 2022. [Google Scholar]
  23. Treanţă, S.; Arana-Jiménez, M. On generalized KT-pseudoinvex control problems involving multiple integral functionals. Eur. J. Control 2018, 43, 39–45. [Google Scholar] [CrossRef]
  24. Saeed, T. Robust Optimality Conditions For a Class of Fractional Optimization Problems. Axioms 2023, 12, 673. [Google Scholar] [CrossRef]
  25. Treanţă, S. Robust optimality in constrained optimization problems with application in mechanics. J. Math. Anal. Appl. 2022, 515, 126440. [Google Scholar]
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

Saeed, T.; Treanţă, S. On Sufficiency Conditions for Some Robust Variational Control Problems. Axioms 2023, 12, 705. https://doi.org/10.3390/axioms12070705

AMA Style

Saeed T, Treanţă S. On Sufficiency Conditions for Some Robust Variational Control Problems. Axioms. 2023; 12(7):705. https://doi.org/10.3390/axioms12070705

Chicago/Turabian Style

Saeed, Tareq, and Savin Treanţă. 2023. "On Sufficiency Conditions for Some Robust Variational Control Problems" Axioms 12, no. 7: 705. https://doi.org/10.3390/axioms12070705

APA Style

Saeed, T., & Treanţă, S. (2023). On Sufficiency Conditions for Some Robust Variational Control Problems. Axioms, 12(7), 705. https://doi.org/10.3390/axioms12070705

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