Citation: Miniak-Górecka Alicja, Nowakowski Andrzej. Sufficient optimality conditions for a class of epidemic problems with control on the boundary[J]. Mathematical Biosciences and Engineering, 2017, 14(1): 263-275. doi: 10.3934/mbe.2017017
[1] | Vincenzo Capasso, Sebastian AniȚa . The interplay between models and public health policies: Regional control for a class of spatially structured epidemics (think globally, act locally). Mathematical Biosciences and Engineering, 2018, 15(1): 1-20. doi: 10.3934/mbe.2018001 |
[2] | Paula A. González-Parra, Sunmi Lee, Leticia Velázquez, Carlos Castillo-Chavez . A note on the use of optimal control on a discrete time model of influenza dynamics. Mathematical Biosciences and Engineering, 2011, 8(1): 183-197. doi: 10.3934/mbe.2011.8.183 |
[3] | Majid Jaberi-Douraki, Seyed M. Moghadas . Optimal control of vaccination dynamics during an influenza epidemic. Mathematical Biosciences and Engineering, 2014, 11(5): 1045-1063. doi: 10.3934/mbe.2014.11.1045 |
[4] | Rinaldo M. Colombo, Mauro Garavello . Stability and optimization in structured population models on graphs. Mathematical Biosciences and Engineering, 2015, 12(2): 311-335. doi: 10.3934/mbe.2015.12.311 |
[5] | Jerzy Klamka, Helmut Maurer, Andrzej Swierniak . Local controllability and optimal control for\newline a model of combined anticancer therapy with control delays. Mathematical Biosciences and Engineering, 2017, 14(1): 195-216. doi: 10.3934/mbe.2017013 |
[6] | Mario Lefebvre . An optimal control problem without control costs. Mathematical Biosciences and Engineering, 2023, 20(3): 5159-5168. doi: 10.3934/mbe.2023239 |
[7] | Qiuyi Su, Jianhong Wu . Impact of variability of reproductive ageing and rate on childhood infectious disease prevention and control: insights from stage-structured population models. Mathematical Biosciences and Engineering, 2020, 17(6): 7671-7691. doi: 10.3934/mbe.2020390 |
[8] | Seyedeh N. Khatami, Chaitra Gopalappa . A reinforcement learning model to inform optimal decision paths for HIV elimination. Mathematical Biosciences and Engineering, 2021, 18(6): 7666-7684. doi: 10.3934/mbe.2021380 |
[9] | Jun Liu, Xiang-Sheng Wang . Dynamic optimal allocation of medical resources: a case study of face masks during the first COVID-19 epidemic wave in the United States. Mathematical Biosciences and Engineering, 2023, 20(7): 12472-12485. doi: 10.3934/mbe.2023555 |
[10] | Yu Shen, Hecheng Li . A new differential evolution using a bilevel optimization model for solving generalized multi-point dynamic aggregation problems. Mathematical Biosciences and Engineering, 2023, 20(8): 13754-13776. doi: 10.3934/mbe.2023612 |
The epidemic problem man-environment in [3] is stated as optimal control problem. The functional consists of three members and the state equations are governed by two PDE: parabolic linear equation and nonlinear first order equation with feedback operator on the boundary.
Thus optimal control problem (P) is to minimize
J(u1,u2,w)=∫T0∫ΩF(u2(t,x)dxdt+∫T0∫∂Ωh(w(t,x))dxdt+∫Ωl(u2(T,x))dx | (1) |
over all
∂u1∂t−Δu1+a11u1=0,in Q=(0,T)×Ω, | (2) |
∂u2∂t+a22u2−g(u1)=0,in Q, | (3) |
u1(0,x)=u01(x), u2 (0,x)=u02(x) for x∈Ω, | (4) |
∂u1∂ν+αu1=K∗u2=∫ΩK(t,x,σ)u2(t,x)dx, (t,σ)∈∑1=(0,T)×Γ1, | (5) |
∂u1∂ν=0 in ∑2=(0,T)×Γ2. | (6) |
where
K(t,x,σ,w)=N∑i=1wi(t,σ)Ki(x,σ) for t∈[0,T], x∈Ω, σ∈Γ1, | (7) |
h(w)=N∑i=1hi(wi), | (8) |
where
hi(r)={λ/r2if 0<r≤a,+∞otherwise. | (9) |
The following
K(t,x,σ,w)=w(t)K(σ), t∈[0,T], σ∈Γ1, | (10) |
with
K(σ)=m∑i=1aiχi(σ), | (11) |
where
The dual approach to dynamic programming was first introduced in [8] and then developed in several papers to different optimal control problems governed by: elliptic, parabolic and wave equations (see e.g. [5], [11], [10], [9]). The essential point in this dual approach is that we do not deal directly with a value function but with some auxiliary function, defined in a dual set, satisfying dual dynamic equation. The auxiliary function allow us to derive sufficient optimality condition for primal value function. The dual approach has some advantages: we do not need any properties of the value function such as smoothness or convexity. However it has also some disadvantages: the auxiliary function must satisfy a kind of generalised transversality conditions which is a little restrictive. The approach we present here was inspired by PhD thesis [7] of the first author where the model of distortion compensation (elliptic system of equations) was investigated. A new challenge in the control problem (1)-(6) is that the problem under consideration has the control on the boundary and with fixed initial conditions. Therefore we need really to construct a new dual dynamic programming type approach for problem (1)-(6). Thus let us start first with the definition of a dual set. Let
Y={(y0,y)=p;(t,x,p)∈P}. | (12) |
Denote by
P1={(t,x,p);(t,x)∈∑1}, |
P2={(t,x,p);(t,x)∈(0,T)×Γ2}, |
clY={(y0,y)=p;(t,x,p)∈clP}. |
Let
f1=−a11u1, | (13) |
f2=g(u1)−a22u2, | (14) |
g1=−αu1+∫ΩK(t,x,σ,w)u2(t,x)dx, | (15) |
g2=0. | (16) |
Let us introduce an auxiliary function
V(t,x,p)=y0Vy0(t,x,p)+yVy(t,x,p)for(t,x,p)∈clP, | (17) |
where
u(t,x,p)=−Vy(t,x,p),(t,x,p)∈clP. | (18) |
We shall consider not all admissible controls and corresponding to them admissible states but only those which relate to
Adu={(u(⋅),w(⋅))∈Ad;existp(t,x)=(y0,y(t,x)),(t,x)∈Q,y(⋅)∈(H2(Q))2,y0≤0,(t,x,p(t,x))∈clP,y(0,x)=ξ(x),u(t,x)=u(t,x,p(t,x)),(t,x)∈clQ}. | (19) |
In fact our optimal control problem we shall study just on the set
SD=inf(u,w)∈Adu−y0J(u,w). | (20) |
Notice that in spite of that our problem depends on time we cannot perturb it with respect to initial data and time (they are fixed) as it is usually done in classical optimal control theory. This is why a dual dynamic approach to the above problem seems to be the only one possible. Thus let us introduce a dual Hamilton-Jacobi equation in
Vt(t,x,p)−ΔxV(t,x,p)+yf(t,x,−Vy(t,x,p))+y0F(−Vy2(t,x,p))=0 | (21) |
and dual Hamilton-Jacobi type equation on
infw∈M{∂V(t,x,p)∂ν+yg(t,x,−Vy(t,r,p),w)−y0h(w)}=0, | (22) |
∂V(t,x,p)∂ν=0,for(t,x,p)∈P2, | (23) |
−y0Vy0(T,x,p)=−y0l(−Vy2(T,x,p)). | (24) |
We should stress that the notion of dual Hamilton-Jacobi equation appears also in convex optimization (see [2]). However the above dual Hamilton-Jacobi equation is completely different than that in [2]. Our problem is nonconvex and we do not use any tools from convex analysis.
The dual approach to dynamic programming described in the former section allow us to formulate and to prove a kind of verification theorem ensuring sufficient optimality conditions for our problem (20). We would like to stress that we are working now in dual space
P={p(t,x)=(y0,y(t,x)),(t,x)∈Q;(t,x,p(t,x))∈clP,y(⋅)∈(H2(Q))2,y(0,x)=ξ(x),exist(u(⋅),w(⋅))∈Adu,u(t,x)=−Vy(t,x,p(t,x)),(t,x)∈Q∪Γ}. |
Theorem 3.1. Assume that there exists
Vt(t,x,ˉp(t,x))−ΔxV(t,x,ˉp(t,x))+ˉy(t,x)f(t,x,−Vy(t,x,ˉp(t,x)))+ˉy0F(−Vy2(t,x,p¯(t,x))), | (25) |
∂V(t,x,ˉp(t,x))∂ν+ˉy(t,x)g(t,x,−Vy(t,x,ˉp(t,x)),ˉw(t,x))−ˉy0h(ˉw(t,x))=0, | (26) |
−y0Vy0(T,x,ˉp(T,x))=−y0l(−Vy2(T,x,ˉp(T,x))), | (27) |
∂V(t,x,ˉp(t,x))∂n=0,for(t,x,ˉp(t,x))∈P2. | (28) |
Then
(ˉu(⋅),ˉw(⋅)) |
is an optimal pair with respect to all
−ˉy0J(u¯,w¯)≤−y0J(u,w). |
Proof. We follow the standard way in proofs of verification theorems. Thus take any
Vt(t,x,p(t,x))−ΔxV(t,x,p(t,x))=ˉy0(ddtVy0(t,x,p(t,x))−ΔxVy0(t,x,p(t,x)))+y(t,x)(ddtVy(t,x,p(t,x))−ΔxVy(t,x,p(t,x))). | (29) |
From (2)-(5) (see also (13)-(14)) we have
ddtVy(t,x,p(t,x))−ΔxVy(t,x,p(t,x))=−f(t,x,−Vy(t,x,p(t,x))). | (30) |
Putting (30) into (29) and applying (21) we get equality
y0(ddtVy0(t,x,p(t,x))−ΔxVy0(t,x,p(t,x)))+y0F(−Vy(t,x,,p(t,x))). | (31) |
Following the same way as above but now using equality (25) we come to the equality
ˉy0(ddtVy0(t,x,ˉp(t,x))−ΔxVy0(t,x,ˉp(t,x)))+ˉy0F(−Vy(t,x,ˉp(t,x)))=0. | (32) |
Now we consider dual Hamilton-Jacobi type equation on
∂V(t,x,p(t,x))∂ν=y0∂Vy0(t,x,p(t,x))∂ν+y(t,x)∂Vy(t,x,p(t,x))∂ν. | (33) |
From (2)-(5) (see also (15)-(16)) we have, for the same
∂Vy(t,x,p(t,x))∂ν=−g(t,x,−Vy(t,x,p(t,x)),w(t,x)). | (34) |
Putting (34) into (33) and applying (22) we get inequality at
ˉy0∂Vy0(t,x,p(t,x))∂ν≥y0h(w(t,x)) | (35) |
Similarly we get equality at
ˉy0∂Vy0(t,x,ˉp(t,x))∂ν=−ˉy0h(ˉw(t,x)). | (36) |
Let us integrate over
y0∫ΩVy0(T,x,p(T,x))dx−y0∫ΩVy0(0,x,p(0,x))dx+y0∫T0∫ΩF(−Vy2(t,x,p(t,x)))dxdt+y0∫T0∫∂Ωh(w(t,x))dxdt≤0,ˉy0∫ΩVy0(T,x,ˉp(T,x))dx−ˉy0∫ΩVy0(0,x,ˉp(0,x))dx+ˉy0∫T0∫ΩF(−Vy2(t,x,ˉp(t,x)))dxdt+ˉy0∫T0∫∂Ωh(ˉw(t,x))dxdt≤0. | (37) |
From the above relations, (24), (27) and taking into account that
−ˉy0∫T0∫ΩF(−Vy2(t,x,ˉp(t,x)))dxdt−ˉy0∫T0∫0∂Ωh(ˉw(t,x))dxdt−ˉy0∫Ωl(−Vy2(T,x,p(T,x)))dx≤y0∫T0∫ΩF(−Vy2(t,x,p(t,x)))dxdt−y0∫T0∫∂Ωh(w(t,x))dxdt−y0∫Ωl(−Vy2(T,x,p(T,x)))dx. |
Directly from (37) and (27) we infer
Corollary 1. The dual optimal value can also be defined with the help of
ˉy0∫ΩVy0(0,x,ˉp(0,x))dx=−ˉy0∫T0∫ΩF(−Vy2(t,x,ˉp(t,x)))dxdt−ˉy0∫T0∫0∂Ωh(ˉw(t,x))dxdt−ˉy0∫Ωl(−Vy2(T,x,ˉp(T,x)))dx. |
In optimal control theory all what we want to find is to calculate optimal control and optimal value. However, in practice, a feedback control is more important than a value function. It turns out that the dual dynamic programming approach allows to define a kind of a feedback control. In fact with the help of the dual feedback control we can formulate and prove the verification theorem. Surprisingly, the dual feedback control have better properties than the classical one in spite of that it appears on the boundary. First we define general feedback control on the boundary and then optimal feedback control.
Definition 4.1. A function
∂u∂t−Δu,=f(t,x,u), (t,x)∈Q |
with the boundary condition
∂u1∂ν+αu1=∫ΩN∑i=1wi(t,σ,p)Ki(x,σ)u2(t,x)dx,(t,σ)∈∑1. |
Next step is to define optimal dual feedback control.
Definition 4.2. Dual feedback controls
ˉu(t,x)=ˉu(t,x,ˉp(t,x)),(t,x)∈ˉQ, |
ˉw(t,x)=ˉw(t,x,ˉp(t,x)),(t,x)∈∑1 |
with optimal value
Following the same way as in the proof of Theorem 3.1 one can prove the theorem on sufficient optimality conditions for our problem (1)-(5) in terms of optimal dual feedback controls.
Theorem 4.3. Let
Vy(t,r,p)=−ˉu(t,x,p) |
and that condition (17) in
Sˉu,ˉy0D=−ˉy0∫ΩVy0(0,x,ˉp(0,x))dx |
and that
The theory presented in the last two subsections being in terms of dual dynamic programming gives us a possibility to find at least formally the optimal value. However in practice it is difficult (or even impossible) to solve equations stated there in exact form. In fact we solve such a system using different approximate (numerical) methods. Therefore what we can get then is eventually approximate optimality. This is why in this section we present dual dynamic approach to sufficient conditions for approximate (
Sˉu,ˉy0D=inf(w,u)∈Adˉu−y0∫T0F(−Vy2(t,x,p(t,x)))dx |
−y0∫T0∫∂Ωh(w(t,x)dxdt−y0∫Ωl(−Vy2(T,x,p(T,x)))dx. |
Dual
Sˉu,ˉy0D≤Su,ˉy0εεD≤Sˉu,ˉy0D−4εˉy0ε. | (38) |
Let us fix
εˉy0ε≤˜Vt(t,x,p)−Δx˜V(t,x,p)+yf(t,x,−˜Vy(t,x,p))+y0F(−˜Vy2(t,x,p))≤0 | (39) |
and dual Hamilton-Jacobi type inequality on
εˉy0ε≤infw∈M{∂˜V(t,x,p)∂ν+yg(t,x,−˜Vy(t,x,p),w)−y0h(w)}≤0, | (40) |
∂˜V(t,x,p)∂ν=0,for(t,r,p)∈P2, | (41) |
−y0˜Vy0(T,x,p)=−y0l(−˜Vy2(T,x,p)). | (42) |
0≥∂˜Vy(t,x,p)∂ν+g(t,x,−˜Vy(t,x,p),w)≥εmˉy0ε. | (43) |
We want to apply our theory to numerical solutions of (2)-(6), therefore instead of system of equations we shall deal with systems of inequalities:
0≤∂u∂t−(Δu1,0)−f(t,x,u)≤−εmˉy0ε | (44) |
satisfying the boundary condition
0≥−∂u∂ν+g(t,x,u,w(t,x))≥εmˉy0ε, | (45) |
Thus in this section by the set of admissible controls and states i.e. satisfying (44)-(45) we denote
Now we are ready to describe the concept of
uε(t,x,p)=−˜Vy(t,x,p),(t,x,p)∈clP. | (46) |
For
Aduε={(u(⋅),w(⋅))∈Adε;existp(t,x)=(y0,y(t,x)),(t,x)∈Q,y(⋅)∈(H2(Q))2,y0≤0,(t,x,p(t,x))∈clP,y(0,x)=ξ(x),u(t,x)=uε(t,x,p(t,x)),(t,x)∈clQ} |
and
Pε={p(t,x)=(ˉy0ε,y(t,x)),(t,x)∈Q;(t,x,p(t,x))∈clP,y(⋅)∈(H2(Q))2,sup(t,x)∈Q|y(t,x)|R2≤m, y>0, exist(u(⋅),w(⋅))∈Aduε,u(t,x)=−˜Vy(t,x,p(t,x)),(t,x)∈Q∪Γ}. |
Now we are ready to define notions of
Definition 6.1. Dual feedback control
ˉuε(t,x)=ˉuε(t,x,ˉpε(t,x)),(t,x)∈ˉQ,ˉwε(t,x)=ˉwε(t,x,ˉpε(t,x)),(t,x)∈ˉQ | (47) |
belongs to
Sˉuεˉy0εεD=−ˉy0ε∫Ω˜Vy0(0,x,ˉpε(0,x))dx. | (48) |
Definition 6.2. For given
−ˉy0ε∫T0∫ΩF(−Vy2(t,x,ˉpε(t,x)))dx−ˉy0ε∫T0∫∂Ωh(ˉwε(t,x))dxdt−ˉy0ε∫Ωl(−Vy2(T,x,ˉpε(T,x)))dx≤−ˉy0ε∫T0∫ΩF(−,Vy2(t,x,p(t,x)))dx−ˉy0ε∫T0∫∂Ωh(w(t,x))dtdx−ˉy0ε∫Ωl(−Vy2(T,x,p(t,x)))dx−4εˉy0ε. |
Having all the above notions we can formulate the verification theorem for
Theorem 6.3. Assume that there exists
ddt˜Vy(t,x,ˉpε(t,x))−Δx˜Vy(t,x,ˉpε(t,x))+f(t,x,−˜Vy(t,x,ˉpε(t,x)))≥ˉy0εεm, (t,x)∈Q, | (49) |
−εmˉy0ε≥˜Vt(t,x,ˉpε(t,x))−Δx˜V(t,x,ˉpε(t,x))+ˉyε(t,x)(f(t,x,−˜Vy(t,x,ˉpε(t,x))+ˉy0εF(−˜Vy2(t,x,ˉpε(t,x,))),, |
∂˜V(t,x,ˉpε(t,x))∂ν+ˉyε(t,x)g(t,x,−˜Vy(t,x,ˉpε(t,x)),ˉwε(t,x))−ˉy0εh(ˉwε(t,x))≤−εmˉy0ε, | (50) |
−ˉy0ε˜Vy0(T,x,ˉpε(t,x))=−ˉy0εl(−˜Vy2(T,x,ˉpε(T,x))),∂˜V(t,x,ˉpε(t,x))∂ν=0,for(t,x,p¯ε(t,x))∈P2. | (51) |
Then the pair
Proof. Take any
˜Vt(t,x,p(t,x))−Δx˜V(t,x,p(t,x))=ˉy0ε(ddt˜Vy0(t,x,p(t,x))−Δx˜Vy0(t,x,p(t,x)))+y(t,x)(ddt˜Vy(t,x,p(t,x))−Δx˜Vy(t,x,p(t,x))). |
Similarly, we have by (44)
−ddt˜Vy(t,x,p(t,x))+Δx˜Vy(t,x,p(t,x))−f(t,x,−˜Vy(t,x,p(t,x)))≥0 |
and then applying (39) (having in mind that
ˉy0ε(ddt˜Vy0(t,x,p(t,x))−Δx˜Vy0(t,x,p(t,x)))+ˉy0εF(−˜V(t,x,,p(t,x)))≥εˉy0ε | (52) |
and using inequality (25) we come to the inequality
−εˉy0ε≥¯yε0(ddt˜Vy0(t,x,ˉpε(t,x))−Δx˜Vy0(t,x,ˉpε(t,x)))+ˉy0εF(−˜V(t,x,ˉpε(t,x))). | (53) |
Considering transversality condition at the points belonging to
∂˜V(t,x,p(t,x))∂ν=ˉy0∂˜Vy0(t,x,p(t,x))∂ν+y(t,r)∂˜Vy(t,x,p(t,x))∂ν. | (54) |
From (43) we have, for the same
~∂Vy0(t,x,p(t,x))∂ν+g(t,x,−~Vy(t,x,p(t,x),w(t,x)))≤0. |
Hence we get inequality at
εˉy0ε≤ˉy0ε∂,˜Vy0(t,x,,p(t,x))∂ν+ˉy0εh(w(t,x)). | (55) |
Similarly, using (50) we get inequality at
ˉy0ε∂,˜Vy0(t,x,,ˉpε(t,x))∂ν+ˉy0εh(ˉwε(t,x))≤−εˉy0ε. | (56) |
Let us integrate over
ˉy0ε∫Ω˜Vy0(T,x,p(T,x))dx−ˉy0ε∫Ω˜Vy0(0,x,p(0,x))dxˉy0ε∫T0∫ΩF(−~Vy2(t,x,,p(t,x)))dx+ˉy0ε∫T0∫∂Ωh(,w(t,x))dtdx≥2εˉy0ε, |
¯yε0∫Ω˜Vy0(T,x,ˉpε(T,x))dx−ˉy0ε∫Ω˜Vy0(0,x,ˉpε(0,x))dx+ˉy0ε∫T0∫ΩF(−~Vy2(t,x,ˉpε(t,x)))dx+ˉy0ε∫T0∫∂Ωh(ˉwε(t,x))dtdx≤−2εˉy0ε. |
From the above relations we infer that
−ˉy0ε∫T0∫ΩF(ˉu2ε(t,x))dx−ˉy0ε∫T0∫∂Ωh(ˉwε(t,x))dtdx−ˉy0ε∫Ωl(ˉu2ε(T,x))≤−ˉy0ε∫T0∫ΩF(−~Vy2(t,x,p(t,x)))dx−ˉy0ε∫T0∫∂Ωh(w(t,x))dtdx−ˉy0ε∫Ωl(u2(T,x)dx−4εˉy0ε. |
This is just the assertion of the theorem.
The sufficient conditions formulated for
Algorithm:
1. Fix
2. Form
a) Define controls
b) To calculate
3. Find minimal value of
4. Assume
ˆu(t,x)=−˜Vy(t,x,−1,ˆy(t,x)). | (57) |
5. For
a) If
then
b) If
then go to 2.
Numerical experiments we do for the same data as in [1] i.e.
the graph of it is:
the graph of it is:
The
The paper was inspired by the lecture given by V. Capasso during the conference Micro and Macro Systems in Life Sciences in Bedlewo 2015.
[1] | [ V. Arnautu,V. Barbu,V. Capasso, Controlling the spread of a class of epidemics, Appl. Math. Optim., 20 (1989): 297-317. |
[2] | [ V. Barbu and T. Precupanu, Convexity and Optimization in Banach Spaces Science+Business Media, Springer 2012. |
[3] | [ V. Capasso, Mathematical Structures of Epidemic Systems Lect. Notes in Biomath., 97 Springer 2008. |
[4] | [ V. Capasso,K. Kunisch, A reaction-diffusion system arising in modelling man-environment diseases, Quart. Appl. Math., 46 (1988): 431-450. |
[5] | [ E. Galewska,A. Nowakowski, A dual dynamic programming for multidimensional elliptic optimal control problems, Numer. Funct. Anal. Optim., 27 (2006): 279-289. |
[6] | [ W. Hao and A. Friedman, The LDL-HDL profile determines the risk of atherosclerosis: A mathematical model PLoS ONE 9 (2014), e90497. |
[7] | [ A. Miniak-Górecka, Construction of Computational Method for ε-Optimal Solutions Shape Optimization Problems PhD thesis, 2015. |
[8] | [ A. Nowakowski, The dual dynamic programming, Proc. Amer. Math. Soc., 116 (1992): 1089-1096. |
[9] | [ A. Nowakowski, Sufficient optimality conditions for Dirichlet boundary control of wave equations, SIAM J. Control Optim., 47 (2008): 92-110. |
[10] | [ I. Nowakowska,A. Nowakowski, A dual dynamic programming for minimax optimal control problems governed by parabolic equation, Optimization, 60 (2011): 347-363. |
[11] | [ A. Nowakowski,J. Sokołowski, On dual dynamic programming in shape control, Commun. Pure Appl. Anal., 11 (2012): 2473-2485. |
1. | Andrzej Nowakowski, Anita Krawczyk, Control of tumor growth modeled by system of PDE, numerical analysis of optimality conditions, 2022, 45, 0170-4214, 9371, 10.1002/mma.8311 |