PMCCPMCCPMCC

Search tips
Search criteria 

Advanced

 
Logo of cmmmComputational and Mathematical Methods in Medicine
 
Comput Math Methods Med. 2011; 2011: 674318.
Published online 2011 April 18. doi:  10.1155/2011/674318
PMCID: PMC3114378

Optimal Control of HIV Dynamic Using Embedding Method

Abstract

This present study proposes an optimal control problem, with the final goal of implementing an optimal treatment protocol which could maximize the survival time of patients and minimize the cost of drug utilizing a system of ordinary differential equations which describes the interaction of the immune system with the human immunodeficiency virus (HIV). Optimal control problem transfers into a modified problem in measure space using an embedding method in which the existence of optimal solution is guaranteed by compactness of the space. Then the metamorphosed problem is approximated by a linear programming (LP) problem, and by solving this LP problem a suboptimal piecewise constant control function, which is more practical from the clinical viewpoint, is achieved. The comparison between the immune system dynamics in treated and untreated patients is introduced. Finally, the relationships between the healthy cells and virus are shown.

1. Introduction

Human immunodeficiency virus infects CD4+ T-cells, which are an important part of the human immune system, and other target cells. The infected cells produce a large number of viruses. Medical treatments for HIV have greatly improved during the last two decades. Highly active antiretroviral therapy (HAART) allows for the effective suppression of HIV-infected individuals and prolongs the time before the onset of acquired immune deficiency syndrome (AIDS) for years or even decades and increases life expectancy and quality to the patient. But antiretroviral therapy cannot eradicate HIV from infected patients because of the long-lived infected cells and sites within the body where drugs may not achieve effective levels [13]. HAART contains two major types of anti-HIV drugs: reverse transcriptase inhibitors (RTI), and protease inhibitors (PI). Reverse transcriptase inhibitors prevent HIV from infecting cells by blocking the integration of the HIV viral code into the host cell genome while protease inhibitors prevent infected cells from replication of infectious virus particles, and can reduce and maintain viral load below the limit of detection in many patients. Moreover, treatment with either type of drugs can also increase the CD4+ T-cell counts that are target cells for HIV.

Many of the host-pathogen interaction mechanisms during HIV infection and progression to AIDS are still unknown. Mathematical modeling of HIV infection is of interest to the medical community as no adequate animal models exist to test the efficacy of drug regimes. These models can test different assumptions and provide new insights into questions that are difficult to answer by clinical or experimental studies. A number of mathematical models have been formulated to describe various aspects of the interaction of HIV with healthy cells. Some of these models are addressed in [4]. The basic model of HIV infection is presented by Wodarz and Nowak [5], which contains three state variables: healthy CD4+ T-cells, infected CD4+ T-cells, and concentration of free virus. Their model has been modified to offer important theoretical insights into immune control of the virus, based on treatment strategies, while maintaining a simple structure [6]. Furthermore, this modified model has been developed to guess the natural evolution of HIV infection, as qualitatively described in several clinical studies [7].

Some authors have used mathematical models for HIV infection in conjunction with control theory to achieve appropriate goals. For example, these goals may include maximizing the level of healthy CD4+ T-cells and minimizing the cost of treatment [811], maximizing the level of healthy CD4+ T-cells while minimizing both the cost of treatment and viral load [12], minimizing both the HIV population and systemic costs to body while maximizing immune response [13, 14], and maximizing both the healthy CD4+ T-cell counts and immune response while minimizing the cost of treatment [15], maximizing the healthy CD4+ T-cell counts and minimizing both the side effects and drug resistance [16].

The papers [1721] consider only RTI medication while the papers [22, 23] consider only PIs. In [2427], all effects of a HAART medication are combined to one control variable in the model. In [2832], dynamical multidrug therapies based on RTIs and PIs are designed.

In this paper, a mathematical model of HIV dynamic is considered that includes the effect of antiretroviral therapy, and an analysis of optimal control is performed regarding appropriate goals.

The paper is organized as follows: in Section 2, the underlying HIV mathematical model is described. Our formulation of the control problem, which attempts to prolong the survival time of patient as long as possible, is described in Section 3. Approximating the obtained optimal control problem by an LP problem is the subject of Section 4. Numerical results obtained from solving the LP problem are presented in Section 5. Finally, Section 6 is assigned to concluding remarks.

2. Presentation of a Working Model

In this paper, the pathological behavior of HIV is considered which is modeled with the simplified version of a system of ordinary differential equations (ODEs) as described in [17]. This model, which is consistent with clinical data, is given as follows:

dP̅(t)dt=IP̅+β(P0P(t))τ̅pP̅(t)c̅Pa(t)C(t)P̅(t),
(1)

dP(t)dt=τ̅PP̅(t)τPP(t)cPa(t)C(t)P(t),
(2)

da(t)dt=a(t)(κθγC(t)),
(3)

dC(t)dt=a(t)(εIC+αC(t))(P(t)P0)υτCC(t).
(4)

Most of the terms in this model have straightforward interpretations. P̅(·) and P(·) denote the amounts of immature CD4+ T-cells and mature ones, respectively. The term a(·) indicates HIV particles, and C(·) designates cytotoxic T-cells specific for HIV (CTLs) as a function of time. Here, IP̅ is the constant rate that P̅ cells are produced, τ̅p is the rate of maturation of P̅ cells into P cells, and τ p is the rate of natural death of P cells. Furthermore, β is the amplifying coefficient of the linear feedback effect of P cells decrease on the influx of P̅ cells at time t. Free virus particles a(t) eliminate P̅(·) cells at a rate proportional to c̅Pa(t)C(t)P̅(t) at time t. Similarly, c P a(t)C(t)P(t) is the rate of elimination of P cells. The term θ characterizes the growth rate of HIV particles, and γ is the rate of inactivation of HIV products mediated by cytotoxic C cells. I C is the influx of C cell precursors, ε is their maturation rate, α is the proliferation rate of C cells under the antigenic stimulation by HIV products, and τ C is their natural death rate. Helper T-cells effect on maturation and proliferation of C cells is expressed by the ratio P(t)/P 0, and ν is introduced to characterize the intensity of this helper effect. Chemotherapeutic agent was simulated by decreasing the value κ, that is, the HIV proliferation rate. Lower value for κ corresponds to higher RTI-drug doses.

3. Optimal Control Formulation

In this section, we formulate an optimal control problem that identifies the inhibition parameter κ in (3), with a function of the control variable. In particular, we will replace the parameter κ with the function 1 − u(t). This choice then identifies the control variable u(t) with the rate of inhibition of virus reproduction, which is modeled as a simple function of drug dosage.

In clinical practice, the following guidelines are used typically.

  1. Antiretroviral therapy is initiated at t 0, the time at which the CD4+ T-cell count falls below 350 cells/μL.
  2. The transition from HIV to AIDS is marked by a CD4+ T-cell count below 200 cells/μL.
  3. A person is said to have full-blown AIDS when his/her CD4+ T-cell count falls below CD4crit +, typically around of 50 cells/μL.

This paper aims to propose a drug regimen that delays the onset of full-blown AIDS and prolongs survival as much as possible, while one is going to minimize the drug costs. This can be modeled as follows.

Assume that the onset of full-blown AIDS occurs after time t f. Hence, we should have

P(t)CD4crit+,t[t0,tf],P(tf)=CD4crit+.
(5)

A problem arising from the use of most chemotherapies is the multiple and sometimes harmful side effects, as well as the ineffectiveness of treatment after a certain time due to the capability of the virus to mutate and become resistant to the treatment. Global effects of these phenomena can be considered by imposing limited treatment interval [22], that is, treatment lasting for a given period from time t 0 to t 0 + η. Therefore, the support of the control function u(·) must be in the treatment interval

suppu[t0,t0+η].
(6)

Here, we follow [8, 22] in assuming that the costs of the treatment is proportional to u 2(t) at time t. Therefore, the overall cost of the treatment is ∫t0 tf u 2(t)dt. So, the following functional should be maximized:

σ(tf,u)=tfλt0tfu2(t)dt.
(7)

Parameter λ is used to set the relative importance between maximizing the survival time t f and minimizing the systemic cost to the body. Setting P̅=x1, P = x 2, a = x 3, and C = x 4, the system of differential equations (1)–(4) can be represented in a generalized form as

x˙(t)=g(t,x(t),u(t))=(IP+β(x20x2)τ̅Px1c̅Px3x4x1τ̅Px1τPx2cPx3x4x2x3((1u)θγx4)(εIC+αx4)x3(x2x20)υτCx4),x(0)=x0.
(8)

Assume that K denotes the set of all measurable control functions u(·)[set membership][0, 1], where u(·) satisfies (6), and the corresponding solution of (8) at final time t f satisfies (5). Therefore, we are seeking for u*(·) [set membership] K such that

σ(tf,u)σ(tf,u),uK.
(9)

Setting f 0(t, x(t), u(t)) = 1 − λu 2(t), then the optimal drug regimen problem, while ignoring t 0, can be represented as:

maxtf,u    Kt0tff0(t,x(t),u(t))dt  
(10)

subject to

x˙=g(t,x(t),u(t)),
(11)

x(t0)=xt0,x2(tf)=CD4crit+,
(12)

x2(t)CD4crit+,t[t0,tf].
(13)

This optimal control problem is referred to as OCP. Some problems may arise in the quest of solving OCP. The set K may be empty. If K is not empty, the functional measuring the performance of the system may not achieve its maximum in the set K. In order to overcome these difficulties, in the next section we transfer the OCP into a modified problem in measure space.

4. Approximation of OCP by Linear Programming Problem

Using measure theory for solving optimal control problems based on the idea of Young [33], which was applied for the first time by Wilson and Rubio [34], has been theoretically established by Rubio in [35]. Then, the method has been extended for approximating the time optimal problems by an LP model [36]. Here, this approach is used.

4.1. Functional Space

We assume that the state variables x(·) and the control input u(·), respectively, get their values in the compact sets A = A 1 × A 2 × A 3 × A 4 [subset or is implied by] R 4 and U [subset or is implied by] R. Set J = [t 0, t f]. Here, we are going to derive weak forms for (11)–(13).

Definition 1 —

A triple p = [t f, x, u] is said to be admissible if the following conditions hold.

  1. The vector function x(·) is absolutely continuous and belongs to A for all t [set membership] J.
  2. The function u(·) takes its values in the set U and is Lebesgue measurable on J.
  3. p satisfies in (11)–(13), on J 0, that is, the interior set of J.

It is assumed that the set of all admissible triples is nonempty and denotes it by W. Let p be an admissible triple, B be an open ball in R 5 containing J × A, and let C′(B) be the space of all real-valued continuous differentiable functions on it. Let [var phi] [set membership] C′(B), and define [var phi] g as follows:

φg(t,x(t),u(t))=φx(t,x(t))·g(t,x(t),u(t))+φt(t,x(t))
(14)

for each [t, x(t), u(t)] [set membership] Ω, where Ω = J × A × U. The function [var phi] g is in the space C(Ω), the set of all continuous functions on the compact set Ω. Since p = [t f, x, u] is an admissible triple, we have

t0tfφg(t,ξ(t),u(t))dt=t0tfφx(t,x(t))·x˙(t)+φt(t,x(t))dt=φ(tf,x(tf))φ(t0,x(t0))=Δφ,
(15)

for all [var phi] [set membership] C′(B). Let D(J 0) be the space of all infinitely differentiable real-valued functions with compact support in J 0. Define

ψ  n(t,x(t),u(t))=xn(t)ψ(t)+gn(t,x(t),u(t))ψ(t),n=1,2,3,4,ψD(J0).
(16)

Assume p = [t f, x, u] be an admissible triple. Since the function ψ(·) has compact support in J 0, ψ(t 0) = ψ(t f) = 0. Thus, for n = 1,2, 3,4, and for all ψ [set membership] D(J 0), from (16) and using integration by parts, we have

t0tfψn(t,x(t),u(t))dt=  t0tfxn(t)ψ(t)dt+t0tfgn(t,x(t),u(t))ψ(t)dt=0.
(17)

Also, by choosing the functions which are dependent only on time, we have

t0tfϑ(t,x(t),u(t))dt=aϑ,ϑC1(Ω),
(18)

where C 1(Ω) is the space of all functions in C(Ω) that depend only on time and a [theta] is the integral of [theta](·) on J.

Equations (15), (17), and (18) are the weak forms of (11)–(13). Note that the constraints (12) are considered on the right-hand side of (15) by choosing suitable functions [var phi] [set membership] C′(B) which are monomials of x 2. Furthermore, the constraint (13) is considered, by choosing an appropriate set A. Now, we consider the following positive linear functional on C(Ω):

Γp:FJF(t,x(t),u(t))dt,FC(Ω).
(19)

Proposition 1 —

Transformation p → Γp of admissible triples in W into the linear mappings Γp defined in (19) is an injection.

Proof —

We must show that if p 1p 2, then Γp1 ≠ Γp2. Let p j = [t fj, x j, u j], j = 1, 2 be different admissible triples. If t f1 = t f2, then there is a subinterval of [t 0, t f1], say J 1, where x 1(t) ≠ x 2(t) for each t [set membership] J 1. A continuous function F can be constructed on Ω so that the right-hand sides of (19) corresponding to p 1 and p 1 are not equal. For instance, one can make F independent of u, equal zero for all t outside J 1, and such that it is positive on the appropriate portion of x 1(·), and zero on the x 2(·), then the linear functionals are not equal. In other words, if t f1t f2, then Γp1 and Γp2 have different domains and are not equal.

Thus, from (15), (17), and (18), one can conclude that maximizing the functional (10) over admissible space W, changes to the following optimization problem in functional space:

  maxpWΓp(f0)    
(20)

subject to

Γp(φg)=Δφ,φC(B),
(21)

Γp(ψn)=0,n=1,2,3,4,ψD(J0),
(22)

Γp(ϑ)=aϑ,ϑC1(Ω).
(23)

4.2. Measure Space

Let M +(Ω) denote the space of all positive Radon measures on Ω. By the Riesz representation theorem [35], there exists a unique positive Radon measure μ on Ω such that

Γp(F)=JF(t,x(t),u(t))dt=ΩF(t,x,u)dμμ(F),FC(Ω).
(24)

So, we may change the functional space of the optimization problem to measure space. In other words, the optimization problem (20)–(23) can be converted to the following optimization problem in measure space:

MaximizeμM+(Ω)μ(f0)
(25)

subject to

μ(φg)=Δφ,φC(B),
(26)

μ(ψn)=0,n=1,2,3,4,ψD(J0),
(27)

μ(ϑ)=aϑ,ϑC1(Ω).
(28)

We will consider maximization of (25) over the set Q of all positive Radon measures on Ω, satisfying (26)–(28). The main advantages of considering this measure theoretic form of the problem is the existence of optimal measure in the set Q where this point can be studied in a straightforward manner without having to impose conditions such as convexity which may be artificial.

Define function I : QR as I(μ) = μ(f 0). The following theorem guarantees the existence of an optimal solution.

Theorem 1 —

The measure theoretical problem of maximizing (25) with constraints (26)–(28) has an optimal solution, say μ*, where μ* [set membership] Q.

Proof —

The so-called constraints (27) and (28) are special cases of (26) [35]. So, the set Q can be written as

Q=φC(B){μM+(Ω):  μ(φg)=Δφ}.
(29)

Assume that p = [t f, x, u] is an admissible triple. It is well known that the set {μ [set membership] M +(Ω) : μ(1) = t ft 0} is compact in the weak* topology. Furthermore, the set Q as intersection of inverse image of closed singleton sets {Δ[var phi]} under the continuous functions μμ([var phi] g) is also closed. Thus, Q is a closed subset of a compact set. This proves the compactness of the set Q. Since the functional I, mapping the compact set Q on the real line, is continuous and thus takes its maximum on the compact set Q.

Next, based on analysis in [35], the problem (25)–(28) is approximated by an LP problem, and a triple p* which approximates the action of μ* [set membership] Q is achieved.

4.3. Approximation

The problem (25)–(28) is an infinite-dimensional linear programming problem, and we are mainly interested in approximating it. First, the maximization of I is considered not over the set Q, but over a subset of it denoted by requiring that only a finite number of constraints (26)–(28) be satisfied. Let {[var phi] i : i = 1,2,…}, {ψ j : j = 1, 2,…}, and {[theta] s : s = 1,2,…} be the sets of total functions, respectively, in C′(B), D(J 0), and C 1(Ω). The first approximation is completed by choosing finite number of functions [var phi] is, ψ js, and [theta] ss. Now we have the following propositions.

Proposition 2 —

Consider the linear program problem consisting of maximizing the function I over the set Q M of measures in M +(Ω) satisfying:

μ(φig)=Δφi,i=1,,M.
(30)

Then, J M [equivalent] max QM I tends to J = max Q I as M.

Proof —

We have Q 1[superset, dbl equals]Q 2[superset, dbl equals](...)[superset, dbl equals]Q M[superset, dbl equals](...)[superset, dbl equals]Q and hence, J 1J 2(...)J M(...)J. The sequence {J j}j=1 is nonincreasing and bounded, so, it converges to a number ζ such that ζJ. We show that ζ = J. Set R [equivalent] [intersection operator]M=1 Q M. Then, R[superset, dbl equals]Q and ζ [equivalent] maxR I. It is sufficient to show R[subset, dbl equals]Q. Assume μ [set membership] R and [var phi] [set membership] C′(B). Since the linear combinations of the functions {[var phi] j, j = 1,2,…} are uniformly dense in C′(B), there is a sequence {φ˜k}span{φj,j=1,2,}, such that φ˜k tends to [var phi] uniformly as k. Hence, S 1, S 2, and S 3 tend to zero as k where S1=sup|φx-φ˜kx|, S2=sup|φt-φ˜kt|, and S3=sup|φ-φ˜k|. Since μ [set membership] R and the functional fμ(f) is linear, μ(φ˜kg)=Δφ˜k and

|μ(φg)Δφ|=|μ(φg)Δφμ(φ˜kg)+Δφ˜k|=|Ω{[φx(t,x)φ˜kx(t,x)]g(t,x,u)+[φt(t,x)φ˜kt(t,x)]}dμ(ΔφΔφ˜k)|S1Ω|g(t,x,u)|dμ+S2Ωdμ+2S3.
(31)

The right-hand side of the above inequality tends to zero as k, and the left-hand side is independent of k; therefore μ([var phi] g) = Δ[var phi]. Thus, R[subset, dbl equals]Q and ζJ, which implies ζ = J.

Proposition 3 —

The measure μ* in the set Q M at which the functional I attains its maximum has the form

μ=j=1Mαjδ(zj),
(32)

where α j* ≥ 0, z j* [set membership] Ω, and δ(z) is unitary atomic measure with the support being the singleton set {z j*}, characterized by δ(z)(F) = F(z), z [set membership] Ω.

Proof —

See [35].

Therefore, our attention is restricted to finding a measure in the form of (32), which maximizes the functional I and satisfies in M number of the constraints (26)–(28). Thus, by choosing the functions [var phi] i, i = 1,2,…, M 1, ψ k, k = 1,…, M 2, and [theta] s, s = 1,…, S, the infinite dimensional problem (25)–(28) is approximated by the following finite dimensional nonlinear programming (NLP) problem:

Maximizeαj0,zjΩj=1Mαjf0(zj)
(33)

subject to

j=1Mαjφig(zj)=Δφi,i=1,,M1,
(34)

j=1Mαjψk  n(zj)=0,k=1,,M2,n=1,2,3,4,
(35)

j=1Mαjϑs(zj)=aϑs,s=1,,S,
(36)

where M = M 1 + 4M 2 + S. Clearly, (33)–(36) is an NLP problem with 2 M unknowns: α j and z j, j = 1,…, M. One is interested in LP problem. The following proposition enables us to approximate the NLP problem (33)–(36) by a finite dimensional LP problem.

Proposition 4 —

Let Ω N = {y 1, y 2,…, y N} be a countable dense subset of Ω. Given ε > 0, a measure v [set membership] M +(Ω) can be found such that:

|v(f0)μ(f0)|ε,|v(φig)μ(φig)|ε,i=1,,M1,|v(ψkn)μ(ψkn)|ε,k=1,,M2,n=1,2,3,4,|v(ϑs)μ(ϑs)|ε,s=1,,S,
(37)

where the measure v has the form

v=j=1Mαjδ(yj),
(38)

and the coefficients α j*, j = 1,…, M, are the same as optimal measure (32), and y j [set membership] Ω   N, j = 1,…, M.

Proof —

We rename the functions f 0, [var phi]   i   g's, ψ k n's, and [theta] s's sequentially as h j, j = 1,2,…, M + 1. Then, for j = 1,…, M + 1,

|(μv  )hj|=|i=1Mαi[hj(zi)hj(yi)]|(i=1Mαi)maxi,j|hj(zi)  hj(yi)|.
(39)

h js are continuous. Therefore, max i,j can be made less than ε/∑j=1 M α j* by choosing y i, i = 1,2,…, M, sufficiently near z i*.

For constructing a suitable set Ω N, which preserves the relation (6), J is divided to S subintervals as follows:

Js=[t0+(s1)ΔTS1,t0+sΔTS1),s=1,2,,S1,JS=[tl,tf),
(40)

where t l is a lower bound for optimal time t f, which can be obtained by using a search algorithm based on golden section [36] or Fibonnaci search method [37]. Let S̅ be the largest number such that JS̅[t0,t0+η]. Set J1=s=1S̅Js, J2=s=S̅+1SJs, Ω 1 = J 1 × A × U, and Ω 2 = J 2 × A × {0}. Moreover, the intervals A i (i = 1,2, 3,4) and U are divided, respectively, into n i and m subintervals. So, the sets Ω i, i = 1,2, are partitioned into N1=S̅n1n2n3n4m   and N2=(S-S̅)n1n2n3n4 cells, respectively. One point is chosen from each cell. In this way, we will have a grid of points, which are numbered sequentially as y j = (t j, x 1j,…, x 4j, u j), j = 1,…, N, where N = N 1 + N 2.

Therefore, according to (38), the NLP problem (33)–(36) is converted to the following LP problem:

Maximizeαj0j=1Mαjf0(yj)
(41)

subject to

j=1Nαjφig(yj)=Δφi,i=1,,M1,
(42)

j=1Nαjψk  n(yj)=0,k=1,,M2,n=1,  2,  3  ,4,
(43)

j=1Nαjϑs(yj)=aϑs,s=1,,S.
(44)

Here, we discuss suitable total functions [var phi] is, ψ ks, and [theta] ss. The functions [var phi] is can be taken to be monomials of t and the components of the vector x as follows:

tix2j,  x2jxhi,i{0,1},j{1,2,  },h{1,3,4}.
(45)

In addition, we choose some functions with compact support in the following form [36, 37]:

ψ2r1(t)={sin(2πr(tt0)ΔT)ttl0otherwise,ψ2r(t)={1cos(2πr(tt0)ΔT)ttl0otherwise,
(46)

where r = 1, 2,… and ΔT = t lt 0. Finally, the following functions are considered that are dependent on t only:

ϑs(t)={1tJs0otherwise,
(47)

where J s, s = 1,…, S, are given by (40). These functions are used to construct the approximate piecewise constant control [3537]. By the above definition of [theta] s, we consider t f as an unknown variable in the constraints (44) which can be written as

  j=1αj=ΔTS1j=(S2)+1(S1)αj=ΔTS1j=(S1)+1Sαj=tftl,
(48)

where [ell] = N/S. Of course, we need only to construct the control function u(·), since x(·) can be obtained by solving the ODEs (8). By using simplex method, a nonzero optimal solution α i1*, α i2*,…, α ik*, i 1 < i 2 < (...)<i k of the LP problem (41)–(44) can be found where k cannot exceed the number of constraints, that is, kM 1 + M 2 + S. Setting α i0* = t 0, a piecewise control function u(·) approximating the optimal control is constructed based on these nonzero coefficients as follows [35, 36]:

u(t)={uijt[h=0j1αih,h=0jαih)0otherwise,j=1,2,,k,
(49)

where u ijis the 6th component of y ij.

To start the proposed method, one needs to have t l. Here, a bisection method is proposed to find the desired lower bound t l for optimal time t f*. This algorithm has a simple structure and is started with a given upper bound t u, where it is assumed that the lower bound starts with t l = 0. Assuming that t f*(t l) denotes the solution of LP problem (41)–(44) corresponding to the given lower bound t l, the bisection method is outlined as follows.

Algorithm 1 (estimation of the lower bound t l) —

First, let τ = [t l, t u], where t l = 0 and t u is an upper bound for t f*.

Step 1 —

Let a = (t l + t u)/2 and solve the corresponding LP problem to find t f*(a). If no feasible solution is found for the corresponding LP problem or t f*(a) = a, set t u = a; else set t l = a.

Step 2 —

If the length of the interval τ = [t l, t u] is small enough, then choose t l as a good estimation for lower bound t f* else, go to Step 1.

5. Numerical Results

In this implementation, we set M 1 = 10 and choose functions [var phi] i, i = 1,2,…, M 1, from C′(B) as follows:

x1,x2,x3,x4,x22,x23,x1x2,x3x2,x4x2,tx2.
(50)

Furthermore, we set S = 13 and M 2 = 6. Setting u = 0 in (8), we find that at t 0 = 1642, x(t 0) = (8.19,35,0.05,0.04). Model parameters are chosen as follows [17]:

IP̅=1.0,β=0.01,τ̅p=0.2,c̅p=0,τp=0.001,cp=20,θ=0.02,γ=0.8,ε=0.154,IC=0.2,α=0.3,v=3,
(51)

and the following initial condition is used:

x(0)=(5,100,0.0005,0).
(52)

Besides, λ is set to λ = 10, and the length of treatment is set to η = 500 (days). By using controllability on the dynamical control system, one can assume A 1 = [7, 10], A 2 = [5, 85], A 3 = [0, 5], A 4 = [0, 0.1], and U = [0,1]. Furthermore, the number of partitions in the construction of the set Ω N are n 1 = 4, n 2 = 10, n 3 = 4, n 4 = 4, and m 1 = 4. Initially, an upper bound for optimal time t f* is set to t u = 5297.45. The results of implementing Algorithm 1 are summarized in Table 1. Setting t l = 3642, we have an LP problem with 16000 unknowns and 47 constraints which is solved by the linprog code of the optimization toolbox in MATLAB. The total CPU time required on a laptop with CPU 2.20 GHz and 0.99 GB of RAM was 17.23 minutes. The suboptimal time has been found t f* = 3943.2. The resulting suboptimal control and the response of the system to the obtained control function are depicted in Figures Figures11 and and2,2, respectively. Moreover, we found P(t f*) = 4.9360, which is close to the exact value, that is, 5 (CD4crit +%). Note that the normal level of mature CD4+ T-cells is about 1000 cells/μL. The relationships between the CD4+ T-cells, CTLs, and virus during the different stages of the disease are shown in Figure 3 as a phase space diagram.

Figure 1
The approximate suboptimal piecewise constant control u.
Figure 2
Dynamic behavior of the state variables P̅, P, a and C versus time in the case of untreated (dashed line) and treated infected patients (solid line).
Figure 3
Phase space diagram for CD4+ T-cells (P), and CTLs (C).
Table 1
Results of implementing Algorithm 1.

6. Conclusion

In this paper, we considered a dynamical system which describes the various aspects of the interaction of HIV with the immune system, to construct an optimal control problem which maximizes survival time of patients. A measure theoretical method is used to solve such kind of problems. The method is not iterative, and it does not need any initial guess of the solution, and numerical results confirmed the effectiveness of this approach.

Numerical results show that in presence of treatment, the survival time of patients can be considerably prolonged. From Figures 2(b) and 2(c), it is concluded that in presence of treatment (solid lines), the virus is controlled to very low levels and CD4+ T-cells are maintained at high levels for relatively long time. From Figure 2(d), an increase in CTL's occurs in response to therapy.

Figure 3(a) shows an inverse correlation between CD4+ T-cells and virus particles. Furthermore, Figure 3(b) shows a clear correlation between the level of CTLs in the blood and HIV progression. As the virus increases upon initial infection, CTLs increase in order to decrease the virus. But this situation changes after about 1000th day due to destruction of CD4+ T-cells. Because these cells play an essential role in stimulation of immune response and signal other immune cells to eliminate infection by killing infected cells. After the 1642nd day, an increase in immune response can be observed which is due to recovery of CD4+ T-cells in response to treatment. Immune response increases for a while after discontinuation of therapy but ultimately becomes extinct.

References

1. Chun TW, Stuyver L, Mizell SB, et al. Presence of an inducible HIV-1 latent reservoir during highly active antiretroviral therapy. Proceedings of the National Academy of Sciences of the United States of America. 1997;94(24):13193–13197. [PubMed]
2. Finzi D, Hermankova M, Pierson T, et al. Identification of a reservoir for HIV-1 in patients on highly active antiretroviral therapy. Science. 1997;278(5341):1295–1300. [PubMed]
3. Wong JK, Hezareh M, Günthard HF, et al. Recovery of replication-competent HIV despite prolonged suppression of plasma viremia. Science. 1997;278(5341):1291–1295. [PubMed]
4. Hadjiandreou M, Conejeros R, Vassiliadis VS. Towards a long-term model construction for the dynamic simulation of HIV infection. Mathematical Biosciences and Engineering. 2007;4(3):489–504. [PubMed]
5. Wodarz D, Nowak MA. Specific therapy regimes could lead to long-term immunological control of HIV. Proceedings of the National Academy of Sciences of the United States of America. 1999;96(25):14464–14469. [PubMed]
6. Wodarz D, Nowak MA. Mathematical models of HIV pathogenesis and treatment. BioEssays. 2002;24(12):1178–1187. [PubMed]
7. Landi A, Mazzoldi A, Andreoni C, et al. Modelling and control of HIV dynamics. Computer Methods and Programs in Biomedicine. 2008;89(2):162–168. [PubMed]
8. Fister KR, Lenhart S, McNally JS. Optimizing chemotherapy in an HIV model. Electronic Journal of Differential Equations. 1998;32:1–12.
9. Hadjiandreou MM, Conejeros R, Wilson DI. Long-term HIV dynamics subject to continuous therapy and structured treatment interruptions. Chemical Engineering Science. 2009;64(7):1600–1617.
10. Garira W, Musekwa SD, Shiri T. Optimal control of combined therapy in a single strain HIV-1 model. Electronic Journal of Differential Equations. 2005;52:1–22.
11. Karrakchou J, Rachik M, Gourari S. Optimal control and infectiology: application to an HIV/AIDS model. Applied Mathematics and Computation. 2006;177(2):807–818.
12. Zarei H, Kamyad AV, Effati S. Multiobjective optimal control of HIV dynamics. Mathematical Problems in Engineering. 2010;2010:29 pages. Article ID 568315.
13. Adams BM, Banks HT, Kwon HD, Tran HT. Dynamic multidrug therapies for HIV: optimal and STI control approaches. Mathematical Biosciences and Engineering. 2004;1:223–241. [PubMed]
14. Neri F, Toivanen J, Mäkinen RAE. An adaptive evolutionary algorithm with intelligent mutation local searchers for designing multidrug therapies for HIV. Applied Intelligence. 2007;27(3):219–235.
15. Culshaw RV, Ruan S, Spiteri RJ. Optimal HIV treatment by maximising immune response. Journal of Mathematical Biology. 2004;48(5):545–562. [PubMed]
16. Krakovska O, Wahl LM. Costs versus benefits: best possible and best practical treatment regimens for HIV. Journal of Mathematical Biology. 2007;54(3):385–406. [PubMed]
17. Hraba T, Dolezal J. Communication mathematical modelling of HIV infection therapy. International Journal of Immunopharmacology. 1995;17(6):523–526. [PubMed]
18. Adams BM, Banks HT, Davidian M, et al. HIV dynamics: modeling, data analysis, and optimal treatment protocols. Journal of Computational and Applied Mathematics. 2005;184(1):10–49.
19. Alvarez-Ramirez J, Meraz M, Velasco-Hernandez JX. Feedback control of the chemotherapy of HIV. International Journal of Bifurcation and Chaos in Applied Sciences and Engineering. 2000;10(9):2207–2219.
20. Butler S, Kirschner D, Lenhart S. Optimal control of chemotherapy affecting the infectivity of HIV. In: Arino O, Axelrod D, Kimmel M, Langlais M, editors. Advances in Mathematical Population Dynamics: Molecules, Cells, Man. Singapore: World Scientific; 1997. pp. 104–120.
21. Shim H, Han SJ, Chung CC, Nam SW, Seo JH. Optimal scheduling of drug treatment for HIV infection: continuous dose control and receding horizon control. International Journal of Control, Automation and Systems. 2003;1(3):401–407.
22. Kirschner D, Lenhart S, Serbin S. Optimal control of the chemotherapy of HIV infection: scheduling amounts and initiation of treatment. Journal of Mathematical Biology. 1997;35:775–792. [PubMed]
23. Ledzewicz U, Schättler H. On optimal controls for a general mathematical model for chemotherapy of HIV. In: Proceedings of the American Control Conference, vol. 5; May 2002; pp. 3454–3459.
24. Zurakowski R, Messina MJ, Tuna SE, Teel AR. HIV treatment scheduling via robust nonlinear model predictive control. In: Proceedings of the 5th Asian Control Conference; July 2004; pp. 48–53.
25. Zurakowski R, Teel AR. Enhancing immune response to HIV infection using MPC-based treatment scheduling. In: Proceedings of the American Control Conference, vol. 2; June 2003; pp. 1182–1187.
26. Zurakowski R, Teel AR, Wodarz D. Utilizing alternate target cells in treating HIV infection through scheduled treatment interruptions. In: Proceedings of the American Control Conference, vol. 1; July 2004; pp. 946–951.
27. Zurakowski R, Teel AR. A model predictive control based scheduling method for HIV therapy. Journal of Theoretical Biology. 2006;238(2):368–382. [PubMed]
28. Banks HT, Kwon HD, Toivanen JA, Tran HT. A state-dependent Riccati equation-based estimator approach for HIV feedback control. Optimal Control Applications and Methods. 2006;27(2):93–121.
29. Caetano MAL, Yoneyama T. Short and long period optimization of drug doses in the treatment of AIDS. Anais da Academia Brasileira de Ciencias. 2002;74(3):379–392. [PubMed]
30. Jeffrey AM, Xia X, Craig IK. When to initiate HIV therapy: a control theoretic approach. IEEE Transactions on Biomedical Engineering. 2003;50(11):1213–1220. [PubMed]
31. Kutch JJ, Gurfil P. Optimal control of HIV infection with a continuously-mutating viral population. In: Proceedings of the American Control Conference, vol. 5; May 2002; pp. 4033–4038.
32. Wein LM, Zenios SA, Nowak MA. Dynamic multidrug therapies for HIV: a control theoretic approach. Journal of Theoretical Biology. 1997;185(1):15–29. [PubMed]
33. Young C. Calculus of Variations and Optimal Control Theory. Philadelphia, Pa, USA: Sunders; 1969.
34. Wilson DA, Rubio JE. Existence of optimal controls for the diffusion equation. Journal of Optimization Theory and Applications. 1977;22(1):91–101.
35. Rubio JE. Control and Optimization: The Linear Treatment of Non-Linear Problems. Manchester, UK: Manchester University Press; 1986.
36. Mehne HH, Farahi MH, Kamyad AV. MILP modelling for the time optimal control problem in the case of multiple targets. Optimal Control Applications and Methods. 2006;27(2):77–91.
37. Gachpazan M, Borzabadi AH, Kamyad AV. A measure-theoretical approach for solving discrete optimal control problems. Applied Mathematics and Computation. 2006;173(2):736–752.

Articles from Computational and Mathematical Methods in Medicine are provided here courtesy of Hindawi