• No results found

Maximum principle for a stochastic delayed system involving terminal state constraints

N/A
N/A
Protected

Academic year: 2020

Share "Maximum principle for a stochastic delayed system involving terminal state constraints"

Copied!
16
0
0

Loading.... (view fulltext now)

Full text

(1)

R E S E A R C H

Open Access

Maximum principle for a stochastic

delayed system involving terminal state

constraints

Jiaqiang Wen

1

and Yufeng Shi

1,2*

*Correspondence: [email protected] 1Institute for Financial Studies and School of Mathematics, Shandong University, Jinan, 250100, China 2School of Statistics, Shandong University of Finance and Economics, Jinan, 250014, China

Abstract

We investigate a stochastic optimal control problem where the controlled system is depicted as a stochastic differential delayed equation; however, at the terminal time, the state is constrained in a convex set. We firstly introduce an equivalent backward delayed system depicted as a time-delayed backward stochastic differential equation. Then a stochastic maximum principle is obtained by virtue of Ekeland’s variational principle. Finally, applications to a state constrained stochastic delayed

linear-quadratic control model and a production-consumption choice problem are studied to illustrate the main obtained result.

MSC: 93E20; 60H10

Keywords: stochastic differential delayed equation; state constraints; maximum principle

1 Introduction

In , the nonlinear backward stochastic differential equation (BSDE in short) was in-troduced by Pardoux and Peng []. Until now, it has had applications in many fields, such as partial differential equation (see []), stochastic control (see [, ]) and mathematical finance (see []). Meanwhile, BSDE itself has been developed to many different branches, such as BSDE with jumps (see [–]), mean-field BSDE (see []), time-delayed BSDE (see [–]), anticipated BSDEs (see [, ]) and so on. A lot of works have been done for the control problem of such BSDEs. However, fewer works have been done on the control problems of stochastic delayed systems.

For a stochastic delayed system, Chen and Wu [] obtained a stochastic maximum prin-ciple by virtue of a duality between stochastic differential delayed equations (SDDEs in short) and anticipated BSDEs. Øksendal, Sulem and Zhang [] studied the optimal con-trol problems for SDDEs with jumps. Yu [] obtained a maximum principle for SDDEs with random coefficients. A maximum principle of optimal control of SDDEs on infinite horizon was proved in Agram, Haadem and Øksendal []. Some other recent develop-ments on stochastic delayed system can be found in Huang, Li and Shi [], Meng and Shen [], etc.

To the authors’ knowledge, there has been no result concerning the control problem of a stochastic delayed system with state constraints until now. However, the state

(2)

straints of stochastic delayed systems indeed exist in reality. In this paper, the stochastic control problem of a forward delayed system with terminal state constraint is studied. The controlled system is depicted as the following SDDE:

⎧ ⎪ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎪ ⎩

dX(t) =b(t,X(t),X(tδ),u(t))dt+σ(t,X(t),X(tδ),u(t))dW(t), ≤tT;

X(t) =η(t), –δt≤,

(.)

whereX(T)∈K, a.s.,K∈Rnis a convex set. However, there are two (main) difficulties in this study. The first one is that the control system (.) is a delayed system, as stated in [], which is more complex than the classical case. Another difficulty is the terminal state constraint, which is a sample-wise constraint. As interpreted in Ji and Zhou [], the stochastic control involving sample-wise state constraints cannot be resolved by the classical theory.

Some recent developed results on state constraints (see [, –]) as well as the du-ality relation between time-advanced stochastic differential equations (SDEs, for short) and time-delayed BSDEs (see []) may help us to overcome the above mentioned dif-ficulties. Firstly, an equivalent backward formulation of stochastic delayed system (.) is introduced, where X(T) is judged as a control variable. Meanwhile, the state con-straint turns out to be a control concon-straint. However, such a treatment brings us both the advantage and the disadvantage. The advantage is that, in the classical control the-ory, to manage control constraint is easier than to manage state constraint. The dis-advantage is that the initial condition (X() =η()) now turns into an additional con-straint. To deal with the additional initial constraint, Ekeland’s variational principle is used.

Note that the equivalent backward delayed system is described by a time-delayed BSDE, so the adjoint equation of the time-delayed BSDE via duality relation is an anticipated SDE. Therefore, both the delayed system and the anticipated system are needed in our study. As a routine, the variational procedure is made firstly. Then, by virtue of Ekeland’s variational principle, the variational inequality is got. At last, the necessary condition is derived by applying the duality relationship between the backward delayed controlled system and the anticipated forward adjoint system. There is a good thing that the theory of BSDE and our assumption allow us to make the inverse transformation, so that the optimal control process can be solved by the obtained optimal terminal control. To make our conclusions be directly perceived, we also study two applications. One of them is the stochastic delayed linear quadratic (LQ in short) control model. Moreover, a production and consumption choice optimization problem (see []) is also adapted to our case.

(3)

2 Preliminaries

Denote by (,F,F,P) a probability space such thatFincludes allP-null elements ofF

and assume the filtrationF={Ft,t≥}is generated by ad-dimensional standard Brown-ian motionW={W(t),t≥}. LetT> . Andδ>  is a given finite time delay. We denote the following notations:

L(Ft;Rn) ={ξ:→Rn|ξisFt-measurable,E|ξ|<∞};

LF(,T;Rn) ={ψ:×[,T]→Rn|ψ(·)isF-measurable process,ET|ψ(t)|dt<

∞}.

Similarly, we can defineL

F(,T;Rn×d),LF(–δ,T;Rn) andLF(,T+δ;Rn).

Now we recall some useful results for the study of the following sections. Consider the following SDDE:

⎧ ⎨ ⎩

dX(t) =b(t,X(t),X(tδ))dt+σ(t,X(t),X(tδ))dW(t), ≤tT;

X(t) =η(t), –δt≤,

(.)

where ηis a given continuous function, which represents the initial path ofX, andb: [,T]×Rn×RnRnandσ: [,T]×Rn×RnRn×dare given measurable functions satisfying the following:

(H.) There exists a constantD> such that for allt∈[,T],x,x,y,y∈Rn,

b(t,x,y) –bt,x,y +σ(t,x,y) –σt,x,y

Dxx+yy ;

sup

≤tT

b(t, , )+σ(t, , ) < +∞.

Then, from Theorem . in [], under (H.), SDDE (.) has the unique adapted solu-tionX(·)∈L

F(–δ,T;Rn).

For the time-delayed BSDE, we need the following assumption.

(H.) Assume thatf :×[,T]×Rn×Rn×Rn×dRnis F-adapted and for every y,,y,∈Rn,z,z∈Rn×d,

f(t,y,,z) –ft,y,,z

Cyy+

+zz ,

whereC> is a constant. Moreover,ET|f(t, , , )|dt< +.

The following is the well-posedness of time-delayed BSDE.

Proposition . SupposeξL(FT;Rn)andϕ(·)is a given continuous function.Then, under(H.),for sufficiently smallδ> ,the following time-delayed BSDE

⎧ ⎨ ⎩

dY(t) =f(t,Y(t),Y(tδ),Z(t))dtZ(t)dW(t), ≤tT;

(4)

has the unique adapted solution(Y(·),Z(·))∈L

F(–δ,T;RnLF(,T;Rn×d),and it satisfies the following estimate:

E

sup

≤tT

Y(t)

+

T

Z(t)

dt

CE

|ξ|+

T

f(t, , , )

dt

,

with C> .Furthermore,if(Y(·),Z(·))is the solution to(.)withξ replaced byξ,then

E

sup

≤tT

Y(t) –Y(t)+ 

T

Z(t) –Z(t)dt

CEξξ.

As we stated in the part of Introduction, the anticipated SDE is necessary in our study. The following is the condition for anticipated SDE.

(H.) Suppose for eacht∈[,T],r∈[t,T+δ],b:×Rn×L(F

r;Rn)→L(Ft;Rn), σ:×Rn×L(F

r;Rn)→L(Ft;Rn×d)with

b(t,x,ςt) –bt,x,ςt +σ(t,x,ςt) –σt,x,ςt

Cxx+EFtςtςt ,

for everyt∈[,T],x,x∈Rn,ς(·),ς(·)L

F(t,T+δ;Rn),r∈[t,T+δ]withC> . Moreover,suptT(|b(t, , )|+|σ(t, , )|) < +∞.

Proposition . Suppose x∈Rnandλ(·)∈LF(T,T+δ;Rn)is a givenF-adapted process.

Assume(H.)holds.Then,ifδis sufficiently small,the anticipated SDE

⎧ ⎨ ⎩

dX(t) =b(t,X(t),X(t+δ))dt+σ(t,X(t),X(t+δ))dW(t), ≤tT; X() =x, X(t) =λ(t), T<tT+δ,

(.)

has the unique adapted solution X(·)∈L

F(,T+δ;Rn).

The above results can be found in Delong and Imkeller [] and Chen and Huang []. The following is the famous Ekeland’s variational principle.

Proposition . Suppose(U,d(·,·))is a complete metric space with a function F(·) :U→ R is proper lower semi-continuous. Then, for every vU and >  such that F(v)≤ infuUF(u) +,there is uU so that

(i) F(v)≤F(v), (ii) d(v,v)≤,

(iii) F(u) +√d(u,v)≥F(v),∀uU.

3 Main result

(5)

3.1 Problem formulation

Let

Uad≡

u(·)|u(·)∈LF,T;Rn×d

be the set of admissible controls. For every givenu(·), for the control system, we consider the past-dependent stateX(·) depicted as

⎧ ⎪ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎪ ⎩

dX(t) =b(t,X(t),X(tδ),u(t))dt+σ(t,X(t),X(tδ),u(t))dW(t), ≤tT;

X(t) =η(t), –δt≤,

(.)

where η is a given continuous function, b: [,T]×Rn×Rn×Rn×d Rn and σ : [,T]×Rn×Rn×Rn×dRn×dare given measurable functions. Define the cost function as follows:

Ju(·) =E

T

lt,X(t),u(t) dt+φX(T) ,

wherel: [,T]×Rn×Rn×dRnandφ:RnRnare given measurable functions. We give the following assumptions:

(H.) The functionsb,σ,l,φare all continuously differentiable in the arguments(x,x,u), and their derivatives are all bounded.

(H.) Denote byC( +|x|+|u|)andC( +|x|)the bounds of derivatives oflin its argu-ments(x,u)andφin its argumentx, respectively.

Therefore, for every givenu(·)∈Uad, under assumptions (H.) and (H.), Eq. (.)

ad-mits the unique adapted solutionX(·)∈LF(–δ,T;Rn).

Denote byK∈Rna given nonempty convex subset. The goal of our control problem is to solve

Problem A:

⎧ ⎨ ⎩

MinimizeJ(u(·))

subject tou(·)∈Uad; X(T)∈K.

3.2 Time-delayed backward formulation

We now show an equivalent backward system of Problem A. In order to do this, one ad-ditional assumption is needed:

(H.) There existsα> , and for eacht∈[,T],x,x∈Rnandu

,u∈Rn×d, σt,x,x,u –σ

t,x,x,u ≥α|u–u|.

Note that (H.) and (H.) imply, for every (t,x,x)∈[,T]×Rn×Rn, that the following function

(6)

is a bijection onRn×d. Hence, by lettingqσ(t,x,x,u), we obtain that there is the inverse σ–satisfyingu=σ–(t,x,x,q). Then we can rewrite (.) as

⎧ ⎨ ⎩

dX(t) =f(t,X(t),X(tδ),q(t))dtq(t)dW(t), ≤tT;

X(t) =η(t), –δt≤,

wheref(t,x,x,q) = –b(t,x,x,σ–(t,x,x,q)).

Note thatuσ(t,x,x,u) is a bijection, henceq(·) could be regarded as the control, which is the crucial observation that encourages this method for working out Problem A. Furthermore, by virtue of the theory of BSDE, choosing the terminal stateX(T) is equal to choosingq(·). Therefore we innovate the following ‘controlled’ system, which essentially is a time-delayed BSDE:

⎧ ⎨ ⎩

dX(t) =f(t,X(t),X(tδ),q(t))dtq(t)dW(t), ≤tT;

X(T) =ξ, X(t) =η(t), –δt< , (.)

where nowξbecomes the ‘control’ and belongs to the following set:

U=ξ|E|ξ|<∞,ξK, a.s..

Moreover, here the equivalent cost function is

J(ξ) :=E

T

lt,X(t),q(t) dt+φ(ξ)

,

withl(t,x,q) =l(t,x,σ–(t,x,x,q)).

Hence, the original Problem A is equivalent to the following Problem B:

Problem B:

⎧ ⎨ ⎩

MinimizeJ(ξ)

subject toξU; () =a, (.)

where () =a(we denotea=η() in the following for simplicity) is the solution to Eq. (.) at the initial time  underξ.

In control theory, it is well known that to solve the control constraint is easer than to solve the state constraint. From now on, since Problem A is equivalent to Problem B, we concentrate on dealing with Problem B. The benefit is that by virtue ofξbecoming a con-trol variable now, a concon-trol constraint in Problem B replaces the state constraint in Prob-lem A.

(7)

3.3 Variational equation

In the following subsections, we denote the following notations for simplicity:

f(t) =ft,X(t),X(tδ),q(t) , (t) =ft,(t),(tδ),(t) ,

f∗(t) =ft,X∗(t),X∗(tδ),q∗(t) , ∗(t) =

t,X∗(t),X∗(tδ),q∗(t) ,

where denotes the partial derivative of f at ϕwith ϕ=x,,q, respectively. InU, for ξ,ξ∈U, define a metric by

,ξ :=–ξ

 .

Apparently, (U,d(·,·)) becomes a complete metric space. Supposeξ∗is optimal and, as-sociated withξ∗, the pair (X∗(·),q∗(·)) is the corresponding state processes of Eq. (.). BecauseUis convex, for everyξ, the following variational controlξρis also inU:

ξρ:=ξ∗+ρξξ∗ , ≤ρ≤.

Denote the solution to Eq. (.) associated withξ =ξρby (Xρ(·),qρ(·)). And denote by (X(·),q(·)) the solution of the following variational equation:

⎧ ⎨ ⎩

dX(t) = [fx∗(t)X(t) +fxδ(t)X(tδ) +fq∗(t)q(t)]dtq(t)dW(t), ≤tT;

X(T) =ξξ∗, X(t) = , –δt< . (.)

Remark . It is easy to know that (.) is a linear time-delayed BSDE. By Proposition ., under conditions (H.)-(H.), Eq. (.) has a unique adapted solution inLF(–δ,T;RnLF(,T;Rn×d).

Lemma . Under assumptions(H.)-(H.),one has

lim

ρ→suptTEX

ρ

(t)= ,

lim ρ→E

T

(t)dt= ,

where

(t) =X

ρ(t) –X(t)

ρX(t), q ρ(t) =q

ρ(t) –q(t) ρq(t).

Remark . Since the proof of Lemma . above is the same as that of Lemma . in Chen and Huang [], for simplicity of presentation, we only present the main result and omit the detailed proof. In fact, it is straightforward to prove Lemma . by applying Proposi-tion ., Taylor expansion and the Lebesgue dominated convergence theorem.

3.4 Variational inequality

(8)

Given the optimalξ∗, for a constantε> , define(·) :U→Ras follows:

(ξ) =() –a+max,φ(ξ) –φξ∗ +ε

 .

Remark . One can test that the functions|() –a|andφ(ξ) are both continuous

in their argumentξ. Hence,, defined onU, is also a continuous function in its argu-mentξ.

Theorem . Under assumptions(H.)-(H.),suppose thatξis an optimal solution to Problem B,so we have h∈R+and h∈Rnsatisfying|h|+|h| = ,so that for everyξU,

we have the following variational inequality:

h,X()

+h

φx

ξ∗ ,ξξ∗≥, (.)

whereX()is the solution to Eq. (.)at time.

Proof We can check the following properties by the definition:

Fεξ∗ =ε;

(ξ) > , ∀ξU;

Fεξ∗ ≤inf

ξUFε(ξ) +ε.

Therefore, from Proposition . (Ekeland’s variational principle), there existsξεU sat-isfying:

(i) (ξε)(ξ); (ii) d(ξε,ξ)ε;

(iii) (ξ) +√εd(ξ,ξε)≥(ξε),∀ξU. For everyξU, denoteξε

ρ:=ξε+ρ(ξξε), ≤ρ≤. Let (Xρε(·),qερ(·)) (resp.(·),(·)) be the solution to (.) underξε

ρ (resp.ξε), and let ((·),(·)) be the solution to (.) whenξεis replaced byξ∗. Hence, applying the item (iii) above, one obtains

FεξρεFεξε +√εdξρε,ξε ≥. (.)

On the other hand, similar to Lemma ., one concludes

lim ρ→suptTE

ρ– ρ(t) –X

ε(t) Xε(t)= .

Thus

Xρε() –X ε

() =ρXε() +o(ρ),

which leads to the following expansion:

Xερ() –a

(9)

Moreover,

φξρεφξ∗ +ε–φξεφξ∗ +ε

= ρφξεφξ∗ +εφx

ξε ,ξξε+o(ρ).

In the next, we study the following two cases for givenε> . Case : There isρ>  so that for everyρ∈(,ρ),

φξρεφξ∗ +ε≥.

We see that

lim ρ→

(ξε

ρ) –(ξε) ρ

=lim ρ→

(ξε

ρ) +(ξε) F

ε(ξ ε ρ) –(ξ

ε)

ρ

= 

(ξε)

() –a,()+φξεφξ∗ +ε·φx

ξε ,ξξε.

Now, usingρto split (.) and lettingρto , one has

φxξε ,ξξε+,()≥–√εEξξε

, (.)

where

=  (ξε)·

φξεφξ∗ +ε≥,

=

(ξε)

() –a.

Case : There is a positive series{ρn}satisfyingρn→, so that

φξρε

nφ

ξ∗ +ε≤.

From the definition of, for largen,(ξε ρn) ={|X

ε ρn() –a|

}. Owing to the continuity

of(·), one has(ξε) ={|Xε() –a|}.

Moreover,

lim n→

(ξε ρn) –(ξ

ε)

ρ =nlim→

(ξε

ρn) +(ξ

ε)

(ξρεn) –F

ε(ξε) ρ

=X

ε() –a,Xε()

(ξε) .

From (.), the same as in Case ,

,()≥–√εEξξε

(10)

where

= , =

(ξε)

() –a.

For both cases, in summary, from the definition of(·), one has≥ and

+= .

Therefore, there exists a convergent subsequence of (

,) whose limit is denoted by

(h,h).

Due tod(ξε,ξ∗)≤√ε, we haveξεξ∗, asε→. Then, from the estimate of Proposi-tion ., we see that()X() asε. Thus (.) holds. The desired result is proved

now.

By using similar analysis, whenl(t,x,q)= , the following variational inequality can be obtained.

Theorem . Let(H.)-(H.)hold.Suppose thatξis an optimal solution of Problem B. Then we have h∈R+,h∈Rnsatisfying|h|+|h| = ,so that for everyξU,we have

the variational inequality:

h,X()

+h

φx

ξ∗ ,ξξ∗+h

T

lx∗(t),X(t)dt+h

T

lq(t),q(t)dt≥, (.)

where lϕ∗(t) =(t,X∗(t),q∗(t))denotes the partial derivative of latϕwithϕ=x,q, respec-tively,and(X(·),q(·))is the solution to variation equation(.).

3.5 Maximum principle

For the sake of establishing the maximum principle, in this part, as the dual equation of Eq. (.), the following equation is introduced:

⎧ ⎪ ⎪ ⎨ ⎪ ⎪ ⎩

dm(t) ={fx∗(t)Tm(t) +EFt[(f

|t+δ)

Tm(t+δ)] +h

lx(t)}dt + [fq∗(t)Tm(t) +h

lq(t)]dW(t), ≤tT; m() =h, m(t) = , T<tT+δ.

(.)

Remark . In Eq. (.),fxδ|t+δrepresents the value offxδwhentis replaced byt+δ.

Remark . It is easy to see that (.) is a linear time-advanced SDE. By Proposition ., under conditions (H.)-(H.), Eq. (.) admits the unique adapted solution in L

F(, T+δ;Rn).

Theorem . Let(H.)-(H.)hold.Ifξis optimal to Problem B with(X∗(·),q∗(·))being the corresponding state of Eq. (.),then we have h∈R+and h∈Rnsatisfying|h|+|h| =

,so that for everyηU,

m(T) +hφx

ξ∗ ,ηξ∗≥, a.s., (.)

(11)

Proof By using Itô’s formula tom(t),X(t), we obtain

dm(t),X(t)= –m(t)fx∗(t)X(t) +fxδ(t)X(tδ) +fq∗(t)q(t)dt

+X(t)fx∗(t)Tm(t) +EFtfxδ|t+δ T

m(t+δ)+hlx(t)

dt

+q(t)fq∗(t)Tm(t) +hlq(t)

dt+{· · · }dW(t)

=EFtfxδ|t+δ T

m(t+δ)X(t) –fxδ(t)m(t)X(tδ)dt

+h

lx(t)X(t) +lq(t)q(t)dt+{· · · }dW(t).

Therefore,

Em(T),X(T)–m(),X()=+,

with

=E

T

fx

δ|t+δ

T

m(t+δ)X(t) –fx

δ(t)m(t)X(tδ)

dt,

=hE

T

lx∗(t)X(t) +lq∗(t)q(t)dt.

Paying attention to the terminal and initial conditions, one derives

=E

T

fxδ|t+δ Tm(t+δ)X(t)dtE

T

fxδ(t)m(t)X(tδ)dt

=E

T+δ

T fx

δ(t)

Tm(t)X(tδ)dtE

δ

fx

δ(t)m(t)X(tδ)dt

= .

Hence

Em(T) +hφx

ξ∗ ,ξξ

=Eh,X()

+h

φx

ξ∗ ,ξξ∗+h

T

lx∗(t),X(t)dt+h

T

lq(t),q(t)dt

≥.

From the arbitrariness ofξU, for everyηU, we have

m(T) +hφx

ξ∗ ,ηξ∗≥, a.s.

Now, we let∂Krepresent the boundary ofKand denote

:=

ω|ξ∗∈∂K.

(12)

Corollary . Assume that the assumptions in Theorem.hold,then for eachηK, we have

m(T) +hφx

ξ∗ ,ηξ∗≥, a.s. on;

m(T) +hφx

ξ∗ = , a.s. onc.

Remark . By the above study, for the optimal terminal controlξ∗, we obtain the nec-essary condition. Note that the previous transformation process and (H.) allow us to make the inverse transformation. Therefore, the characterization of the optimal control processu∗(·) can be derived by the obtained stochastic maximum principle of the optimal terminal controlξ∗.

4 Applications of the main result

As stated in the section of Introduction, we study two applications of the main result es-tablished above in this section.

4.1 Stochastic delayed LQ control involving terminal state constraints

Stochastic delayed LQ control problem involving terminal state constraints is considered in this subsection. In order to simplify the presentation, we focus on the cased=n= . For the higher dimensional situation, one can deal with it in a similar method without substantial difficulty.

Consider the following state equation:

⎧ ⎪ ⎪ ⎨ ⎪ ⎪ ⎩

dX(t) = [AX(t) +AX(tδ) +Au(t)]dt

+ [BX(t) +BX(tδ) +Bu(t)]dW(t), ≤tT;

X(t) =η(t), –δt≤,

(.)

withAi,Bi∈R,i= , , .

Next, we investigate the cost function independent of the running cost without loss of generality. Therefore, subject tou(·)∈Uad,X(T)∈R+, a.s., the goal is to minimize the

following cost function:

Ju(·) = E

X(T). (.)

Without doubt, question (.) is an extraordinary example of Problem A with

bt,x,x,u =Ax+Ax+Au,

σt,x,x,u =Bx+Bx+Bu.

Now we give the backward formulation of problem (.). Denote

(13)

Then Eq. (.) becomes

⎧ ⎨ ⎩

dX(t) = (AX(t) +AX(tδ) +Au(t))dtq(t)dW(t), ≤tT;

X(T) =ξ, X(t) =η(t), –δt< , (.)

and we can rewrite problem (.) as follows:

⎧ ⎨ ⎩

MinimizeJ(ξ)

subject toξU; () =a, (.)

where

U=ξ|E|ξ|<∞,ξ∈R+, a.s..

By Theorem ., ifξ∗is optimal, we haveh∈R+andh∈Rsatisfying|h|+|h| = , so

that∀ηU,

m(T) +hξ∗,ηξ

≥, a.s., (.)

in whichm(·) is the solution to the following adjoint equation:

⎧ ⎨ ⎩

dm(t) = (Am(t) +AEFt[m(t+δ)])dt+Am(t)dW(t), ≤tT;

m() =h, m(t) = , T<tT+δ.

(.)

Denote:={ω|ξ∗(ω) = }. Now, the following necessary condition can be deduced

owing to the arbitrariness ofξ.

m(T) +hξ∗≥, a.s. on;

m(T) +hξ∗= , a.s. onc,

wherem(·) is the solution of Eq. (.).

4.2 Production-consumption choice optimization problem

By applying the maximum principle established before, we investigate a type of production-consumption choice optimization problem in this subsection. The shape for this issue, as in [], originates from Ivanov and Swishchuk []. For the sake of completeness, let us present the model at length.

We assume an investor is going to invest his money to invent goods, and he could obtain benefits from the goods. We mark the capital of investor, the labor at timetand the rate of consumption byX(t),A(t) andc(t)≥, respectively. Based upon the assumption that earning of the production is a function of the total sum of the capital and labor, in order to depict this system, Ramsey [] introduced the following shape:

dX(t) dt =f

(14)

Since in the procedure of investment, in reality, there is some risk and delay, Chen and Wu [] generalized the model in (.) to the following case:

⎧ ⎨ ⎩

dX(t) = [f(X(tδ),A(t)) –c(t)]dt+σ(X(tδ))dW(t), ≤tT;

X(t) =η(t), –δt≤, (.)

whereηis a given continuous function.

However, the rationality of the shape has been questioned as there is no constraint for the terminal capitalX(T) on the basis of the hypothesis. In fact, in real situations, some-times the investor will set a goal (constraint) for the terminal capitalX(T) in the invest-ment. Hence we believe that in a concordant model of the production and consumption some constraints for the terminal capitalX(T) should be considered, i.e.,X(T)∈Q, where Q∈Rn.

Let us consider the following model which modified (.) and (.):

⎧ ⎨ ⎩

dX(t) = [f(X(tδ),A(t)) –c(t)]dt+σ(X(tδ),c(t))dW(t), ≤tT;

X(t) =η(t), –δt≤.

For simplicity, letn=d= . Consider the following hypotheses:

() The functionf(X(tδ),A(t)) =KXα(tδ)Aβ(t), whereK,α,βare some suitable constants. Moreover, letα=β= andA(t)≡ybe a constant.

() The terminal constraintQ∈Ris a given convex set.

Under the above assumptions, we can rewrite our shape as follows:

⎧ ⎨ ⎩

dX(t) = [KyX(tδ) –c(t)]dt+σ(X(tδ),c(t))dW(t), ≤tT;

X(t) =η(t), –δt≤. (.)

By electing the hypothesis ratec(t)≥ under the terminal constraintX(T)∈Q, the pur-pose is to maximize the following desired function:

Jc(·) =E

T

ertc γ(t)

γ dt+X(T)

, (.)

whererrepresents the bond rate,γ ∈(, ), and  –γ represents the investor’s risk aver-sion.

Clearly, this is a special case of Problem A when

Uad≡

c(·)|c(·)∈LF,T;R+

with

bt,x,x,c =Ky·xc, σt,x,x,c =σx,c ,

lt,x,x,c = –ertc γ

(15)

Now, letqσ(x,c) andf(x,q) = –Ky·x+σ(x,q), whereσis the inverse function ofσ w.r.t.c, i.e.,c=σ:=σ(x,q). Then one can rewrite (.) as follows:

⎧ ⎨ ⎩

dX(t) = [–KyX(tδ) +σ(X(tδ),q(t))]dtq(t)dW(t), ≤tT;

X(t) =η(t), –δt< . (.)

DefineU={ξ|E|ξ|<∞,ξQ, a.s.}and consider the following performance function:

J(ξ) = –E

T

ertσ γ(t)

γ dt+ξ

. (.)

Then problem (.) is equivalent to the following problem:

⎧ ⎨ ⎩

MinimizeJ(ξ)

subject toξU; () =a. (.)

Consider the adjoint equation

⎧ ⎪ ⎪ ⎨ ⎪ ⎪ ⎩

dm(t) =EFt[(–Ky+ (σxδ|t+δ))m(t+δ)]dt

+ [σq(t)m(t) –hert·σγ–(t)]dW(t), ≤tT;

m() =h, m(t) = , T<tT+δ,

(.)

whereh∈Ris a parameter. Denote:={ω|ξ∗(ω) =∂Q}. Therefore, by using

The-orem ., one obtains the result below.

Theorem . Suppose(X∗(·),c∗(·))is an optimal pair to problem(.),then we have h∈R+and h∈Rsatisfying|h|+|h| = so thatξ∗≡X∗(T),we have

m(T) +hξ∗≥, a.s. on;

m(T) +hξ∗= , a.s. onc,

where m(·)is the solution to Eq. (.)with parameter h.

5 Conclusions

In this content, we study a stochastic optimal control problem for stochastic differential delayed equation with terminal state constraint (at the terminal time, the state is con-strained in a convex set). However, the control problem with terminal non-convex state constraint is still open. We will focus on the open problem in the future study.

Competing interests

The first and second authors announce to have no competing interests.

Authors’ contributions

(16)

Acknowledgements

The first author would like to appreciate the Department of Mathematics of University of Central Florida, USA, for its hospitality, and express the gratitude to Prof. Qingmeng Wei for her careful reading of this paper and helpful comments. The first and second authors are supported by NNSF of China (Grant Nos. 11371226, 11071145, 11526205, 11626247 and 11231005), the Foundation for Innovative Research Groups of National Natural Science Foundation of China (Grant No. 11221061) and the 111 Project (Grant No. B12023).

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Received: 24 January 2017 Accepted: 21 April 2017

References

1. Pardoux, E, Peng, S: Adapted solution of a backward stochastic differential equation. Syst. Control Lett.4, 55-61 (1990) 2. Peng, S: Probabilistic interpretations for systems of quasilinear parabolic partial differential equation. Stoch. Stoch.

Rep.37, 61-74 (1991)

3. El Karoui, N, Peng, S, Quenez, MC: A dynamic maximum principle for the optimization of recursive utilities under constraints. Ann. Appl. Probab.11, 664-693 (2001)

4. Yong, J, Zhou, X: Stochastic Controls: Hamiltonian Systems and HJB Equations. Springer, New York (1999) 5. El Karoui, N, Peng, S, Quenez, MC: Backward stochastic differential equations in finance. Math. Finance7(1), 1-71

(1997)

6. Barles, G, Buckdahn, R, Pardoux, E: Backward stochastic differential equations and integral-partial differential equations. Stoch. Stoch. Rep.60, 57-83 (1997)

7. Li, J, Wei, Q:Lpestimates for fully coupled FBSDEs with jumps. Stoch. Process. Appl.124(4), 1582-1611 (2014) 8. Li, J, Wei, Q: Stochastic differential games for fully coupled FBSDEs with jumps. Appl. Math. Optim.71, 411-448 (2015) 9. Buckdahn, R, Li, J, Peng, S: Mean-field backward stochastic differential equations and related partial differential

equations. Stoch. Process. Appl.119(10), 3133-3154 (2009)

10. Chen, L, Huang, J: Stochastic maximum principle for controlled backward delayed system via advanced stochastic differential equation. J. Optim. Theory Appl.167(3), 1112-1135 (2015)

11. Delong, Ł, Imkeller, P: Backward stochastic differential equations with time delayed generators results and counterexamples. Ann. Appl. Probab.20, 1512-1536 (2010)

12. Delong, Ł, Imkeller, P: On Malliavin’s differentiability of BSDE with time delayed generators driven by Brownian motions and Poisson random measures. Stoch. Process. Appl.120, 1748-1775 (2010)

13. Peng, S, Yang, Z: Anticipated backward stochastic differential equations. Ann. Probab.37, 877-902 (2009) 14. Wen, J, Shi, Y: Anticipative backward stochastic differential equations driven by fractional Brownian motion. Stat.

Probab. Lett.122, 118-127 (2017)

15. Chen, L, Wu, Z: Maximum principle for the stochastic optimal control problem with delay and application. Automatica46, 1074-1080 (2010)

16. Øksendal, B, Sulem, A, Zhang, T: Optimal control of stochastic delay equations and time-advanced backward stochastic differential equations. Adv. Appl. Probab.43(2), 572-596 (2011)

17. Yu, Z: The stochastic maximum principle for optimal control problems of delay systems involving continuous and impulse controls. Automatica48(10), 2420-2432 (2012)

18. Agram, N, Haadem, S, Øksendal, B, Proske, F: A maximum principle for infinite horizon delay equations. SIAM J. Math. Anal.45(4), 2499-2522 (2013)

19. Huang, J, Li, X, Shi, J: Forward-backward linear quadratic stochastic optimal control problem with delay. Syst. Control Lett.61(5), 623-630 (2012)

20. Meng, Q, Shen, Y: Optimal control of mean-field jump-diffusion systems with delay: a stochastic maximum principle approach. J. Comput. Appl. Math.279, 13-30 (2015)

21. Ji, S, Zhou, X: A maximum principle for stochastic optimal control with terminal state constraints and its applications. Commun. Inf. Syst.6, 321-338 (2006). A special issue dedicated Tyrone Duncan on the occasion of his 65th birthday 22. Ji, S, Peng, S: Terminal perturbation method for the backward approach to continuous time mean-variance portfolio

selection. Stoch. Process. Appl.118(6), 952-967 (2008)

23. Ji, S, Zhou, X: A generalized Neyman-Pearson lemma under g-probabilities. Probab. Theory Relat. Fields148, 645-669 (2010)

24. Ji, S, Wei, Q: A maximum principle for fully coupled forward-backward stochastic control systems with terminal state constraints. J. Math. Anal. Appl.407, 200-210 (2013)

25. Aghayeva, C: Stochastic linear quadratic control problem of switching systems with constraints. J. Inequal. Appl. 2016, 100 (2016)

26. Wei, Q: Stochastic maximum principle for mean-field forward-backward stochastic control system with terminal state constraints. Sci. China Math.59(4), 809-822 (2016)

27. Ivanov, A, Swishchuk, A: Optimal control of stochastic differential delay equations with application in economics. In: Conference on Stochastic Modelling of Complex Systems, Australia (2005)

References

Related documents

These modelling approaches were (i) a multimedia model initially explored as an opportunity to visualise supply and value chain issues for educational purposes; (ii) an agent

The Effect of Consumption of Unhealthy Snacks on Diet and the Risk of Metabolic Syndrome in Adults: Tehran Lipid and Glucose Study, Iran. Zahra

• Selective serotonin reuptake inhibitors and tricyclic antidepressants should be continued throughout the perioperative period to avoid discontinuation syndrome. •

For primary care patients with acute major de- pression or dysthymia, including elderly persons with- out significant comorbid conditions, physicians should consider either

The aim of this report is to present a patient who experienced social phobia following maprotiline administration, an adverse drug reaction which has not been reported yet with

With some of the older Tricyclic drugs it's best to start on a lower dose and work upwards over the next couple of weeks?. If you don't go back to the doctor and have the dose

Mirtazapine, or an atypical antipsychotic , choosing a different MOA than stage 2 drug Stage 3 *present to ECHO SSRI/SNRI + Bupropion, SSRI/SNRI + Mirtazapine, SSRI + TCA,