Nothing Special   »   [go: up one dir, main page]

Next Article in Journal
Mathematics Training in Engineering Degrees: An Intervention from Teaching Staff to Students
Next Article in Special Issue
On a Novel Numerical Scheme for Riesz Fractional Partial Differential Equations
Previous Article in Journal
A Novel Methodology for Adaptive Coordination of Multiple Controllers in Electrical Grids
Previous Article in Special Issue
Convergence and Numerical Solution of a Model for Tumor Growth
You seem to have javascript disabled. Please note that many of the page functionalities won't work as expected without javascript enabled.
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On a Class of Second-Order PDE&PDI Constrained Robust Modified Optimization Problems

Department of Applied Mathematics, University Politehnica of Bucharest, 060042 Bucharest, Romania
Mathematics 2021, 9(13), 1473; https://doi.org/10.3390/math9131473
Submission received: 22 May 2021 / Revised: 21 June 2021 / Accepted: 22 June 2021 / Published: 23 June 2021
(This article belongs to the Special Issue Applications of Partial Differential Equations in Engineering)

Abstract

:
In this paper, by using scalar multiple integral cost functionals and the notion of convexity associated with a multiple integral functional driven by an uncertain multi-time controlled second-order Lagrangian, we develop a new mathematical framework on multi-dimensional scalar variational control problems with mixed constraints implying second-order partial differential equations (PDEs) and inequations (PDIs). Concretely, we introduce and investigate an auxiliary (modified) variational control problem, which is much easier to study, and provide some equivalence results by using the notion of a normal weak robust optimal solution.

1. Introduction

As we all know, the partial differential equations (PDEs) and inequations (PDIs) are very important in the study of many processes and phenomena in nature, science and engineering. In this regard, over time, several researchers have taken a particular interest in studying some optimization problems with ODE, PDE, or isoperimetric constraints. We mention here, for instance, the works of Mititelu [1], Treanţă [2], Olteanu and Treanţă [3], Mititelu and Treanţă [4], and Jayswal et al. [5]. Additionally, since the difficulty of the considered problems was increasing, several auxiliary (modified) optimization problems have been introduced to study the initial problem more easily (see, quite recently, Treanţă [6,7,8,9]). Moreover, the complexity of real-life processes and phenomena is very high and often involves uncertainty in initial data. In consequence, many researchers turned their attention to real problems involving higher-order PDEs, isoperimetric restrictions, uncertain data, or a combination thereof. In this respect, the reader is directed to the following research works: Liu and Yuan [10], Jeyakumar et al. [11], Wei et al. [12], Preeti et al. [13], Sun et al. [14], Treanţă [15], Lu et al. [16]. For other different but connected ideas on this subject, the reader is directed to [17,18,19,20].
In this paper, motivated and inspired by the above mentioned works, and based on a given class of constrained robust optimization problems, named ( P ) , we introduce and investigate a new class of auxiliary (modified) control problems (which are much easier to study). More precisely, by considering multiple integral cost functionals and mixed (equality and inequality) constraints involving second-order partial derivatives and data uncertainty, we formulate and prove some equivalence results between the two considered classes of control problems. Compared to other research papers in this field, the elements of total novelty included in the paper are represented by the presence of second-order partial derivatives and also by the presence of uncertain data both in the objective functional and in the restrictions. Moreover, the proofs associated with the main results of the paper are presented in an innovative way. In addition, since the mathematical framework developed here is suitable for various approaches and scientific views on complex spatial and temporal behaviors, this paper could be seen as a fundamental work for a large community of researchers in science and engineering.
The paper is divided as follows. Section 2 introduces the preliminary tools that will be used to describe the problem under study. Section 3 contains the main results of this paper. The first main result, under convexity assumptions of the constraint functionals, formulates the equivalence between the considered second-order PDE&PDI constrained robust optimization problem ( P ) and the associated modified problem. The second main result represents the converse of the first main result, assuming only the convexity hyothesis of the objective functional. Section 4 contains the conclusions of the paper and further developments.

2. Preliminary Tools

Throughout the paper, we consider the following notations and working hypotheses:
  • R p , R q , R r and R n are Euclidean spaces of dimensions p , q , r and n, respectively;
  • Θ R p is a compact domain, and the point t = ( t α ) Θ is a multi-parameter of evolution or multi-time;
  • S is the space of C 4 -class state functions a = ( a τ ) : Θ R q , and a α : = a t α , a α β : = 2 a t α t β denote the partial speed and partial acceleration, respectively;
  • C is the space of C 1 -class control functions c = ( c j ) : Θ R r ;
  • d t = d t 1 d t p is the volume element on R p Θ ;
  • T denotes the transpose of a vector;
  • For two vectors x , y R n , we use the following convention for inequalities and equalities:
    (i)
    x < y x i < y i , i = 1 , n ¯ ;
    ( i i )
    x = y x i = y i , i = 1 , n ¯ ;
    ( i i i )
    x y x i y i , i = 1 , n ¯ ;
    ( i v )
    x y x i y i , i = 1 , n ¯ and x i < y i for   some i .
The second-order PDE&PDI constrained controlled scalar optimization problem with uncertainty in the objective and constraint functionals is formulated as follows:
( P ) min ( a ( · ) , c ( · ) ) Θ f ( t , a ( t ) , a σ ( t ) , a α β ( t ) , c ( t ) , w ) d t
subject to
g ( t , a ( t ) , a σ ( t ) , a α β ( t ) , c ( t ) , u ) 0 , t Θ
h ( t , a ( t ) , a σ ( t ) , a α β ( t ) , c ( t ) , v ) = 0 , t Θ
a ( t 0 ) = a 0 , a ( t 1 ) = a 1 , a σ ( t 0 ) = a σ 0 , a σ ( t 1 ) = a σ 1 ,
or
a ( t ) | Θ = given , a σ ( t ) | Θ = given ,
where f : J 2 Θ , R q × C × W R , g = ( g 1 , , g m ) = ( g l ) : J 2 Θ , R q × C × U l R m , l = 1 , m ¯ , h = ( h 1 , , h n ) = ( h ζ ) : J 2 Θ , R q × C × V ζ R n , ζ = 1 , n ¯ , are C 3 -class functionals, w , u = ( u l ) and v = ( v ζ ) are the uncertain parameters for some convex compact subsets W R , U = ( U l ) R m and V = ( V ζ ) R n , respectively, and J 2 Θ , R q denotes the second-order jet bundle associated to Θ and R q .
The associated robust counterpart of the aforementioned scalar optimization problem ( P ) is defined as:
( R P ) min ( a ( · ) , c ( · ) ) Θ max w W f ( t , a ( t ) , a σ ( t ) , a α β ( t ) , c ( t ) , w ) d t
subject to
g ( t , a ( t ) , a σ ( t ) , a α β ( t ) , c ( t ) , u ) 0 , t Θ , u U
h ( t , a ( t ) , a σ ( t ) , a α β ( t ) , c ( t ) , v ) = 0 , t Θ , v V
a ( t 0 ) = a 0 , a ( t 1 ) = a 1 , a σ ( t 0 ) = a σ 0 , a σ ( t 1 ) = a σ 1 ,
or
a ( t ) | Θ = given , a σ ( t ) | Θ = given .
Furthermore, denoted by
D = { ( a , c ) S × C : g ( t , a ( t ) , a σ ( t ) , a α β ( t ) , c ( t ) , u ) 0 ,
h ( t , a ( t ) , a σ ( t ) , a α β ( t ) , c ( t ) , v ) = 0 , a ( t 0 ) = a 0 , a ( t 1 ) = a 1 ,
a σ ( t 0 ) = a σ 0 , a σ ( t 1 ) = a σ 1 , t Θ , u U , v V }
the set of all feasible solutions in ( R P ) and we say that it is the robust feasible solution set to the problem ( P ) .
From now on, to simplify our presentation, we introduce the following notation: π = ( t , a ( t ) , a σ ( t ) , a α β ( t ) , c ( t ) ) .
The first-order partial derivatives associated with f are defined as
f a = f a 1 , , f a q , f c = f c 1 , , f c r .
Similarly, we have g a and g c using matrices with m rows and h a and h c using matrices with n rows.
In the following, we introduce the notion of a weak robust optimal solution for the considered class of constrained optimization problems. This concept will be used to formulate the associated robust necessary optimality conditions and the main results included in the present paper.
Definition 1.
A robust feasible solution ( a ¯ , c ¯ ) D is said to be a weak robust optimal solution to the multi-dimensional scalar optimization problem ( P ) if there does not exist another point ( a , c ) D such that
Θ max w W f ( π , w ) d t < Θ max w W f ( π ¯ , w ) d t .
To formulate the concept of convexity and the robust optimality conditions associated with the aforementioned controlled optimization problem, we shall use the Saunders’s multi-index notation (see Saunders [21], Treanţă [22]).
Definition 2.
A multiple integral functional (driven by an uncertain multi-time controlled second-order Lagrangian)
F ( a , c , w ¯ ) = Θ f ( t , a ( t ) , a σ ( t ) , a α β ( t ) , c ( t ) , w ¯ ) d t = Θ f ( π , w ¯ ) d t
is said to be convex at ( a ¯ , c ¯ ) S × C if the following inequality
F ( a , c , w ¯ ) F ( a ¯ , c ¯ , w ¯ ) Θ f a ( π ¯ , w ¯ ) [ a ( t ) a ¯ ( t ) ] d t
+ Θ f a σ ( π ¯ , w ¯ ) [ a σ ( t ) a ¯ σ ( t ) ] d t
+ 1 n ( α , β ) Θ f a α β ( π ¯ , w ¯ ) [ a α β ( t ) a ¯ α β ( t ) ] d t
+ Θ f c ( π ¯ , w ¯ ) [ c ( t ) c ¯ ( t ) ] d t
holds for all ( a , c ) S × C .
In the following, according to Treanţă [22], we present the robust necessary optimality conditions for the scalar optimization problem ( P ) .
Theorem 1.
Let ( a ¯ , c ¯ ) D be a weak robust optimal solution to the problem ( P ) and max w W f ( π , w ) = f ( π , w ¯ ) . Then, then there exist the scalar μ ¯ R , the piecewise smooth functions ν ¯ = ( ν ¯ l ( t ) ) R + m , γ ¯ = ( γ ¯ ζ ( t ) ) R n , and the uncertainty parameters u ¯ U and v ¯ V , such that the following conditions
μ ¯ f a ( π ¯ , w ¯ ) + ν ¯ T g a ( π ¯ , u ¯ ) + γ ¯ T h a ( π ¯ , v ¯ )
D σ μ ¯ f a σ ( π ¯ , w ¯ ) + ν ¯ T g a σ ( π ¯ , u ¯ ) + γ ¯ T h a σ ( π ¯ , v ¯ )
+ 1 n ( α , β ) D α β 2 μ ¯ f a α β ( π ¯ , w ¯ ) + ν ¯ T g a α β ( π ¯ , u ¯ ) + γ ¯ T h a α β ( π ¯ , v ¯ ) = 0 ,
μ ¯ f c ( π ¯ , w ¯ ) + ν ¯ T g c ( π ¯ , u ¯ ) + γ ¯ T h c ( π ¯ , v ¯ ) = 0 ,
ν ¯ T g ( π ¯ , u ¯ ) = 0 , ν ¯ 0 ,
μ ¯ 0
hold for all t Θ , except at discontinuities.
Remark 1.
The conditions (1)–(4) are known as robust necessary optimality conditions for the multi-dimensional scalar optimization problem ( P ) .
Definition 3.
A robust feasible solution ( a ¯ , c ¯ ) is said to be a normal weak robust optimal solution to the problem ( P ) if μ ¯ > 0 in Theorem 1. Without loss of generality, we can consider μ ¯ = 1 .

3. The Associated Modified Optimization Problem

In this section, we use the modified objective function method to reduce the complexity associated with the considered multi-dimensional scalar optimization problem ( P ) . In this regard, let ( a ¯ , c ¯ ) be an arbitrary given robust feasible solution to the multi-dimensional scalar optimization problem ( P ) . The modified multi-dimensional scalar optimization problem associated with the original variational control problem ( P ) is defined as:
( P ) ( a ¯ , c ¯ ) min ( a ( · ) , c ( · ) ) Θ { f a ( π ¯ , w ) ( a ( t ) a ¯ ( t ) ) + f a σ ( π ¯ , w ) ( a σ ( t ) a ¯ σ ( t ) )
+ 1 n ( α , β ) f a α β ( π ¯ , w ) ( a α β ( t ) a ¯ α β ( t ) ) + f c ( π ¯ , w ) ( c ( t ) c ¯ ( t ) ) } d t
subject to
g ( π , u ) 0 , t Θ
h ( π , v ) = 0 , t Θ
a ( t 0 ) = a 0 , a ( t 1 ) = a 1 , a σ ( t 0 ) = a σ 0 , a σ ( t 1 ) = a σ 1 ,
or
a ( t ) | Θ = given , a σ ( t ) | Θ = given ,
where the functionals f , g and h are given as in the original variational control problem ( P ) .
The associated robust counterpart of the multi-dimensional scalar optimization problem ( P ) ( a ¯ , c ¯ ) is defined as:
( R P ) ( a ¯ , c ¯ ) min ( a ( · ) , c ( · ) ) Θ max w W { f a ( π ¯ , w ) ( a ( t ) a ¯ ( t ) ) + f a σ ( π ¯ , w ) ( a σ ( t ) a ¯ σ ( t ) )
+ 1 n ( α , β ) f a α β ( π ¯ , w ) ( a α β ( t ) a ¯ α β ( t ) ) + f c ( π ¯ , w ) ( c ( t ) c ¯ ( t ) ) } d t
subject to
g ( π , u ) 0 , t Θ , u U
h ( π , v ) = 0 , t Θ , v V
a ( t 0 ) = a 0 , a ( t 1 ) = a 1 , a σ ( t 0 ) = a σ 0 , a σ ( t 1 ) = a σ 1 ,
or
a ( t ) | Θ = given , a σ ( t ) | Θ = given .
Remark 2.
Let us remark that the robust feasible solution set to the problem ( P ) ( a ¯ , c ¯ ) is the same as in the problem ( P ) , and, in consequence, it is also denoted by D.
Definition 4.
A point ( a ^ , c ^ ) D is said to be a weak robust optimal solution to the modified multi-dimensional scalar optimization problem ( P ) ( a ¯ , c ¯ ) if there does not exist another point ( a , c ) D such that
Θ max w W [ f a ( π ¯ , w ) ( a a ¯ ) + f a σ ( π ¯ , w ) ( a σ a ¯ σ )
+ 1 n ( α , β ) f a α β ( π ¯ , w ) ( a α β a ¯ α β ) + f c ( π ¯ , w ) ( c c ¯ ) ] d t
< Θ max w W [ f a ( π ¯ , w ) ( a ^ a ¯ ) + f a σ ( π ¯ , w ) ( a ^ σ a ¯ σ )
+ 1 n ( α , β ) f a α β ( π ¯ , w ) ( a ^ α β a ¯ α β ) + f c ( π ¯ , w ) ( c ^ c ¯ ) ] d t .
In the following, we establish some equivalence results between the problems ( P ) and ( P ) ( a ¯ , c ¯ ) , under some appropriate convexity assumptions.
Theorem 2.
Let ( a ¯ , c ¯ ) be a normal weak robust optimal solution to the scalar optimization problem ( P ) . Furthermore, assume that Θ ν ¯ T g ( π , u ¯ ) d t , Θ γ ¯ T h ( π , v ¯ ) d t are convex at ( a ¯ , c ¯ ) . Then, ( a ¯ , c ¯ ) is also a weak robust optimal solution to the modified multi-dimensional scalar optimization problem ( P ) ( a ¯ , c ¯ ) .
Proof. 
By hypothesis, the relations (1)–(4), with μ ¯ = 1 , are fulfilled for all t Θ , except at discontinuities. Hence, the conditions (1) and (2) yield
Θ ( a ˜ a ¯ ) { f a ( π ¯ , w ¯ ) + ν ¯ T g a ( π ¯ , u ¯ ) + γ ¯ T h a ( π ¯ , v ¯ )
D σ f a σ ( π ¯ , w ¯ ) + ν ¯ T g a σ ( π ¯ , u ¯ ) + γ ¯ T h a σ ( π ¯ , v ¯ )
+ 1 n ( α , β ) D α β 2 f a α β ( π ¯ , w ¯ ) + ν ¯ T g a α β ( π ¯ , u ¯ ) + γ ¯ T h a α β ( π ¯ , v ¯ ) } d t
+ Θ ( c ˜ c ¯ ) { f c ( π ¯ , w ¯ ) + ν ¯ T g c ( π ¯ , u ¯ ) + γ ¯ T h c ( π ¯ , v ¯ ) } d t
= Θ [ ( a ˜ a ¯ ) { f a ( π ¯ , w ¯ ) + ν ¯ T g a ( π ¯ , u ¯ ) + γ ¯ T h a ( π ¯ , v ¯ ) }
+ ( a ˜ σ a ¯ σ ) { f a σ ( π ¯ , w ¯ ) + ν ¯ T g a σ ( π ¯ , u ¯ ) + γ ¯ T h a σ ( π ¯ , v ¯ ) }
+ 1 n ( α , β ) ( a ˜ α β a ¯ α β ) { f a α β ( π ¯ , w ¯ ) + ν ¯ T g a α β ( π ¯ , u ¯ ) + γ ¯ T h a α β ( π ¯ , v ¯ ) } ] d t
+ Θ ( c ˜ c ¯ ) { f c ( π ¯ , w ¯ ) + ν ¯ T g c ( π ¯ , u ¯ ) + γ ¯ T h c ( π ¯ , v ¯ ) } d t = 0 ,
where we used the formula of integration by parts, the divergence formula and the boundary conditions formulated in the considered problem.
Now, let us proceed by contradiction and consider ( a ¯ , c ¯ ) is not a weak robust optimal solution to the modified multi-dimensional scalar optimization problem ( P ) ( a ¯ , c ¯ ) . Then, there exists ( a ˜ , c ˜ ) D such that
Θ max w W [ f a ( π ¯ , w ) ( a ˜ a ¯ ) + f a σ ( π ¯ , w ) ( a ˜ σ a ¯ σ )
+ 1 n ( α , β ) f a α β ( π ¯ , w ) ( a ˜ α β a ¯ α β ) + f c ( π ¯ , w ) ( c ˜ c ¯ ) ] d t
< Θ max w W [ f a ( π ¯ , w ) ( a ¯ a ¯ ) + f a σ ( π ¯ , w ) ( a ¯ σ a ¯ σ )
+ 1 n ( α , β ) f a α β ( π ¯ , w ) ( a ¯ α β a ¯ α β ) + f c ( π ¯ , w ) ( c ¯ c ¯ ) ] d t .
Since max w W f ( π , w ) = f ( π , w ¯ ) , we obtain
Θ [ f a ( π ¯ , w ¯ ) ( a ˜ a ¯ ) + f a σ ( π ¯ , w ¯ ) ( a ˜ σ a ¯ σ )
+ 1 n ( α , β ) f a α β ( π ¯ , w ¯ ) ( a ˜ α β a ¯ α β ) + f c ( π ¯ , w ¯ ) ( c ˜ c ¯ ) ] d t
< Θ [ f a ( π ¯ , w ¯ ) ( a ¯ a ¯ ) + f a σ ( π ¯ , w ¯ ) ( a ¯ σ a ¯ σ )
+ 1 n ( α , β ) f a α β ( π ¯ , w ¯ ) ( a ¯ α β a ¯ α β ) + f c ( π ¯ , w ¯ ) ( c ¯ c ¯ ) ] d t ,
equivalent with
Θ [ f a ( π ¯ , w ¯ ) ( a ˜ a ¯ ) + f a σ ( π ¯ , w ¯ ) ( a ˜ σ a ¯ σ )
+ 1 n ( α , β ) f a α β ( π ¯ , w ¯ ) ( a ˜ α β a ¯ α β ) + f c ( π ¯ , w ¯ ) ( c ˜ c ¯ ) ] d t < 0 .
The robust feasibility of ( a ˜ , c ˜ ) in the problem ( P ) and the robust necessary efficiency condition (3) yield
Θ ν ¯ T g ( π ˜ , u ¯ ) d t Θ ν ¯ T g ( π ¯ , u ¯ ) d t 0 .
By hypothesis, since Θ ν ¯ T g ( π , u ¯ ) d t is convex at ( a ¯ , c ¯ ) , we obtain
Θ ν ¯ T g ( π ˜ , u ¯ ) ν ¯ T g ( π ¯ , u ¯ ) d t Θ ( a ˜ a ¯ ) ν ¯ T g a ( π ¯ , u ¯ ) d t
+ Θ ( a ˜ σ a ¯ σ ) ν ¯ T g a σ ( π ¯ , u ¯ ) d t
+ 1 n ( α , β ) Θ ( a ˜ α β a ¯ α β ) ν ¯ T g a α β ( π ¯ , u ¯ ) d t + Θ ( c ˜ c ¯ ) ν ¯ T g c ( π ¯ , u ¯ ) d t .
The above inequality together with relation (7) yield
Θ ( a ˜ a ¯ ) ν ¯ T g a ( π ¯ , u ¯ ) d t + Θ ( a ˜ σ a ¯ σ ) ν ¯ T g a σ ( π ¯ , u ¯ ) d t
+ 1 n ( α , β ) Θ ( a ˜ α β a ¯ α β ) ν ¯ T g a α β ( π ¯ , u ¯ ) d t + Θ ( c ˜ c ¯ ) ν ¯ T g c ( π ¯ , u ¯ ) d t 0 .
Furthermore, from the assumption, Θ γ ¯ T h ( π , v ¯ ) d t is convex at ( a ¯ , c ¯ ) and the robust feasibility of ( a ˜ , c ˜ ) and ( a ¯ , c ¯ ) in the multi-dimensional scalar optimization problem ( P ) , we obtain
Θ ( a ˜ a ¯ ) γ ¯ T h a ( π ¯ , v ¯ ) d t + Θ ( a ˜ σ a ¯ σ ) γ ¯ T h a σ ( π ¯ , v ¯ ) d t
+ 1 n ( α , β ) Θ ( a ˜ α β a ¯ α β ) γ ¯ T h a α β ( π ¯ , v ¯ ) d t + Θ ( c ˜ c ¯ ) γ ¯ T h c ( π ¯ , v ¯ ) d t 0 .
On combining the inequalities (6), (8) and (9), we obtain
Θ [ ( a ˜ a ¯ ) { f a ( π ¯ , w ¯ ) + ν ¯ T g a ( π ¯ , u ¯ ) + γ ¯ T h a ( π ¯ , v ¯ ) }
+ ( a ˜ σ a ¯ σ ) { f a σ ( π ¯ , w ¯ ) + ν ¯ T g a σ ( π ¯ , u ¯ ) + γ ¯ T h a σ ( π ¯ , v ¯ ) }
+ 1 n ( α , β ) ( a ˜ α β a ¯ α β ) { f a α β ( π ¯ , w ¯ ) + ν ¯ T g a α β ( π ¯ , u ¯ ) + γ ¯ T h a α β ( π ¯ , v ¯ ) } ] d t
+ Θ ( c ˜ c ¯ ) { f c ( π ¯ , w ¯ ) + ν ¯ T g c ( π ¯ , u ¯ ) + γ ¯ T h c ( π ¯ , v ¯ ) } d t < 0 ,
which contradicts the relation (5). Consequently, ( a ¯ , c ¯ ) is a weak robust optimal solution to the problem ( P ) ( a ¯ , c ¯ ) , and this completes the proof. □
The next result represents the reciprocal of the above theorem.
Theorem 3.
Let ( a ¯ , c ¯ ) be a weak robust optimal solution to the modified scalar optimization problem ( P ) ( a ¯ , c ¯ ) . Furthermore, assume that max w W f ( π , w ) = f ( π , w ¯ ) and the functional Θ f ( π , w ¯ ) d t is convex at ( a ¯ , c ¯ ) . Then, ( a ¯ , c ¯ ) is a weak robust optimal solution to the multi-dimensional scalar optimization problem ( P ) .
Proof. 
Contrary to the result, we assume that ( a ¯ , c ¯ ) is not a weak robust optimal solution to multi-dimensional scalar optimization problem ( P ) . Then, there exists another point ( a ˜ , c ˜ ) D such that
Θ max w W f ( π ˜ , w ) d t < Θ max w W f ( π ¯ , w ) d t .
Since max w W f ( π , w ) = f ( π , w ¯ ) , we obtain
Θ f ( π ˜ , w ¯ ) d t < Θ f ( π ¯ , w ¯ ) d t .
By assumption, since Θ f ( π , w ¯ ) d t is a convex functional at ( a ¯ , c ¯ ) , we have
Θ f ( π ˜ , w ¯ ) f ( π ¯ , w ¯ ) d t Θ f a ( π ¯ , w ¯ ) ( a ˜ a ¯ ) d t + Θ f a σ ( π ¯ , w ¯ ) ( a ˜ σ a ¯ σ ) d t
+ 1 n ( α , β ) Θ f a α β ( π ¯ , w ¯ ) ( a ˜ α β a ¯ α β ) d t + Θ f c ( π ¯ , w ¯ ) ( c ˜ c ¯ ) d t ,
which along with the inequality (10), yield
Θ f a ( π ¯ , w ¯ ) ( a ˜ a ¯ ) d t + Θ f a σ ( π ¯ , w ¯ ) ( a ˜ σ a ¯ σ ) d t
+ 1 n ( α , β ) Θ f a α β ( π ¯ , w ¯ ) ( a ˜ α β a ¯ α β ) d t + Θ f c ( π ¯ , w ¯ ) ( c ˜ c ¯ ) d t < 0 ,
equivalently with
Θ f a ( π ¯ , w ¯ ) ( a ˜ a ¯ ) d t + Θ f a σ ( π ¯ , w ¯ ) ( a ˜ σ a ¯ σ ) d t
+ 1 n ( α , β ) Θ f a α β ( π ¯ , w ¯ ) ( a ˜ α β a ¯ α β ) d t + Θ f c ( π ¯ , w ¯ ) ( c ˜ c ¯ ) d t
< Θ f a ( π ¯ , w ¯ ) ( a ¯ a ¯ ) d t + Θ f a σ ( π ¯ , w ¯ ) ( a ¯ σ a ¯ σ ) d t
+ 1 n ( α , β ) Θ f a α β ( π ¯ , w ¯ ) ( a ¯ α β a ¯ α β ) d t + Θ f c ( π ¯ , w ¯ ) ( c ¯ c ¯ ) d t .
The above inequality can be rewritten as
Θ max w W [ f a ( π ¯ , w ) ( a ˜ a ¯ ) + f a σ ( π ¯ , w ) ( a ˜ σ a ¯ σ )
+ 1 n ( α , β ) f a α β ( π ¯ , w ) ( a ˜ α β a ¯ α β ) + f c ( π ¯ , w ) ( c ˜ c ¯ ) ] d t
< Θ max w W [ f a ( π ¯ , w ) ( a ¯ a ¯ ) + f a σ ( π ¯ , w ) ( a ¯ σ a ¯ σ )
+ 1 n ( α , β ) f a α β ( π ¯ , w ) ( a ¯ α β a ¯ α β ) + f c ( π ¯ , w ) ( c ¯ c ¯ ) ] d t ,
which contradicts our assumption that ( a ¯ , c ¯ ) is a weak robust optimal solution to the modified multi-dimensional scalar optimization problem ( P ) ( a ¯ , c ¯ ) . Hence, the proof is completed. □
Remark 3.
As can be easily seen, to derive the equivalence between the original problem ( P ) and its associated modified problem ( P ) ( a ¯ , c ¯ ) , we imposed the convexity assumption only on the constraint functionals; whereas, to establish the converse of Theorem 2, it is sufficient to consider only the convexity hypothesis of the objective functional.

4. Conclusions

In this paper, for a given class of constrained robust optimization problems, named ( P ) , we have introduced and investigated an auxiliary (modified) robust optimization problem. More specifically, by considering multiple integral cost functionals and mixed constraints involving second-order partial derivatives and data uncertainty, we have formulated and proved some equivalence results for the considered control problems. For this aim, we used the concept of convexity associated with multiple integral functionals and the notion of a normal weak robust optimal solution.
Some developments of the results presented in this paper, which will be investigated in future papers, are provided by the study of the saddle-point optimality criteria and the associated (Wolfe, Mond-Weir, mixed) duality theory for the considered class of control problems.
The following abbreviations are used in this 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 author declares no conflict of interest.

References

  1. Mititelu, Ş. Optimality and duality for invex multi-dimensional control problems with mixed constraints. J. Adv. Math. Stud. 2009, 2, 25–34. [Google Scholar]
  2. Treanţă, S. Multiobjective fractional variational problem on higher-order jet bundles. Commun. Math. Stat. 2016, 4, 323–340. [Google Scholar] [CrossRef]
  3. Olteanu, O.; Treanţă, S. Convexity, Optimization and Approximation, with Some Applications; LAP Lambert Academic Publishing: Saarbrücken, Germany, 2018; ISBN 978-613-9-87683-9. [Google Scholar]
  4. Mititelu, Ş.; Treanţă, S. Efficiency conditions in vector control problems governed by multiple integrals. J. Appl. Math. Comput. 2018, 57, 647–665. [Google Scholar] [CrossRef]
  5. Jayswal, A.; Antczak, T.; Jha, S. On equivalence between a variational problem and its modified variational problem with the η-objective function under invexity. Int. Trans. Opt. Res. 2019, 26, 2053–2070. [Google Scholar] [CrossRef]
  6. Treanţă, S. Saddle-point optimality criteria in modified variational control problems with PDE constraints. Optim. Control Appl. Meth. 2020, 41, 1160–1175. [Google Scholar] [CrossRef]
  7. Treanţă, S. On Modified Interval-Valued Variational Control Problems with First-Order PDE Constraints. Symmetry 2020, 12, 472. [Google Scholar] [CrossRef] [Green Version]
  8. Treanţă, S. On a modified optimal control problem with first-order PDE constraints and the associated saddle-point optimality criterion. Eur. J. Control 2020, 51, 1–9. [Google Scholar] [CrossRef]
  9. Treanţă, S. Saddle-point optimality criteria involving (ρ, b, d)-invexity and (ρ, b, d)-pseudoinvexity in interval-valued optimization problems. Int. J. Control 2021. [Google Scholar] [CrossRef]
  10. Liu, X.W.; Yuan, Y.X. A robust algorithm for optimization with general equality and inequality constraints. SIAM J. Sci. Comput. 2000, 22, 517–534. [Google Scholar] [CrossRef]
  11. Jeyakumar, V.; Wang, J.H.; Li, G. Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty. J. Math. Anal. Appl. 2012, 393, 285–297. [Google Scholar] [CrossRef] [Green Version]
  12. Wei, H.Z.; Chen, C.R.; Li, S.J. Characterizations for optimality conditions of general robust optimization problems. J. Optim. Theory Appl. 2018, 177, 835–856. [Google Scholar] [CrossRef]
  13. Jayswal, P.A.; Arana-Jiménez, M. Robust saddle-point criteria for multi-dimensional optimization problems with data uncertainty. Int. J. Control 2020. [Google Scholar] [CrossRef]
  14. Sun, X.K.; Teo, K.L.; Zeng, J.; Guo, X.L. On approximate solutions and saddle point theorems for robust convex optimization. Optim. Lett. 2020, 14, 1711–1730. [Google Scholar] [CrossRef]
  15. Treanţă, S. Efficiency in uncertain variational control problems. Neural Comput. Appl. 2021, 33, 5719–5732. [Google Scholar] [CrossRef]
  16. Lu, Z.; Zhu, Y.; Lu, Q. Stability analysis of nonlinear uncertain fractional differential equations with Caputo derivative. Fractals 2021, 29, 2150057. [Google Scholar] [CrossRef]
  17. Affane, D.; Yarou, M.F. General second order functional differential inclusion driven by the sweeping process with subsmooth sets. J. Nonlinear Funct. Anal. 2020, 2020, 26. [Google Scholar]
  18. Cernea, A. On the mild solutions of a class of second-order integro-differential inclusions. J. Nonlinear Var. Anal. 2019, 3, 247–256. [Google Scholar]
  19. Treanţă, S. On a Dual Pair of Multiobjective Interval-Valued Variational Control Problems. Mathematics 2021, 9, 893. [Google Scholar] [CrossRef]
  20. Treanţă, S. Duality Theorems for (ρ, ψ, d)-Quasiinvex Multiobjective Optimization Problems with Interval-Valued Components. Mathematics 2021, 9, 894. [Google Scholar] [CrossRef]
  21. Saunders, D.J. The Geometry of Jet Bundles; London Math. Soc. Lecture Notes Series, 142; Cambridge Univ. Press: Cambridge, UK, 1989. [Google Scholar]
  22. Treanţă, S. Constrained variational problems governed by second-order Lagrangians. Appl. Anal. 2020, 99, 1467–1484. [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

Treanţă, S. On a Class of Second-Order PDE&PDI Constrained Robust Modified Optimization Problems. Mathematics 2021, 9, 1473. https://doi.org/10.3390/math9131473

AMA Style

Treanţă S. On a Class of Second-Order PDE&PDI Constrained Robust Modified Optimization Problems. Mathematics. 2021; 9(13):1473. https://doi.org/10.3390/math9131473

Chicago/Turabian Style

Treanţă, Savin. 2021. "On a Class of Second-Order PDE&PDI Constrained Robust Modified Optimization Problems" Mathematics 9, no. 13: 1473. https://doi.org/10.3390/math9131473

APA Style

Treanţă, S. (2021). On a Class of Second-Order PDE&PDI Constrained Robust Modified Optimization Problems. Mathematics, 9(13), 1473. https://doi.org/10.3390/math9131473

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