Next Article in Journal
Bayesian Estimation Using Product of Spacing for Modified Kies Exponential Progressively Censored Data
Previous Article in Journal
Kinematic Geometry of a Timelike Line Trajectory in Hyperbolic Locomotions
Previous Article in Special Issue
The Optimal Strategies to Be Adopted in Controlling the Co-Circulation of COVID-19, Dengue and HIV: Insight from a Mathematical Model
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Optimal Treatment Strategy for Cancer Based on Mathematical Modeling and Impulse Control Theory

1
School of Mathematics and Computer Science, Yunnan Minzu University, 2929, Yuehua Street, Chenggong District, Kunming 650500, China
2
School of Mathematics and Statistics, Wuhan University, 299, Luojiashan Street, Wuchang District, Wuhan 430072, China
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Axioms 2023, 12(10), 916; https://doi.org/10.3390/axioms12100916
Submission received: 4 August 2023 / Revised: 13 September 2023 / Accepted: 20 September 2023 / Published: 27 September 2023
(This article belongs to the Special Issue Control Theory and Its Application in Mathematical Biology)

Abstract

:
Adaptive therapy is a new type of cancer treatment in which time and dose are dynamically changed according to different individuals, which is very different from conventional cancer treatment strategies that use the maximum dose to kill the tumor cells. However, how to determine the time and dose of drug treatment is a challenging problem. In this paper, a competition model between drug-sensitive cells and drug-resistant cells was established, in which pulse intervention was introduced. In addition, based on the theory of pulse optimal control, three pulse optimal control strategies are proposed in the process of cancer treatment by controlling the pulse interval and dose, minimizing the number of tumor cells at the end of the day at minimal cost. Finally, three optimization strategies were compared, using numerical simulation, in terms of tumor burden and the effect on drug-resistant cells. The results show that the hybrid control strategy has the best effect. This work would provide some new ideas for the treatment of cancer.

1. Introduction

Cancer is the leading cause of death in most countries and regions in the world, and China ranks first in the number of cancer deaths in the world [1]. How to treat this kind of disease more effectively has become the problem that many scholars study. In reference [2], MTD therapy mainly controls tumor burden by killing sensitive subpopulations with high frequency administration. In references [3,4], adaptive therapy, as a new approach to cancer therapy, exploits the competitive interaction between drug-sensitivity and drug-resistance subpopulations; a stable tumor burden is maintained by allowing a large number of therapy-sensitive cells to survive. However, with the continuation of the treatment cycle, there will be a large number of drug-resistant cells, and this will ultimately lead to treatment failure [5,6] as scholars continue to study and refine. In reference [7], treatment time was shortened by adjusting tumor baseline burden based on a competing model of three different prostate cancer cell populations. In reference [8], a competitive model of drug sensitivity and drug resistance of tumor cells was established. A new dynamic optimization problem with constraints was proposed to dynamically adjust the treatment cycle and adaptive treatment dose for prostate cancer. In reference [9], the benefits of adaptive therapy were enhanced by considering the benefits of intratumoral competition and tumor control, killing sensitive cells, assessing the time to stop the treatment cycle, and switching to high-frequency dosing.
The pulse phenomenon is that, for some reason, the state of the system will change or be destroyed in a short time, thus changing the original trajectory. At present, many achievements have been made in the research of pulse effect in the model [10]. However, pulse therapy is rare in cancer treatment. In the tumor system, sensitive cells are easily regulated by drugs, while resistant cells can only be regulated indirectly by sensitive cells. Therefore, the number of sensitive cells significantly decreased after pulse administration, further regulating the number of drug-resistant cells. Based on this, a competition model with an impulsive effect between sensitive cells and drug-resistant cells was established in this paper. The time and dose of pulse administration were further studied. At present, the analysis of pulse optimal control theory and numerical techniques have been well developed. Taking references [11,12,13,14,15,16] as examples, the theory and method of pulse optimization were introduced in detail, and the time scale transformation method was widely used in pulse time optimization. The aim of this paper is to select the optimal pulse time and dose in finite time according to the pulse optimal control theory, and to minimize the drug cost and the final tumor burden.
The structure of this paper is as follows. In Section 2, a competitive model of drug-sensitive and drug-resistant cells after pulse intervention is established, and the model is analyzed theoretically. In Section 3, by means of time scaling and translation, three optimal control strategies, based on different pulse intervention time and dosage, are proposed in finite time by using a gradient calculation. In Section 4, based on numerical simulation, three control strategies are compared in terms of tumor burden and the number of drug-resistant cells, and the most effective control strategy is proposed. In the fifth part, a simple conclusion is drawn.

2. Mathematical Model and Its Theoretical Analysis

2.1. A Competition Model for Sensitive and Resistant Cells with Impulsive Effects

First, considering the interaction between prostate cancer cell lines, Liu et al. [8] established a competitive model for sensitive and resistant cells, as shown below.
d T 1 ( t ) d t = λ 1 T 1 1 T 1 a 11 + T 2 a 12 ( 1 + α β ( t ) ) K 1 μ 1 T 1 , d T 2 ( t ) d t = λ 2 T 2 1 T 1 a 21 + T 2 a 22 K 2 μ 2 T 2 .
where T 1 represents drug-sensitive cells, T 2 represents drug-resistant cells, λ 1 and λ 2 represent the net growth rate of cells, K 1 represents the environmental capacity of drug-sensitive cancer cells, K 2 represents the environmental capacity of drug-resistant cancer cells, μ 1 and μ 2 represent the natural mortality of cells, ( a i j ) 2 × 2 represents competition between sensitive and resistant cells, α represents the patient’s sensitivity to the targeted drug, and β is the drug dose.
Considering the impact of impulsive intervention on the model, the following model is obtained:
d T 1 ( t ) d t = λ 1 T 1 1 T 1 a 11 + T 2 a 12 K 1 μ 1 T 1 , d T 2 ( t ) d t = λ 2 T 2 1 T 1 a 21 + T 2 a 22 K 2 μ 2 T 2 , t t k , T 1 ( t k + ) = ( 1 p k ) T 1 ( t k ) , T 2 ( t k + ) = ( 1 + q k ) T 2 ( t k ) , t = t k , k = 1 , 2 , , n 1 .
Having initial conditions of
T 1 ( 0 ) = T 10 , T 2 ( 0 ) = T 20 .
where t k is the pulse time, p k ,   k = 1 , 2 , , n 1 is the dosage, and q k ,   k = 1 , 2 , , n 1 is an increase in drug-resistant cells; λ 1 , λ 2 , K 1 , K 2 , μ 1 , μ 2   p k , q k , and ( a i j ) 2 × 2 are constant.

2.2. Preliminaries

First, we will introduce and prove some theorems of the Lotka–Volterra model with impulsive effects [17,18,19], which are important to our follow-up results.
We consider the subsystem of the model
d T 1 ( t ) d t = T 1 ( t ) ( λ 1 μ 1 ) λ 1 a 11 K 1 T 1 ( t ) , t t k , T 1 ( t k + ) = ( 1 p k ) T 1 ( t k ) , t = t k ,   k = 1 , 2 , , n 1 .
Theorem 1.
If there are constants η i ( i = 1 , 2 ) such that
( λ 1 μ 1 ) η i + lim inf t + t t k < t + η i l n ( 1 p k ) > 0 ,
h 1 ( t , τ ) = t t k < t + τ l n ( 1 p k ) ,
h 1 ( t , τ ) is a bounded function on t R + , 0 τ max η 1 , η 2 . Then,
(1) There are constants m and M such that
m lim inf t + T 1 ( t ) lim sup t + T 1 ( t ) M ,
where T 1 ( t ) is any solution of a subsystem (3).
(2) lim t + ( T 11 ( t ) T 12 ( t ) ) = 0 , where T 11 ( t ) and T 12 ( t ) are two arbitrary solutions of a subsystem (3).
Proof. 
For convenience, let ( λ 1 μ 1 ) = a , λ 1 a 11 K 1 = b . By conditions (4) and (5), there are constants m 1 and m 2 , δ and T 0 , such that for all t T 0 , we can get
t t + η 1 ( a b m 1 ) d s + t t k < t + η 1 l n ( 1 p k ) < δ ,
t t + η 2 ( a b m 2 ) d s + t t k < t + η 2 l n ( 1 p k ) > δ .
Because h 1 ( t , τ ) is a bounded function on t R + , 0 τ max η 1 , η 2 , there is a constant Y 1 such that for any t R + .
| h 1 ( t , τ ) | = | t t k < t + τ l n ( 1 p k ) | < Y 1 .
Let T 1 ( t ) be any solution of a subsystem (3). If T 1 ( t ) m 1 , for t T , there is t = T + κ η , when κ > 0 is an integer, from T to t, to solve subsystem (3), we can get
T 1 ( t ) = T 1 ( T ) T < t k < t ( 1 p k ) exp T t ( a b T 1 ( s ) ) d s = T 1 ( T ) exp ( T t ( a b T 1 ( s ) ) d s + T t k < t l n ( 1 p k ) ) T 1 ( T ) ) exp ( T 0 T + η 1 ( a b m 1 ) d s + T t k < T + η 1 l n ( 1 p k ) ) + + T + ( κ 1 ) η 1 T + η 1 ( a b m 1 ) d s + T + ( κ 1 ) η 1 t k < T + η 1 l n ( 1 p k ) ) = T 1 ( T ) exp ( H 1 + T t k < T + η 1 l n ( 1 p k ) + + H 1 + T + ( κ 1 ) η 1 t k < T + κ η l n ( 1 p k ) ) T 1 ( T ) exp ( κ δ ) ,
where H 1 = ( ( a b m 1 ) η 1 ) , when κ , T 1 ( t ) 0 , this is a contradictory.
If T 1 ( t ) oscillates with respect to m 1 , we can choose two sequences γ n and γ n * which satisfy
0 < γ 1 < γ 1 * < < γ n < γ n * < , lim n + γ n = lim n + γ n * = ,
T 1 ( γ n ) m 1 , T 1 ( γ n + ) m 1 , T 1 ( γ n * ) m 1 , T 1 ( γ n * + ) m 1 ,
T 1 ( t ) m 1 , t ( γ n , γ n * ) , T 1 ( t ) m 1 , t ( γ n * , γ n + 1 ) .
Therefore, when n is large enough, γ n T , then for t ( γ n , γ n * ) , there is
T 1 ( t ) ˙ T 1 ( t ) ( a b m 1 ) ,   t t k .
Select an integer κ , where t = γ n + κ η 1 + μ 1 and 0 μ 1 < η 1 , with
T 1 ( t ) = T 1 ( γ n ) exp γ n t ( a b T 1 ( s ) ) d s + γ n t k < t l n ( 1 p k ) m 1 exp ( γ n γ n + η 1 ( a b m 1 ) d s + γ n t k < γ n + η 1 l n ( 1 p k ) ) + + γ n + ( κ 1 ) η 1 γ n + κ η 1 ( a b m 1 ) d s + γ n + ( κ 1 ) η 1 t k < γ + κ η 1 l n ( 1 p k ) ) + γ n + κ η 1 γ n + κ η 1 + μ 1 ( a b m 1 ) d s + γ n + κ η 1 t k < γ + κ η 1 + μ 1 l n ( 1 p k ) ) = m 1 exp ( H 1 + γ n t k < γ n + η 1 l n ( 1 p k ) + + H 1 + γ n + ( κ 1 ) η 1 t k < γ n + κ η 1 l n ( 1 p k ) ) + γ n + κ η 1 γ n + κ η 1 + μ 1 ( a b m 1 ) d s + γ n + κ η 1 t k < γ + κ θ 1 + μ 1 l n ( 1 p k ) ) m 1 exp ( ( κ δ ) + γ n + κ η 1 γ n + κ η 1 + μ 1 ( a b m 1 ) d s + γ n + κ η 1 t k < γ + κ η 1 + μ 1 l n ( 1 p k ) ) m 1 exp ( a b m 1 ) μ 1 + Y 1 = m 1 exp ( H 1 + Y 1 ) ,
where H 1 = ( ( a b m 1 ) η 1 ) . About t ( γ n * , γ n + 1 ) , there is T 1 ( t ) m 1 m 1 exp ( H 1 + Y 1 ) . Therefore, we have T 1 ( t ) < m 1 m 1 exp ( H 1 + Y 1 ) , t T 0 .
Now prove that m lim inf t + T 1 ( t ) . If T > T , there is T 1 ( t ) m 2 , then for t T + κ η , where κ 0 is an integer. We can get
T 1 ( t ) = T 1 ( T ) T < t k < t ( 1 p k ) exp T t ( a b T 1 ( s ) ) d s = T 1 ( T ) exp T t ( a b T 1 ( s ) ) d s + T t k < t l n ( 1 p k ) T 1 ( T ) exp ( T T + η 2 ( a b m 2 ) d s + T t k < T + η 2 l n ( 1 p k ) ) + + T + ( κ 1 ) η 2 T + κ η 2 ( a b m 2 ) d s + T + ( κ 1 ) η 2 t k < T + κ η 2 l n ( 1 p k ) ) = T 1 ( T ) exp ( H 2 + T t k < T + η 2 l n ( 1 p k ) + + H 2 + T + ( κ 1 ) η 2 t k < T + κ η 2 l n ( 1 p k ) ) T 1 ( T ) exp ( κ δ ) ,
where H 2 = ( ( a b m 2 ) η 2 ) , when κ , T 1 ( t ) , this is contradictory.
If T 1 ( t ) oscillates with respect to m 2 , we can choose two sequences γ n and γ n * which satisfy
0 < γ 1 < γ 1 * < < γ n < γ n * < , lim n + γ n = lim n + γ n * = ,
T 1 ( γ n ) m 2 , T 1 ( γ n + ) m 2 , T 1 ( γ n * ) m 2 , T 1 ( γ n * + ) m 2 ,
T 1 ( t ) m 2 , t ( γ n , γ n * ) , T 1 ( t ) m 2 , t ( γ n * , γ n + 1 ) .
Therefore, when n is large enough, γ n T , then for t ( γ n , γ n * ) , there is T 1 ( t ) ˙ T 1 ( t ) ( a b m 2 ) , t t k . Select an integer κ , where t = γ n + κ η 2 + μ 2 and 0 μ 2 < η 2 , with
T 1 ( t ) = T 1 ( γ n ) exp γ n t ( a b T 1 ( s ) ) d s + γ n t k < t l n ( 1 p k ) m 2 exp ( γ n γ n + η 2 ( a b m 2 ) d s + γ n t k < γ n + η 2 l n ( 1 p k ) ) + + γ n + ( κ 1 ) η 2 γ n + κ η 2 ( a b m 2 ) d s + γ n + ( κ 1 ) η 2 t k < γ n + κ η 2 l n ( 1 p k ) ) + γ n + κ η 2 γ n + κ η 2 + μ 2 ( a b m 2 ) d s + γ n + κ η 2 t k < γ n + κ η 2 + μ 2 l n ( 1 p k ) ) = m 2 exp ( H 2 + γ n t k < γ n + η 2 l n ( 1 p k ) + + H 2 + γ n + ( κ 1 ) η 2 t k < γ n + κ η 2 l n ( 1 p k ) ) + γ n + κ η 2 γ n + κ η 2 + μ 2 ( a b m 2 ) d s + γ n + κ η 2 t k < γ + κ η 2 + μ 2 l n ( 1 p k ) ) m 2 exp ( ( κ δ ) + γ n + κ η 2 γ n + κ η 2 + μ 2 ( a b m 2 ) d s + γ n + κ η 2 t k < γ + κ η 2 + μ 2 l n ( 1 p k ) ) m 2 exp ( a b m 2 ) μ 2 + Y 1 m 2 exp ( H 2 Y 1 ) ,
where H 2 = ( ( a b m 2 ) η 2 ) . About t ( γ n * , γ n + 1 ) , there is T 1 ( t ) m 2 m 2 exp ( H 2 Y 1 ) .
Therefore, we have T 1 ( t ) m 2 exp ( H 2 Y 1 ) , t T , then the assertion (1) is completed. Next, we prove any two solutions T 11 ( t ) and T 12 ( t ) of a subsystem to satisfy
lim t + ( T 11 ( t ) T 12 ( t ) ) = 0 .
Selecting any constants M 1 and M 2 , from assertion (1) we can get
M 1 T 11 ( t ) , T 12 ( t ) M 2 , t 0 .
Selecting a Lyapunov function V ( t ) = | l n T 11 ( t ) l n T 12 ( t ) ) | , V ( t ) is a bounded function on R + . According to the subsystem (3), there is
V ( t k + ) = | l n ( 1 p k ) T 11 ( t k ) l n ( 1 p k ) T 12 ( t k ) ) | = V ( t k ) .
D + V = s i g n ( T 11 ( t ) T 12 ( t ) ) T ˙ 11 ( t ) T 11 ( t ) T ˙ 12 ( t ) T 12 ( t ) = s i g n ( T 11 ( t ) T 12 ( t ) ) T 11 a b T 11 T 11 T 12 a b T 12 T 12 = b | T 11 T 12 | < b M 1 V ( t ) .
Therefore, V ( t ) V ( 0 ) exp ( b M 1 t ) . Then, when t , V ( t ) 0 . The assertion (2) is completed. □

2.3. Theoretical Analysis

In this section, we prove the permanence and global attractiveness of the model by using the knowledge of preparation. First, the permanence of system (2) is proved.
There are two subsystems:
d T 1 ( t ) d t = T 1 ( t ) ( λ 1 μ 1 ) λ 1 a 11 K 1 T 1 ( t ) , t t k , T 1 ( t k + ) = ( 1 p k ) T 1 ( t k ) , t = t k , k = 1 , 2 , , n 1 ,
d T 2 ( t ) d t = T 2 ( t ) ( λ 2 μ 2 ) λ 2 a 22 K 2 T 2 ( t ) , t t k , T 2 ( t k + ) = ( 1 + q k ) T 2 ( t k ) , t = t k , k = 1 , 2 , , n 1 .
For solutions T 1 * ( t ) and T 2 * ( t ) of (17) and (18), the permanence of system (2) is obtained as follows:
Theorem 2.
If there are constants θ i ( i = 1 , 2 ) such that
lim inf t + t t + θ 1 ( ( λ 1 μ 1 ) λ 1 a 12 K 1 T 2 * ( s ) ) d s + t t k < t + θ 1 l n ( 1 p k ) > 0 ,
lim inf t + t t + θ 2 ( ( λ 2 μ 2 ) λ 2 a 21 K 2 T 1 * ( s ) ) d s + t t k < t + θ 2 l n ( 1 + q k ) > 0 ,
h 1 ( t , τ ) = t t k < t + τ l n ( 1 p k ) , h 2 ( t , τ ) = t t k < t + τ l n ( 1 + q k ) .
h 1 ( t , τ ) and h 2 ( t , τ ) is bounded on t R + , and 0 τ max θ i , η i .
Then, the system (2) is permanence. There are normal numbers m and M, so that any positive solution Z ( t ) = ( T 1 ( t ) , T 2 ( t ) ) of system (2), we have
m lim inf t + T 1 ( t ) lim sup t + T 1 ( t ) M , m lim inf t + T 2 ( t ) lim sup t + T 2 ( t ) M .
Proof. 
For convenience, let ( λ 1 μ 1 ) = a ,   λ 1 a 11 K 1 = b ,   λ 1 a 12 K 1 = c ,   ( λ 2 μ 2 ) = d , λ 2 a 21 K 2 = e ,   λ 2 a 22 K 2 = f . According to the conditions (19) and (20), it can be seen that there are two positive constants ψ 0 and T, so that for all t T . We can get
t t + θ 1 a c ( T 2 * ( s ) + ψ 0 ) d s + t t k < t + θ 1 l n ( 1 p k ) > ψ 0 , t t + θ 2 d e ( T 1 * ( s ) + ψ 0 ) d s + t t k < t + θ 2 l n ( 1 + q k ) > ψ 0 .
Since h 1 and h 2 is bounded on t R + , where 0 τ max θ i , η i , then there are constants Y 1 , Y 2 such that
| h 1 ( t , τ ) | = | t t k < t + τ l n ( 1 p k ) | < Y 1 ,
| h 2 ( t , τ ) | = | t t k < t + τ l n ( 1 + q k ) | < Y 2 .
Let Z ( t ) = ( T 1 ( t ) , T 2 ( t ) ) be any positive solution of the system (2). Since
T 1 ( t ) ˙ T 1 ( t ) ( a b T 1 ( t ) ) , t t k .
According to the comparison theorem, when there is t 0 , T 1 ( t ) ϕ ( t ) , where ϕ ( t ) is the positive solution of the system (17), the initial condition ϕ ( 0 ) = T 1 ( 0 ) , according to Theorem 1, there is a positive constant T 1 T , when t T 1
T 1 ( t ) T 1 * ( t ) + ψ 0 .
Choosing the constant M 1 = s u p T 1 * ( t ) + ψ 0 , then 0 < M 1 < , obviously for all t T 1 , there is T 1 ( t ) M 1 .
Similarly, we can obtain T 2 ( t ) M 2 = s u p T 2 * ( t ) + ψ 0 , t R + , choose M = max M 1 , M 2 , then
lim sup t + T 1 ( t ) < M 1 , lim sup t + T 2 ( t ) < M 2 .
Now we prove
m 1 lim inf t + T 1 ( t ) , m 2 lim inf t + T 2 ( t ) .
If there is T 1 ( t ) ψ 0 for all t T 2 T , then for t = T 2 + κ θ 1 , where κ > 0 is an integer. We can get
T 1 ( t ) = T 1 ( T 2 ) exp ( T 2 t ( a b T 1 ( s ) c T 2 ( s ) ) d s + T 2 t k < t l n ( 1 p k ) ) T 1 ( T 2 ) exp ( T 2 T 2 + θ 1 ( a b ψ 0 c ( T 2 * ( s ) + ψ 0 ) ) d s + T 2 t k < T 2 + θ 1 l n ( 1 p k ) ) + + T 2 + ( κ 1 ) θ 1 T 2 + κ θ 1 ( a b ψ 0 c ( T 2 * ( s ) + ψ 0 ) ) d s + T 2 + ( κ 1 ) θ 1 t k < T 2 + κ θ 1 l n ( 1 p k ) ) T 1 ( T 2 ) exp ( κ ψ 0 + Y 1 ) .
Then, when κ has T 1 ( t ) , this is a contradiction.
If T 1 ( t ) oscillates with respect to ψ 0 , we can choose two sequences γ n and γ n * which satisfy
0 < γ 1 < γ 1 * < < γ n < γ n * < , lim n + γ n = lim n + γ n * = ,
T 1 ( γ n ) ψ 0 , T 1 ( γ n + ) ψ 0 , T 1 ( γ n * ) ψ 0 , T 1 ( γ n * + ) ψ 0 ,
T 1 ( t ) ψ 0 , t ( γ n , γ n * ) , T 1 ( t ) ψ 0 , t ( γ n * , γ n + 1 ) .
Therefore, when n is large enough, γ n T , then for t ( γ n , γ n * ) , there is T 1 ( t ) ˙ T 1 ( t ) ( a b ψ 0 c ( T 2 * ( s ) + ψ 0 ) ) , t t k . Select an integer κ 0 , where t = γ n + κ θ 1 + ε 1 and 0 ε 1 < θ 1 , with
T 1 ( t ) = T 1 ( γ n ) exp γ n t ( a b T 1 ( s ) c T 2 ( s ) ) d s + γ n t k < t l n ( 1 p k ) ψ 0 exp ( γ n γ n + θ 1 ( a b ψ 0 c ( T 2 * ( s ) + ψ 0 ) d s + γ n t k < γ n + θ 1 l n ( 1 p k ) ) + + γ n + ( κ 1 ) θ 1 γ n + κ θ 1 ( a b ψ 0 c ( T 2 * ( s ) + ψ 0 ) d s + γ n + ( κ 1 ) θ 1 t k < γ n + κ θ 1 l n ( 1 p k ) ) + γ n + κ θ 1 γ n + κ θ 1 + ε 1 ( a b ψ 0 c ( T 2 * ( s ) + ψ 0 ) d s + γ n + κ θ 1 t k < γ n + κ θ 1 + ε 1 l n ( 1 p k ) ) ψ 0 exp ( β 1 θ 1 Y 1 ) ,
where β 1 = sup t R + ( a + b ψ 0 + c ( T 1 * + ψ 0 ) ) .
About t ( γ n * , γ n + 1 ) , there is T 1 ( t ) ψ 0 ψ 0 exp ( β 1 θ 1 Y 1 ) , we have T 1 ( t ) ψ 0 > ψ 0 exp ( β 1 θ 1 Y 1 ) , when t T 2 . Similarly, we can obtain
lim inf t + T 2 ( t ) ψ 0 exp ( β 2 θ 2 Y 2 ) ,
where β 2 = sup t R + ( d + e ψ 0 + f ( T 2 * + ψ 0 ) ) .
Let m = min ψ 0 exp ( β 1 θ 1 Y 1 ) , ( β 2 θ 2 Y 2 ) . Then, m is independent of any positive solution of Equation (2). Therefore
m lim inf t + T 1 ( t ) , m lim sup t + T 2 ( t ) .
From (23) and (24), we finally understand that the system (2) is permanent.
Next, we prove the global attractiveness of the system (2).
Theorem 3.
Suppose there are two positive constants ω 1 and ω 2 , and a nonnegative integer F, such that
ω 1 λ 1 a 11 K 1 + ω 2 λ 2 a 21 K 2 F , ω 2 λ 2 a 22 K 2 + ω 1 λ 1 a 12 K 1 F , t 0 .
Then, for any positive solution Z 1 ( t ) = ( T 1 1 ( t ) , T 2 1 ( t ) ) , Z 2 ( t ) = ( T 1 2 ( t ) , T 2 2 ( t ) ) of the system of Equations (2), there is
lim t + ( Z 1 ( t ) Z 2 ( t ) ) = 0 .
Proof. 
For convenience, let λ 1 a 11 K 1 = b , λ 2 a 21 K 2 = e , λ 2 a 22 K 2 = f , λ 1 a 12 K 1 = c . For any solution Z 1 ( t ) = ( T 1 1 ( t ) , T 2 1 ( t ) ) , Z 2 ( t ) = ( T 1 2 ( t ) , T 2 2 ( t ) ) , it can be obtained from Theorem 2 that there are two positive constants C and D satisfying the following conditions, so that when t 0 , there is
C < T 1 i ( t ) , T 2 i ( t ) < D .
Selecting the Lyapunov function
V ( t ) = ω 1 | l n T 1 1 ( t ) l n T 2 1 ( t ) ) | + ω 2 | l n T 1 2 ( t ) l n T 2 2 ( t ) ) | .
such that
V ( t k + ) = ω 1 | l n ( 1 p k ) T 1 1 ( t ) l n ( 1 + q k ) T 2 1 ( t ) | + ω 2 | l n ( 1 p k ) T 1 2 ( t ) l n ( 1 + q k ) T 2 2 ( t ) | = V ( t k ) .
Then
D + V = ω 1 s i g n ( T 1 1 ( t ) T 2 1 ( t ) ) ( b ( T 1 1 ( t ) T 2 1 ( t ) ) c ( T 2 1 ( t ) T 2 2 ( t ) ) ) = ω 2 s i g n ( T 2 1 ( t ) T 2 2 ( t ) ) ( e ( T 1 1 ( t ) T 2 1 ( t ) ) f ( T 2 1 ( t ) T 2 2 ( t ) ) ) ( ω 1 b + ω 2 e ) | T 1 1 ( t ) T 2 1 ( t ) | + ( ω 2 f + ω 1 c ) | T 2 1 ( t ) T 2 2 ( t ) | δ F V ( t ) ,
where δ = C min ω i , i = 1 , 2 , V ( t ) V ( 0 ) exp ( δ F t ) .
Then, when t , V ( t ) 0 . Therefore,
lim t + ( Z 1 ( t ) Z 2 ( t ) ) = 0 ,
and the proof is completed. □

3. Optimal Control Strategies

In this section, we will consider three pulse optimal control strategies. Considering the effects of drugs on sensitive cells, studies were conducted with pulse interval and dose as control variables, with the goal of minimizing costs and the number of sensitive and resistant cells at the terminal moment, and therefore, we consider the following objective function at a finite time interval [ 0 ,   T ] .
min J ( η , p ) = k = 1 n 1 p k C + T 1 ( T ) + T 2 ( T ) .
η = ( η 1 , η 2 , , η n ) is time of pulse intervention, p = ( p 1 , p 2 , , p n 1 ) is the drug dose. C is the cost of the drug.
According to the optimal control theory of impulsive systems, because the existing optimization techniques cannot be directly solved (26) (reference [15]), can be based on the time scale transformation method to be solved. Finally, the gradient of the target function to the pulse interval and the drug dose is obtained. It is very important to seek the best control strategy for tumor therapy. We consider three control strategies to find the optimal pulse interval and dose, as shown below.

3.1. Optimal Pulse Time and Dose

Given the initial model
d T 1 ( t ) d t = λ 1 T 1 1 T 1 a 11 + T 2 a 12 K 1 μ 1 T 1 , d T 2 ( t ) d t = λ 2 T 2 1 T 1 a 21 + T 2 a 22 K 2 μ 2 T 2 , t t k , T 1 ( t k + ) = ( 1 p k ) T 1 ( t k ) , T 2 ( t k + ) = ( 1 + q k ) T 2 ( t k ) , t = t k ,   k = 1 , 2 , , n 1 .
The control variables p k and η k satisfy the condition
p k 1 p k p k 2 ,   k = 1 , , n 1 ,
0 = t 0 t 1 t n 1 t n = t f ,
t k t k 1 = η k ,
x k η k y k ,   k = 1 , , n .
p k 1 , p k 2 , x k , and y k are given non-negative constants.
We first construct a transformation from t [ 0 ,   T ] to s [ 0 ,   n ] , which maps the injection time 0 , t 1 , t 2 , , t n 1 , T to a definite time point s = 0 , 1 , , n .
We introduce time scaling changes
d t ( s ) d s = ν ( s ) .
There are initial conditions
t ( 0 ) = 0 .
ν ( s ) is called time scaling control and is piecewise constant function that may be discontinuous at Pulse Time s = 1 , 2 , , n 1 , then
ν ( s ) = k = 1 n η k χ ( k 1 , k ) ( s ) .
χ I ( s ) is the indicating function of I, defining
χ I ( t ) = 1 , t I , 0 , e l s e .
After the time scaling transformation, Equation (27) transformed into
d T 1 ( s ) d s = ν ( s ) λ 1 T 1 1 T 1 a 11 + T 2 a 12 K 1 μ 1 T 1 , d T 2 ( s ) d s = ν ( s ) λ 2 T 2 1 T 1 a 21 + T 2 a 22 K 2 μ 2 T 2 , s [ 0 ,   n ] , T 1 ( k + ) = ( 1 p k ) T 1 ( t k ) , T 2 ( k + ) = ( 1 + q k ) T 2 ( t k ) , k = 1 , 2 , , n 1 .
The objective function becomes
J ˜ ( η , p ) = k = 1 n 1 p k C + T 1 ( n ) + T 2 ( n ) .
Since (32) is still difficult to solve, we introduce the time translation transform
For k = 1 , , n 1 , n , define
T 1 k ( s ) = T 1 ( s + k 1 ) , T 2 k ( s ) = T 2 ( s + k 1 ) , π k ( s ) = t ( s + k 1 ) .
Time translation transform defined by (33), system (31), and (32) transformed into
d T 1 k ( s ) d s = ν ( s ) λ 1 T 1 k ( s ) 1 T 1 k ( s ) a 11 + T 2 k ( s ) a 12 K 1 μ 1 T 1 k ( s ) , d T 2 k ( s ) d s = ν ( s ) λ 2 T 2 k ( s ) 1 T 1 k ( s ) a 21 + T 2 k ( s ) a 22 K 2 μ 2 T 2 k ( s ) , s [ 0 ,   1 ] , T 1 k ( 0 ) = ( 1 p k 1 ) T 1 k 1 ( 1 ) , T 2 k ( 0 ) = ( 1 + q k 1 ) T 2 k 1 ( 1 ) , k = 2 , , n , d π k d s = η k , k = 1 , , n .
The corresponding objective function is
J ^ ( η , p ) = k = 1 n 1 p k C + T 1 n ( 1 ) + T 2 n ( 1 ) .
According to reference [18], we define the Hamiltonian function
H k ( s , ν ( s ) , T 1 k ( s ) , T 2 k ( s ) , λ k ( s ) , p k ) = λ 1 k ( s ) T 1 k ( s ) ˙ + λ 2 k ( s ) T 2 k ( s ) ˙ .
Theorem 4.
If the continuous functions λ k ( s ) satisfy the adjoint equations
λ ˙ 1 k ( s ) = H k T 1 k = η k λ 1 k ( s ) [ λ 1 ( 2 a 11 T 1 k ( s ) + a 12 T 2 k ( s ) ) λ 1 K 1 μ 1 ] λ 2 k ( s ) λ 2 a 21 T 2 k K 2 .
λ ˙ 2 k ( s ) = H k T 2 k = η k λ 2 k ( s ) [ λ 2 ( 2 a 22 T 2 k ( s ) + a 21 T 1 k ( s ) ) λ 2 K 2 μ 2 ] λ 1 k ( s ) λ 1 a 12 T 1 k K 1 .
With boundary conditions
λ 1 k ( 1 ) = 1 , λ 2 k ( 1 ) = 1 .
λ 1 k ( 1 ) = ( 1 p k ) λ 1 k + 1 ( 0 ) , λ 2 k ( 1 ) = ( 1 + q k ) λ 2 k + 1 ( 0 ) .
The gradient of the formula with respect to η j ( j = 1 , 2 , , n 1 ) is
η j J ( η j , p k ) = 0 1 ( λ 1 j ( s ) λ 1 T 1 j ( s ) ( 1 a 11 T 1 j ( s ) + a 12 T 2 j ( s ) K 1 ) μ 1 T 1 k + λ 2 j ( s ) λ 2 T 2 j ( s ) ( 1 a 21 T 1 j ( s ) + a 22 T 2 j ( s ) K 2 ) μ 2 T 2 k ) d s .
For j = 2 , , n .
p k J ( η j , p k ) = C ( λ 1 k + 1 ( 0 ) T 1 k ( 1 ) ) .
For k = 1 , 2 , , n 1 .
Proof. 
Known using Theorem 4.
λ ˙ 1 k ( s ) = H k T 1 k , λ ˙ 2 k ( s ) = H k T 2 k .
With boundary conditions
λ 1 k ( 1 ) = 1 , λ 2 k ( 1 ) = 1 ,
λ 1 k ( 1 ) = ( 1 p k ) λ 1 k + 1 ( 0 ) , λ 2 k ( 1 ) = ( 1 q k ) λ 2 k + 1 ( 0 ) .
we define
N ( 1 ) = T 1 ( 1 ) T 2 ( 1 ) T ,
N k ( 0 ) = ψ k 1 ( N k 1 ( 1 ) , p k , q k ) .
From (34), we can obtain
ψ k 1 ( N k 1 ( 0 ) , p k , q k ) = ( 1 p k ) T 1 k ( 1 ) ( 1 + q k ) T 2 k ( 1 ) .
Using the gradient Formula [15],
η j J ( η j , p 1 ) = 0 1 k = 1 n H k ( s , τ , T 1 k ( s ) , T 2 k ( s ) , λ k ( s ) , P ) η j d s = 0 1 ( λ 1 j ( s ) λ 1 T 1 j ( s ) ( 1 a 11 T 1 j ( s ) + a 12 T 2 j ( s ) K 1 ) μ 1 T 1 k + λ 2 j ( s ) λ 2 T 2 j ( s ) ( 1 a 21 T 1 j ( s ) + a 22 T 2 j ( s ) K 2 ) μ 2 T 2 k ) d s .
For j = 2 , , n .
p k J ( η j , p k ) = C + k = 1 n 1 ( λ k + 1 ( 0 ) ) T ψ k ( N k ( 1 ) , p k , q k ) p k = C ( λ 1 k + 1 ( 0 ) T 1 k ( 1 ) ) .
For k = 1 , 2 , , n 1 .
Based on Theorem 4, we briefly consider the latter two measures. □

3.2. The Optimal Dosage at a Fixed Time

If p k = p 1 , η k = η 1 , then
p 1 J ( p 1 ) = ( n 1 ) C + k = 1 n 1 ( λ k + 1 ( 0 ) ) T ψ k ( N k ( 1 ) , p 1 , q 1 ) p 1 = ( n 1 ) C k = 1 n 1 ( λ 1 k + 1 ( 0 ) T 1 k ( 1 ) ) .

3.3. Optimal Pulse Time and Constant Drug Dose

If p k = p 1 , η j = ( η 1 , η 1 , , η n 1 ) , then
η j J ( η j , p 1 ) = 0 1 k = 1 n H k ( s , τ , T 1 k ( s ) , T 2 k ( s ) , λ k ( s ) , P ) η j d s = 0 1 ( λ 1 j ( s ) λ 1 T 1 j ( s ) ( 1 a 11 T 1 j ( s ) + a 12 T 2 j ( s ) K 1 ) μ 1 T 1 k + λ 2 j ( s ) λ 2 T 2 j ( s ) ( 1 a 21 T 1 j ( s ) + a 22 T 2 j ( s ) K 2 ) μ 2 T 2 k ) d s .
For j = 2 , , n 1 .
p 1 J ( η j , p 1 ) = ( n 1 ) C + k = 1 n 1 ( λ k + 1 ( 0 ) ) T ψ k ( N k ( 1 ) , p 1 , q 1 ) p 1 = ( n 1 ) C k = 1 n 1 ( λ 1 k + 1 ( 0 ) T 1 k ( 1 ) ) .

4. Numerical Simulation

In this section, we simulate three control strategies, and then select the most effective strategy through the effect. We assume that drug-resistant cells grow at a rate of 0.01 and obtain the optimal objective function by determining the appropriate control parameters, namely pulse interval and drug dose.
Select the parameters
λ 1 = 0.02 ,   λ 2 = 0.5 ,   μ 1 = 0.001 ,   μ 2 = 0.0005 ,   a 11 = 0.2 ,  
a 12 = 0.1 ,   a 21 = 0.170 ,   a 22 = 0.2 ,   K 1 = 1000 ,   K 2 = 1500 .
The initial number of sensitive cells and resistant cells T 1 ( 0 ) = 8000 , T 2 ( 0 ) = 1 .

4.1. The Optimal Dosage at a Fixed Time

Suppose the period of the pulse η = 20 . Drug therapy is performed at Pulse Time Point t 1 = 4 , t 2 = 8 , t 3 = 12 , t 4 = 18 .
Suppose that the dosage constraints are as follows:
0 p 1 1 .
The optimal dosage p 1 * = 0.5337 , the optimal objective function J * = 1318.4819 , and T 1 * = 474.8244 and T 2 * = 736.9175 at the terminal time are calculated by using MATLAB software 2018a. Figure 1 shows the optimal dose at a fixed time, Figure 2 shows how the number of drug-sensitive and drug-resistant cells evolves at a given time under optimal pulse control, initial pulse control, and no pulse control. The black dotted line represents the trajectory of the cell under the optimal pulse control, and the blue dotted line represents the trajectory of the cell under the optimal pulse control. O (474.8244, 736.9175), M (571.4893, 653.6824), and N (9265.3104, 0) denote the number of sensitive and resistant cells at the terminal moment under the three control strategies.
From Figure 2, we can see that the application of impulse control significantly reduces the tumor burden.

4.2. Optimal Pulse Time and Constant Drug Dose

The initial values for the pulse dose and time interval are assumed to be
η 1 = η 2 = η 3 = η 4 = 4 .
p 1 = 0.5 .
The pulse interval satisfies constraint 1 η i 10 . The optimal pulse dosage and time interval are obtained through numerical simulation
η 1 * = 10 ,   η 2 * = 7 ,   η 3 * = 1 ,   η 4 * = 1 ,   η 5 * = 1 .
p 1 * = 0.7307 .
The number of T 1 * = 42.8566 and T 2 * = 133.6778 cells at the terminal moment and the optimal value of objective function is J * = 322.6744 .  Figure 3 shows the optimal dose at an unfixed time. Figure 4 shows how the number of drug-sensitive and drug-resistant cells evolves over a given time period under optimal pulse control, initial pulse control, and pulse-free control. O (42.8566, 133.6778), M (571.4893, 653.6824), and N (9265.3104, 0) indicate the number of terminal-moment-sensitive and -resistant cells under the three control strategies. Obviously, this control strategy not only reduced the tumor burden, but also further controlled the change in drug-resistant cells.
From Figure 4, we can see that tumor burden is significantly reduced by applying pulse control, and that optimal pulse control can further inhibit the growth of drug-resistant cells compared to initial pulse control.

4.3. Optimal Pulse Time and Dose

The initial values for the pulse dose and time interval are assumed to be
η 1 = η 2 = η 3 = η 4 = 4 .
p 1 = p 2 = p 3 = p 4 = 0.5 .
The pulse interval satisfies constraint 1 η i 10 . The optimal pulse dosage and time interval are obtained through numerical simulation
η 1 * = 9.9964 ,   η 2 * = 5.7180 ,   η 3 * = 1.9823 ,   η 4 * = 1.2926 ,   η 5 * = 1.0074 .
p 1 * = 0.7116 ,   p 2 * = 0.6503 ,   p 3 * = 0.7621 ,   p 4 * = 0.8686 .
The number of T 1 * = 25.7732 and T 2 * = 139.8360 cells at the terminal moment and the optimal value of objective function is J * = 315.4579 .  Figure 5 shows the optimal strategy under the combined control of pulse timing and dose. Figure 6 shows how the number of drug-sensitive and drug-resistant cells evolves over a given time period under optimal pulse control, initial pulse control, and pulse-free control. O (25.7732, 139.8360), M (571.4893, 653.6824), and N (9265.3104, 0) indicate the number of terminal-moment-sensitive and -resistant cells under the three control strategies. Obviously, compared to the previous strategy, the tumor burden is further reduced.
From Figure 6, we can see that the optimal control strategy also reduces the number of sensitive cells and suppresses the number of drug-resistant cells.
Based on the pulse optimal control strategy, it is found that the pulse intervention can significantly reduce the tumor load. Compared with the three optimal controls, fixed-time optimal controls can reduce tumor burden, but lead to an increase in the number of drug-resistant cells. Compared with an optimal strategy for a given dose, the mixed strategy cannot only inhibit the growth of drug-resistant cells, but also minimize the terminal tumor burden because, in the process of cancer treatment, along with the continuation of the treatment cycle, the proportion of drug-resistant cells increases, ultimately leading to treatment failure. Thus, for three optimal control strategies, the results of numerical simulations suggest that mixed optimal control can effectively suppress the number of drug-resistant cells while achieving a relatively small tumor burden. Therefore, a mixed control strategy is the most effective way to treat cancer. In the process of cancer treatment, pulse intervention, in order to find the optimal pulse interval and dose, can maintain a small tumor burden and, at the same time, inhibit the rapid increase in drug-resistant cells, delaying human life. Data were selected from reference [8], where λ 2 , μ 1 , μ 2 , a 12 , a 21 ; the remaining data, in order to obtain better results, were random values.

5. Conclusions

As a new approach to cancer treatment, adaptive therapy is a dynamic regulatory process. However, with the continuation of the treatment cycle, there will be a large number of drug-resistant cells, and this will ultimately lead to treatment failure. Using the research methods in references [15,20], this paper proposes a competition model between sensitive cells and drug-resistant cells, in which multiple pulse intervention measures are introduced. Firstly, the permanence and global attractiveness of the model are analyzed, which provide a theoretical basis for the following work. At the same time, pulse intervention can reduce the number of sensitive cells, further affecting the number of drug-resistant cells. Therefore, how should we reasonably select the time and dose of pulse intervention in order to achieve the best results? In this paper, based on different pulse control theories, three kinds of pulse optimal control are studied with the time and dose of pulse intervention as control variables; the three optimal control strategies are compared in terms of the tumor burden and the effect on drug-resistant cells. The results show that the mixed control strategy is the most effective for cancer treatment, because it cannot only suppress the number of drug-resistant cells, but also, at the terminal moment, the tumor burden is relatively minimal. Our study provides new ideas for the treatment of cancer; on the other hand, there are few studies on the application of pulse intervention during cancer treatment. Therefore, there are still more challenges in theoretical research, numerical analysis, etc. More research ideas are worth further exploration.

Author Contributions

W.L.: Conceptualization, Methodology, Formal analysis, Investigation, Writing—original draft, Writing—review and editing. X.T.: Conceptualization, Methodology, Validation, Writing—review and editing. J.S.: Validation, Formal analysis, Methodology, Writing—review and editing. All authors have read and agreed to the published version of the manuscript.

Funding

This reseach was funded by National Natural Science Foundation of China grant number 12361104.

Data Availability Statement

Data sharing is not applicable to this article as no data sets were generated or analysed during the current study.

Acknowledgments

This work is supported by the Youth Talent of Xingdian Talent Support Program (Xuewen Tan) and the National Natural Science Foundation of China (No. 12361104).

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Sung, H.; Ferlay, J.; Siegel, R.L.; Laversanne, M.; Soerjomataram, I.; Jemal, A.; Bray, F. Global Cancer Statistics 2020: GLOBOCAN Estimates of Incidence and Mortality Worldwide for 36 Cancers in 185 Countries. CA A Cancer J. Clin. 2021, 71, 209–249. [Google Scholar] [CrossRef] [PubMed]
  2. Gatenby, R.A. A change of strategy in the war on cancer. Nature 2009, 459, 508–509. [Google Scholar] [CrossRef] [PubMed]
  3. Gatenby, R.A.; Silva, A.S.; Gillies, R.J.; Frieden, B.R. Adaptive therapy. Cancer Res. 2009, 69, 4894–4903. [Google Scholar] [CrossRef] [PubMed]
  4. West, J.; You, L.; Zhang, J.; Gatenby, R.A.; Brown, J.S.; Newton, P.K.; Anderson, A.R.A. Towards Multidrug Adaptive Therapy. Cancer Res. 2020, 80, 1578–1589. [Google Scholar] [CrossRef] [PubMed]
  5. Gatenby, R.A.; Brown, J.; Vincent, T. Lessons from applied ecology: Cancer control using an evolutionary double bind. Cancer Res. 2009, 69, 7499–7502. [Google Scholar] [CrossRef] [PubMed]
  6. Bozic, I.; Reiter, J.G.; Allen, B.; Antal, T.; Chatterjee, K.; Shah, P.; Moon, Y.S.; Yaqubie, A.; Kelly, N.; Le, D.T.; et al. Evolutionary dynamics of cancer in response to targeted combination therapy. eLife 2013, 2, e00747. [Google Scholar] [CrossRef] [PubMed]
  7. Hansen, E.; Read, A.F. Modifying Adaptive Therapy to Enhance Competitive Suppression. Cancers 2020, 12, 3556. [Google Scholar] [CrossRef] [PubMed]
  8. Liu, R.; Wang, S.; Tan, X.; Zou, X. Identifying optimal adaptive therapeutic schedules for prostate cancer through combining mathematical modeling and dynamic optimization. Appl. Math. Model. 2022, 107, 688–700. [Google Scholar] [CrossRef]
  9. Wang, J.; Zhang, Y.; Liu, X.; Liu, H. Optimizing Adaptive Therapy Based on the Reachability to Tumor Resistant Subpopulation. Cancers 2021, 13, 5262. [Google Scholar] [CrossRef] [PubMed]
  10. Huo, L.A.; Ma, Y.C. Dynamical analysis of rumor spreading model with impulse vaccination and time delay. Phys. A Stat. Mech. Appl. 2017, 471, 653–665. [Google Scholar] [CrossRef]
  11. Teo, K.L.; Goh, C.J.; Wong, K.H. A unified computational approach to optimal control problems. In Proceedings of the First World Congress on World Congress of Nonlinear Analysts, Tampa, FL, USA, 19–26 August 1992; Volume III, pp. 2763–2774. [Google Scholar]
  12. Chen, M.M.; Pei, Y.Z.; Liang, X.Y.; Lv, Y.F. The Optimal Strategies of SI Pest Control Models with Impulsive Intervention. Acta Mathematica Scientia 2019, 39, 689–704. [Google Scholar]
  13. Hong, Z.; Xu, W.; Chen, L. A impulsive infective transmission SI model for pest control. Math. Methods Appl. Sci. 2010, 30, 1169–1184. [Google Scholar]
  14. Liu, Y.; Teo, K.L.; Wang, L. On a Class of Optimal Control Problems with State Jumps. J. Optim. Theory Appl. 1998, 98, 65–82. [Google Scholar] [CrossRef]
  15. Rui, L. Optimal Control Theory and Application of Pulse Switching System; University of Electronic Science and Technology Press: Chengdu, China, 2010. [Google Scholar]
  16. Loxton, R.; Lin, Q.; Teo, K.L. Switching time optimization for nonlinear switched systems: Direct optimization and the time-scaling transformation. Pac. J. Optim. 2014, 10, 537–560. [Google Scholar]
  17. Hou, J. Permanence and Asymptotic Behavior of the Nonautonomous Lotka-Valterra Competitive System with Impulses. J. Biomath. 2009, 24, 213–221. [Google Scholar]
  18. Hou, J.; Teng, Z.; Gao, S. Partial extinction, permanence and global attractivity innonautonomous n-species Lotka-Volterra competitivesystems with impulses. Appl. Math.-A J. Chin. Univ. 2011, 26, 161–176. [Google Scholar] [CrossRef]
  19. Parker, F.D. Management of Pest Populations by Manipulating Densities of Both Hosts and Parasites Through Periodic Releases. Biol. Control 1971, 365–376. [Google Scholar]
  20. Agur, Z.; Cojocaru, L.; Mazor, G.; Anderson, R.M.; Danon, Y.L. Pulse mass measles vaccination across age cohorts. Proc. Natl. Acad. Sci. USA 1993, 90, 11698–11702. [Google Scholar] [CrossRef] [PubMed]
Figure 1. Optimal control strategy.
Figure 1. Optimal control strategy.
Axioms 12 00916 g001
Figure 2. The dynamic behavior of T1 and T2.
Figure 2. The dynamic behavior of T1 and T2.
Axioms 12 00916 g002
Figure 3. Optimal control strategy.
Figure 3. Optimal control strategy.
Axioms 12 00916 g003
Figure 4. The dynamic behavior of T1 and T2.
Figure 4. The dynamic behavior of T1 and T2.
Axioms 12 00916 g004
Figure 5. Optimal control strategy.
Figure 5. Optimal control strategy.
Axioms 12 00916 g005
Figure 6. The dynamic behavior of T1 and T2.
Figure 6. The dynamic behavior of T1 and T2.
Axioms 12 00916 g006
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

Luo, W.; Tan, X.; Shen, J. Optimal Treatment Strategy for Cancer Based on Mathematical Modeling and Impulse Control Theory. Axioms 2023, 12, 916. https://doi.org/10.3390/axioms12100916

AMA Style

Luo W, Tan X, Shen J. Optimal Treatment Strategy for Cancer Based on Mathematical Modeling and Impulse Control Theory. Axioms. 2023; 12(10):916. https://doi.org/10.3390/axioms12100916

Chicago/Turabian Style

Luo, Wenhui, Xuewen Tan, and Juan Shen. 2023. "Optimal Treatment Strategy for Cancer Based on Mathematical Modeling and Impulse Control Theory" Axioms 12, no. 10: 916. https://doi.org/10.3390/axioms12100916

APA Style

Luo, W., Tan, X., & Shen, J. (2023). Optimal Treatment Strategy for Cancer Based on Mathematical Modeling and Impulse Control Theory. Axioms, 12(10), 916. https://doi.org/10.3390/axioms12100916

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