SlideShare a Scribd company logo
1 of 13
Download to read offline
Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 1, No. 1, May 2014
43
THE WEAK SOLUTION OF BLACK-SCHOLE’S OPTION
PRICING MODEL WITH TRANSACTION COST
Bright O. Osu and Chidinma Olunkwa
Department of Mathematics, Abia State University, Uturu, Nigeria
ABSTRACT
This paper considers the equation of the type
− + + = , ( , ) ∈ ℝ × (0, );
which is the Black-Scholes option pricing model that includes the presence of transaction cost. The
existence, uniqueness and continuous dependence of the weak solution of the Black-Scholes model with
transaction cost are established.The continuity of weak solution of the parameters was discussed and
similar solution as in literature obtained.
KEYWORDS
Black-Scholes Model, Option pricing, Transaction costs, Weak solution,Sobolev space
1. INTRODUCTION
Options are financial instrument that convey the right but not the obligation to engage in a
future transaction on the underlying assets.In a complete financial market without transaction
costs, the celebrated Black-Sholes no-arbitrage argument provide not only a rational option
pricing formula but also a hedging portfolio that replicate the contingent claim [8] .However the
Black-Scholes hedging portfoliorequires trading at all-time instants and the total turnover of
stock in the time interval [0, ] is infinite. Accordingly, when transaction cost directly
proportional to trading is incorporated in the Black –Scholes model the resulting hedging
portfolio is quite expensive. The condition under which hedging can take place has to be relaxed
such that the portfolio only dominate rather than replicate the value of the European call option
at maturity .The first model in that direction was presented in [4] . Here it was assumed that the
portfolio is rebalanced at a discrete time and that the transaction cost in buying and selling the
asset are proportional to the monetary value of the transaction. At a price S and a constant K
depending on an individual’s aversion to risk, the transaction costs are ∕ ∕ ∕, where N is
the number of shares bought ( > 0) or sold ( < 0). In [7], the existence, uniqueness and
continuity of the Black –Scholes model was discussed. Also in [6], option pricing with
transaction costs that leads to a nonlinear equation was investigated.In a related paper [1],the
discretetime, dominating policies was presented. In [3] further work on this in the presence of
transaction cost was presented...By applying the theorem of central limit, they show that as the
time step ∆ and transaction cost ∅ tend to zero. The price of discrete option converged to a
Black –Sholes price with adjusted volatility (. ). Here ∆ represent the mean time length for a
change in the value of the stock instead of transaction frequency. Here our adjusted volatility is
given by;
= (1 − ( ). (1.1)
Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 1, No. 1, May 2014
44
If
= ( ), = −
∅
√
then we have the adjusted volatility as in[7], where is the time lag between consecutive
transaction.
Let ( , ) be the value of the option and be the value of the hedge portfolio. We
assumeinstead that the value of the underlying follows the random work
= + ∅
with∅ drowned from a normal distribution, is a measure of the average rate of growth of the
asset price also known as the drift where = − and is a measure of the diffusion
coefficient . Then the change in the value of the portfolio over the time step is given by
(using (1.1))
∆ = − ∆ ∅ + ∅ (1 − ( )) + ( − ) + − ∆ − / / .
Making a digression and investigating the nature of the number of assets bought or sold given
that we posit the number of asset (the delta of our option) as = .
Conventionally, thedelta of an option is represented by ∆ . Given that is evaluated at the asset
value s and time ,we have = ( , ).
Rehedging after finite time ∆ leads to a change in the value of assets as below
= ( + ∆ , + ∆ ).
This of course evaluated at the new asset price and time .therefore the number of assets to be
traded after ∆ is given by
= ( + ∆ , + ∆ ) − ( , ) ≈ ∅ .
Hence the expected transaction cost over a time step is
[ / / ] = [| |] = ∅
= [|∅|] ,
Where
|∅| = .
The expected change in the value of the portfolio is
Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 1, No. 1, May 2014
45
(∆ ) = ( + ( , , ) − )
If the holder of the option expects to make as much from his portfolio as from a bank account at
a riskless interest rate (no arbitrage), then
(∆ ) = − .
Hence following[9] for option pricing with transaction costs is given by
+ ( , , ) + − − = 0, ( , ) ∈ (0, ∞) × (0, ), (1.2)
and the final condition
( , ) = max( − , 0) , ∈ (0, ∞),
for European call option with strike price E.
Note that equation (1.2) contents the usual Black-Scholes terms with additional nonlinear term
modeling the presence of transaction costs. Setting
= log , = −
1
2
, = ( , ),
equation (1.2) becomes
− + + ( − 1) − = , ( , ) ∈ (0, ∗), (1.3)
with initial condition
( , 0) = max( − 1,0) , ∈ ℝ,
Where
= ( 2⁄ )⁄ , = 8 ( )⁄ ∗
= 2⁄ .
Set
= ( , ) = ( , ).
Then (1.3)gives
− + + ( + 1) = + , ( , ) ∈ ℝ × (0, ), (1.4)
With the initial condition
( , 0) = (1 − , 0)
Let
= + 1
Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 1, No. 1, May 2014
46
The previous discussion motivates us to consider the following problem that includes cost
structures that go beyond proportional transaction costs.
− + + = , ( , ) ∈ ℝ × (0, ), (1.5)
and
( , 0) = ( ), ∈ ℝ. (1.6)
In this paper we looked into parameters that are governing the Black-Scholes option pricing
model with the present of transaction costs such that equation (1.5) exhibits the desired
behaviour. More precisely, let
= = , ∈ [ , ] × , ,
where
> 0 > 0.
Defined a functional ( ) by
( ) = ‖ ( , ) − ‖ ( , ; ), (1.7)
where the dalta can be thought of as the desired value of ( ; ). The parameter identification
problem for (1.5) with the objective function (1.7) is to find
∗
= ∗
, ∗
∈
Satisfying
( ∗) = ∈ ( ). (1.8)
Let
→ ( )
from, in to ([0, ]; be the solution map . In what follows, the existence and uniqueness of
the weak solution of (1.5) is established in the next section. Continuity of the solution with
respect to data is established in section 3.
2. EXISTENCE AND UNIQUENESS OF WEAK SOLUTION
Since the type of equation in (1.5) do not belong to (ℛ) we introduce weighted lebessgue and
sobolev spaces
(ℛ)and (ℛ) for > 0
as follows.
(ℛ) = ∈ (ℛ): | |
∈ (ℛ) (2.1)
H (ℛ) = ∈ (ℛ): | |
∈ (ℛ), | |
∈ (ℛ) .(2.2)
Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 1, No. 1, May 2014
47
The respective inner products and norms are defined by
( , ) (ℛ) = ∫ℛ
| |
(2.3)
( , ) (ℛ) = ∫ℛ
| |
+ ∫ℛ
| |
(2.4)
‖ ‖ (ℛ) = ∫ℛ
| | | |
(2.5)
‖ ‖ (ℛ) = ∫ℛ
| | | |
+ ∫ℛ
| | | |
(2.6)
We define the dual space of H (ℛ) as
(ℛ)
∗
=  : (ℛ) → ℛ (2.7)
The duality pairing between (ℛ) and (ℛ)
∗
is given by
〈 , 〉 = ∫ℛ
| | | |
(2.8)
In what follows, we state,
LEMMA1: Let = (ℛ).For ∅ ∈ , ∅ = (−1,1), ∫ ∅ ( ) = 1, ∅ =ℛ
∅ ,
then
∅ ∗ → (ℛ). (2.9)
PROOF: Suppose = | |
,
then we have
(∅ ∗ ). = ∅ ∗ ( . ) + (∅ ∗ ). − ∅ ∗ ( . ) . (2.10)
since
. ∈ ∅ ∗ ( . )
it suffices to show that
‖ ‖ = (‖(∅ ∗ ). − ∅ ∗ ( . )‖) → 0 → 0 (2.11)
The fundamental theory of calculus for give
( ) = ∫ℛ∅ ( − ) ( )( ( ) − ( )) (2.12)
using
Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 1, No. 1, May 2014
48
∅ = (− , )
We get
| ( )| ≤ ∫ℛ
|∅ ( − )|| ( )|(2 | ( )|) = ∫ℛ
|∅ ( − )|| ( )|(2 | ( + )|) = ( )(2.13)
Since
( ) =
uniformly and
| ( )| ≤ 2 | ( )|,
thus
‖ ( )‖ → 0 as → 0
LEMMA 2: (ℛ)the space of test function in ℛ,is densein H (ℛ).
PROOF .Let ∈ (ℛ) Φ ∈
such that
( ) =
1, | | ≤ 1
0, | | ≥ 2
Now we show that
= . (. ) ∗ ∈
where
= , →
in (ℛ).ie
→ ∇ → (ℛ) (2.14)
= . ( (. )) ∗ + . (. ) ∗ (2.15)
It suffices to show
. ( (. )) ∗ → (ℛ) (2.16)
By the lebesgue Dominated convergence Theorem ,we get
. ( (. )) → (ℛ)(2.17)
Hence Lemma 1 concludes the proof.
Since (ℛ) is dense in (ℛ) (ℛ) , the following lemma follows immediately.
Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 1, No. 1, May 2014
49
LEMMA 3:
(ℛ) ⊂ (ℛ) ⊂ (ℛ)
∗
,
from Gelfand triple.
Note. Since (ℛ) is dense in (ℛ),the definition of 〈. , . 〉 allows us to interprete the operator
as a mapping from →
∗
.
for our simplicity,we use
= (ℛ), ∗
= (ℛ)
∗
and = (ℛ)
To use the variational formulation let us defined the following bilinear form on ×
( , )( , ) = ∫ℛ
| |
+ ∫ℛ
| |
− − ∫ℛ
| |
(2.18)
for
> 0 > 0 ,
One can show ( , )( , ) is bounded and coercive in .Define linear operator
( ≡, ): ( , ) = : ∈ , ( , ) ∈ ∗
into ∗
by
( , )( , ) = ( , ), ,
for all ∈ ( , ) for all ∈ .
DEFINATION 4.Let X be a Banach space and , ∈ with < , 1 ≤ < ∞.Then
(0, ; ) and (0, ; )denote the space of measurable functions defined on ( , ) with
values in such that the function → ‖ (. , )‖ is square integrable and essentially bounded.
The respective norms are defined by
‖ ‖ ( , ; ) = ∫ ‖ (. , )‖ (2.19)
‖ ‖ ( , ; ) = . ‖ (. , )‖ . (2.20)
For details on these function space ,see [10]
Definition 5.A function : [0, ] → is a weak solution of (1.5) if
(i) ∈ (0, ; )and ∈ (0, ; ∗);
(ii) For every ∈ , 〈 ( ), 〉 + ( , )( ( ), ) = 0 ,for t pointwise a.e.in [0, ];
(0) = .
Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 1, No. 1, May 2014
50
Note .The time derivative understood in the distribution sense.The following two lemmas are
of critical importance for the existence and uniqueness of the weak solutions.
LEMMA 6.Let ↪ ↪ ∗
∈ (0, ; ) , ∈ (0, ; ∗) ,then ∈ ([0, ]; ).
Moreover, for any ∈ ,the real –valued function → ‖ ( )‖ is weakly differentiable in
(0, ) and satisfies
{‖ ‖ } = 〈 , 〉 (2.21)
LEMMA 7. (Gronwall’s Lemma) Let ( ) be a nonnegative,summable function on [0, ]
which satisfies the integral inequality
( ) ≤ ∫ ( ) + (2.22)
for constant ≥ 0
almost everywhere ∈ [0. ].Then
( ) ≤ (1 + )a.e on 0 ≤ ≤ ( 2.23).
in particular, if
( ) ≤ ∫ ( ) a.e on 0 ≤ ≤ ,then ( ) = 0 . on [0, ] (2.24)
FOR PROOF SEE [6].
LEMMA 8.The weak solution of (1.5) is unique if it exists.
Proof. Let and be two weak solution of (1.5). Let = − .To prove Lemma 8
.suffices to show that = 0 pointwise a.e.on [0, ].since 〈 ( ), 〉 + ( , )( ( ), ) = 0 for
any ∈ ,we take = ∈ to get
〈 ( ), 〉 + ( , )( ( ), ) = 0 (2.25)
(2.25) is true point wisea.s .on [0, ].Using (2.1) and the coercivity estimate,we have
1
2
‖ ‖ ≤ ‖ ‖ , (0) = 0
For some > 0.By Lemma 7, ‖ ‖ = 0 for all ∈ [0, ].Thus = 0 pointwise a.e in [0, ].
To show existence of the weak solution of (1.5) .we first show existence and uniqueness of
approximation solution. Now we define the approximate solution of (1.5)
DEFINITION9.A function : [0, ] → is an approximate solutions of (1.5) if
(i) ∈ (0, , )and ) ∈ (0, , );
Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 1, No. 1, May 2014
51
(ii) for every ∈ and 〈 ( ), 〉 + ( , )( ( ), ) = 0 pointwise a.e in [ , ]
(iii) (0) =
To prove the existence of approximate solution ,we take = in
〈 ( ), 〉 + ( , )( ( ), ) = 0
to get following system of ODEs
+ ∑ = 0 , (0) = (2.26)
Where
∈ , ∈ ,for0 ≤ ≤ , ( ) = , ,and = , for : [0, ] → ℛ ,
equation 2.24 can be written as
⃗ + ( ) ⃗ = 0 , ⃗ (0) = ⃗ (2.27)
Since
∈ (0, ; ℛ ×
,for ⃗ = ⃗ .
2.25can be written as
⃗ ( ) = ⃗ − ∫ ( ) ⃗ ( ) (2.28)
The following lemma is immediate from contraction mapping theorem and (2.28)
LEMMA 10: For any ∈ ,there a unique approximate solution : [0, ] → of (2.28).
The following theorem provide the energy estimate for approximate solutions.
Theorem11.There exist a constant depending only on Ω such that the approximate
solution satisfies
‖ ‖ ( , ; ) + ‖ ‖ ( , ; ) + ( , ; )
≤ ‖ ‖ (2.29)
Proof: For every ∈ we have
〈 ( ), 〉 + ( , )( ( ), ) = 0.
take ∈ ( ),then we have
〈 ( ), 〉 + ( , )( ( ), ) = 0.,pointwisea.e in (0, ) (2.30)
using 2.30 and the coercivity estimate.We find that there exists constants
> 0, > 0
such that
( ‖ ‖ ) + ‖ ‖
≤ 0 (2.31)
Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 1, No. 1, May 2014
52
Integrating 2.31 with respect to t,using the initial condition (0) = ( ), ( 2.39).
and
‖ ( )‖ ≤ ‖ ‖ , we get
( ‖ ‖ ) + ‖ ‖
(2.32)
taking the supriemum over [0, ],we get
‖ ‖ ( , ; ) + ‖ ‖ ( , ; ) ≤ ‖ ‖ (2.33)
Since
( ) ∈ ∗
,
we have
( ) ∗ = sup ∈ ∗
( ),
‖ ‖
, ≠ 0 (2.34)
Using the notion of approximate solution and boundedness of A we have
‖ ‖ ( , ; ) + ‖ ‖ ( , ; ) + ( , ; )
≤ ‖ ‖ (2.35)
To complete the proof of weak solution, we now show the convergence of the approximate
solutions by using weak compactness argument.
DEFINITION 12: Let (0, ; ∗) be the dual space of (0, ; ).Let ∈ (0, ; ∗) and
∈ (0, ; ),then we say → (0, ; ) weakly if
∫ 〈 ( ), ( )〉 → ∫ 〈 ( ), ( )〉 ∀ ∈ (0, ; ∗) (2.36)
Lemma 13 .A subsequence { } of approximate solutions converge weakly in (0, ; ∗)
to a weak solution ∈ ([0, ]; ) ∩ (0, ; )of (1.5) with ∈ (0, ; ∗).Moreover,it
satisfies
‖ ‖ ( , ; ) + ‖ ‖ ( , ; ) + ‖ ‖ ( , ; ) ≤ ‖ ‖ (2.37)
PROOF.Theorem 11 implies that the approximate solutions { } are bounded in (0, ; )
and their derivatives are bounded in (0, ; ∗). By the Banach-Alaoglu theorem, we
can extract a subsequence { } such that
→ (0, ; ), → (0, ; ∗)weakly(2.38)
Let ∅ ∈ (0,T) be a real-valued test function and ∈ for some = .Replacing by
( ) 〈 ( ), 〉 + ( , )( ( ), ) = 0
and integrating from 0 toT, we get.
∫ 〈 ( ), ( ) 〉 + ∫ ( , )( ( ), ( ) ) = 0 ≥ 2.38
Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 1, No. 1, May 2014
53
taking the limit as → ∞,we get
∫ ( ), = ∫ 〈 , ∅ 〉 (2.39)
by using boundedness of ( , ),we get
∫ ( , )( ( ), ( ) ) = ∫ ( , )( ( ), ∅( ) ) (2.40)
using boundedness of ( , ),we get
〈 ( ), 〉 + ( , )( , ) = 0 (2.41)
pointwise a.e in (0, )
since 2.41 is true for all ∈
∈
and( 2.42)
is dense in V,so (2.42) holds for all ∈ . now it remains to show that (0) = .using
(2.42),integrating by parts and Galerkin approximation we have
〈 (0), 〉 = 〈 , 〉 → ∞
for every ∈ .Thus (0) =
3 EXISTENCEOF OPTIMALPARAMETER
Lemma 14 .Let ∈ .Then the mapping , → , from
= = , ∈ [ , ] × ,
into is continuous.
Proof .Suppose that → in ℛ as → ∞.We denote = , and = , .We claim
that
‖( − ) ‖ → 0
as → ∞. Let ∈ with‖ ‖ ≤ 1.Then
|〈( − ) , 〉| ≤ (| − || || | )
ℛ
+ − | || |
ℛ
+ − | || |
ℛ
+ (| − || || | )
ℛ
≤ 2| − | | |( )
ℛ
+ − | |( )
ℛ
+ − | |( )
ℛ
→ 0
→ ∞
Lemma 15.Suppose that , → , in ℛ , and → weakly in V as → ∞.Then →
weakly in .
Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 1, No. 1, May 2014
54
Proof.Let ∈ ,then.
〈 , , 〉 − 〈 , 〉 = 〈 , ,〉 − 〈 〉 ≤ |〈 − 〉 , | + |〈 , − 〉| (2.43)
Since a weakly convergent sequence is bounded, we have
|〈 − 〉 , | ≤ ‖ − ‖ ‖ ‖ ≤ ‖ − ‖ → 0
as → ∞ Lemma 14.The second term
〈 , , − 〉 → 0
since → weakly.
Lemma16.Let ∈ . Then the solution map → ( ) from into ([0, ]; ) is
continuous.
Proof.Let → in as → ∞.Since ( ; ) is the weak solution of (1.5) for any ∈
we have the following estimate.
‖ ( ; )‖ ( , ; ) + ‖ ( ; ), ‖ ( , ; ) + ( ; ) ( , ; )
≤ ‖ ‖ (2.44)
Where C is constant independent of ∈ . Estimate (2.44) shows that ( ; ) is bounded in
(0, ).Since (0, ) is reflexive.we can choose a sub-sequence ( ; ) weakly convergent
to a function in (0, ).The fact that ( ; ) is bounded in (0, ) implies that ( , )
is bounded in (0, ; ),so ( ; )weakly convergent to a function in (0, ; ).Since
is compactly imbedded in ,then by the classical compactness theorem[4] ( ; ) → in
(0, ; ),.By (2,44) the derivative ( ; ) and are uniformly bounded in
(0, ; ).Therefore functions ; , are equicontinuous in
([0, ]; )..Thus ( ; ) → in ([0, ]; ) …In particular ( ; ) → ( ) in H and
( ; ) → weakly in V for any ∈ [0, ].By lemma 15, ] ( ; ) → ( ) weakly in
.Now we see that z satisfies the equation given in definition 5,ie it is the weak solution ( )
The uniqueness of the weak solution implies that ( ) → ( ) → ∞ in
([0, ]; ) for the entire sequence ( ) and not for its subsequence. Thus that ( ; ) →
( ) in ([0, ]; ) as that → in as claimed.
3. CONCLUSIONS
The Black-Scholes option pricing model with transaction cost was discussed, where we use an
adjusted volatility given as = (1 − ( ) and a continuous random work which
generalizes the works in the literature.The parameters associated with the Black –Scholes option
pricing model with transaction cost was considered. Also the existence and uniqueness of weak
solution of Black-Scholes option price with transaction cost was studied. The continuity of
weak solution of the parameters was discussed and similar solution as in literature obtained. The
extra terms introduced in this paper is to directly model asset pricedynamics in the case when
the large trader chooses a givenstock-trading strategy.If transaction costs are taken into account
perfect replicationof the contingent claim is no longer possible. Hence, one can re-adjust the
volatility (when the investor’s preferences are characterized by anexponential utility function)in
the form;
Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 1, No. 1, May 2014
55
= 1 + − ( − ) ’
and if a the weak solution can be obtained.
REFERENCES
[1] Delbaen.F.,Schachermayer, W.(1994), Theorem of asset Pricing.Math.AGeneralVersion of the
fundamental Annalen,Vol.300,pp.463-520
[2] Evans L.C (1998) ,Partial Differential Equations, Graduate Studies in Mathematics Vol
19,AMS,providence,Rhodes Island
[3] FishcerBlack,Myron Scholes (1973).The pricing of option and corporate liabilities ,J.Political Vol
81 pp 637-659
[4] Hayne E.Leland.(1985) Option pricing and replication with transactions cost The journal of finance
vol.40,No5,pp1283-1301
[5] Harrison M and Pliska S.(1981),Martingales and Stochastic Integrals in the theory of continuous
trading.Stoch,Proc& Appl.Vol.11,pp 215-260.
[6] Maria Cristina .Emmanuel Ncheuhuim.IndranilSengupta(2011).Solution to a nonlinear Black-
Scholes Equation Vol.2011,N0 158,pp 1-1
[7] Narayan Thapa,JustinZiegler,Carson Moen (2012).Existence of optimal parameter for the Black-
Scholes option pricing model.Vol78,No4,pp523-534
[8] Paul Wilmott,JeffDewynne,SamHowison. ,(1993) Option pricing:Mathematical Models and
Computation,Oxford Financial Press,Oxforduk
[9] Hoggard.T,WhalleyA.E,Wilmott. P (1994)Hedging option portfolios in the presence of Transaction
costs ,Adv .Future opt.Res., Vol 7 pp 21
[10] Dautray,.R,Lions J.L ,Mathematical Analysis and Numerical Methods for Science and
Technogy,Volume 5,Springer-Verlag.

More Related Content

What's hot

Fuzzy Logic And Application Jntu Model Paper{Www.Studentyogi.Com}
Fuzzy Logic And Application Jntu Model Paper{Www.Studentyogi.Com}Fuzzy Logic And Application Jntu Model Paper{Www.Studentyogi.Com}
Fuzzy Logic And Application Jntu Model Paper{Www.Studentyogi.Com}guest3f9c6b
 
(DL hacks輪読) Variational Inference with Rényi Divergence
(DL hacks輪読) Variational Inference with Rényi Divergence(DL hacks輪読) Variational Inference with Rényi Divergence
(DL hacks輪読) Variational Inference with Rényi DivergenceMasahiro Suzuki
 
Murphy: Machine learning A probabilistic perspective: Ch.9
Murphy: Machine learning A probabilistic perspective: Ch.9Murphy: Machine learning A probabilistic perspective: Ch.9
Murphy: Machine learning A probabilistic perspective: Ch.9Daisuke Yoneoka
 
SOLVING BVPs OF SINGULARLY PERTURBED DISCRETE SYSTEMS
SOLVING BVPs OF SINGULARLY PERTURBED DISCRETE SYSTEMSSOLVING BVPs OF SINGULARLY PERTURBED DISCRETE SYSTEMS
SOLVING BVPs OF SINGULARLY PERTURBED DISCRETE SYSTEMSTahia ZERIZER
 
18 Machine Learning Radial Basis Function Networks Forward Heuristics
18 Machine Learning Radial Basis Function Networks Forward Heuristics18 Machine Learning Radial Basis Function Networks Forward Heuristics
18 Machine Learning Radial Basis Function Networks Forward HeuristicsAndres Mendez-Vazquez
 
The Kernel Trick
The Kernel TrickThe Kernel Trick
The Kernel TrickEdgar Marca
 
Lesson 25: Evaluating Definite Integrals (slides)
Lesson 25: Evaluating Definite Integrals (slides)Lesson 25: Evaluating Definite Integrals (slides)
Lesson 25: Evaluating Definite Integrals (slides)Matthew Leingang
 
INDUCTIVE LEARNING OF COMPLEX FUZZY RELATION
INDUCTIVE LEARNING OF COMPLEX FUZZY RELATIONINDUCTIVE LEARNING OF COMPLEX FUZZY RELATION
INDUCTIVE LEARNING OF COMPLEX FUZZY RELATIONijcseit
 
FUZZY IDEALS AND FUZZY DOT IDEALS ON BH-ALGEBRAS
FUZZY IDEALS AND FUZZY DOT IDEALS ON BH-ALGEBRASFUZZY IDEALS AND FUZZY DOT IDEALS ON BH-ALGEBRAS
FUZZY IDEALS AND FUZZY DOT IDEALS ON BH-ALGEBRASIAEME Publication
 
Digital Distance Geometry
Digital Distance GeometryDigital Distance Geometry
Digital Distance Geometryppd1961
 
Lesson 27: Evaluating Definite Integrals
Lesson 27: Evaluating Definite IntegralsLesson 27: Evaluating Definite Integrals
Lesson 27: Evaluating Definite IntegralsMatthew Leingang
 

What's hot (14)

9 pd es
9 pd es9 pd es
9 pd es
 
Fuzzy Logic And Application Jntu Model Paper{Www.Studentyogi.Com}
Fuzzy Logic And Application Jntu Model Paper{Www.Studentyogi.Com}Fuzzy Logic And Application Jntu Model Paper{Www.Studentyogi.Com}
Fuzzy Logic And Application Jntu Model Paper{Www.Studentyogi.Com}
 
(DL hacks輪読) Variational Inference with Rényi Divergence
(DL hacks輪読) Variational Inference with Rényi Divergence(DL hacks輪読) Variational Inference with Rényi Divergence
(DL hacks輪読) Variational Inference with Rényi Divergence
 
Murphy: Machine learning A probabilistic perspective: Ch.9
Murphy: Machine learning A probabilistic perspective: Ch.9Murphy: Machine learning A probabilistic perspective: Ch.9
Murphy: Machine learning A probabilistic perspective: Ch.9
 
SOLVING BVPs OF SINGULARLY PERTURBED DISCRETE SYSTEMS
SOLVING BVPs OF SINGULARLY PERTURBED DISCRETE SYSTEMSSOLVING BVPs OF SINGULARLY PERTURBED DISCRETE SYSTEMS
SOLVING BVPs OF SINGULARLY PERTURBED DISCRETE SYSTEMS
 
18 Machine Learning Radial Basis Function Networks Forward Heuristics
18 Machine Learning Radial Basis Function Networks Forward Heuristics18 Machine Learning Radial Basis Function Networks Forward Heuristics
18 Machine Learning Radial Basis Function Networks Forward Heuristics
 
The Kernel Trick
The Kernel TrickThe Kernel Trick
The Kernel Trick
 
Lesson 25: Evaluating Definite Integrals (slides)
Lesson 25: Evaluating Definite Integrals (slides)Lesson 25: Evaluating Definite Integrals (slides)
Lesson 25: Evaluating Definite Integrals (slides)
 
INDUCTIVE LEARNING OF COMPLEX FUZZY RELATION
INDUCTIVE LEARNING OF COMPLEX FUZZY RELATIONINDUCTIVE LEARNING OF COMPLEX FUZZY RELATION
INDUCTIVE LEARNING OF COMPLEX FUZZY RELATION
 
FUZZY IDEALS AND FUZZY DOT IDEALS ON BH-ALGEBRAS
FUZZY IDEALS AND FUZZY DOT IDEALS ON BH-ALGEBRASFUZZY IDEALS AND FUZZY DOT IDEALS ON BH-ALGEBRAS
FUZZY IDEALS AND FUZZY DOT IDEALS ON BH-ALGEBRAS
 
Digital Distance Geometry
Digital Distance GeometryDigital Distance Geometry
Digital Distance Geometry
 
Lesson 27: Evaluating Definite Integrals
Lesson 27: Evaluating Definite IntegralsLesson 27: Evaluating Definite Integrals
Lesson 27: Evaluating Definite Integrals
 
L3 some other properties
L3 some other propertiesL3 some other properties
L3 some other properties
 
Ch02 fuzzyrelation
Ch02 fuzzyrelationCh02 fuzzyrelation
Ch02 fuzzyrelation
 

Similar to THE WEAK SOLUTION OF BLACK-SCHOLE’S OPTION PRICING MODEL WITH TRANSACTION COST

Spanos lecture+3-6334-estimation
Spanos lecture+3-6334-estimationSpanos lecture+3-6334-estimation
Spanos lecture+3-6334-estimationjemille6
 
Optimal Prediction of the Expected Value of Assets Under Fractal Scaling Expo...
Optimal Prediction of the Expected Value of Assets Under Fractal Scaling Expo...Optimal Prediction of the Expected Value of Assets Under Fractal Scaling Expo...
Optimal Prediction of the Expected Value of Assets Under Fractal Scaling Expo...mathsjournal
 
A Probabilistic Algorithm for Computation of Polynomial Greatest Common with ...
A Probabilistic Algorithm for Computation of Polynomial Greatest Common with ...A Probabilistic Algorithm for Computation of Polynomial Greatest Common with ...
A Probabilistic Algorithm for Computation of Polynomial Greatest Common with ...mathsjournal
 
Uncertain Volatility Models
Uncertain Volatility ModelsUncertain Volatility Models
Uncertain Volatility ModelsSwati Mital
 
sublabel accurate convex relaxation of vectorial multilabel energies
sublabel accurate convex relaxation of vectorial multilabel energiessublabel accurate convex relaxation of vectorial multilabel energies
sublabel accurate convex relaxation of vectorial multilabel energiesFujimoto Keisuke
 
Partial ordering in soft set context
Partial ordering in soft set contextPartial ordering in soft set context
Partial ordering in soft set contextAlexander Decker
 
Numarical values
Numarical valuesNumarical values
Numarical valuesAmanSaeed11
 
Numarical values highlighted
Numarical values highlightedNumarical values highlighted
Numarical values highlightedAmanSaeed11
 
Notes on Intersection theory
Notes on Intersection theoryNotes on Intersection theory
Notes on Intersection theoryHeinrich Hartmann
 
Fixed point result in probabilistic metric space
Fixed point result in probabilistic metric spaceFixed point result in probabilistic metric space
Fixed point result in probabilistic metric spaceAlexander Decker
 
X01 Supervised learning problem linear regression one feature theorie
X01 Supervised learning problem linear regression one feature theorieX01 Supervised learning problem linear regression one feature theorie
X01 Supervised learning problem linear regression one feature theorieMarco Moldenhauer
 
Perspectives and application of fuzzy initial value problems
Perspectives and application of fuzzy initial value problemsPerspectives and application of fuzzy initial value problems
Perspectives and application of fuzzy initial value problemsRAJKRISHNA MONDAL
 
Perspectives and application of fuzzy initial value problems
Perspectives and application of fuzzy initial value problemsPerspectives and application of fuzzy initial value problems
Perspectives and application of fuzzy initial value problemsRAJKRISHNA MONDAL
 

Similar to THE WEAK SOLUTION OF BLACK-SCHOLE’S OPTION PRICING MODEL WITH TRANSACTION COST (20)

Spanos lecture+3-6334-estimation
Spanos lecture+3-6334-estimationSpanos lecture+3-6334-estimation
Spanos lecture+3-6334-estimation
 
Optimal Prediction of the Expected Value of Assets Under Fractal Scaling Expo...
Optimal Prediction of the Expected Value of Assets Under Fractal Scaling Expo...Optimal Prediction of the Expected Value of Assets Under Fractal Scaling Expo...
Optimal Prediction of the Expected Value of Assets Under Fractal Scaling Expo...
 
G05834551
G05834551G05834551
G05834551
 
A Probabilistic Algorithm for Computation of Polynomial Greatest Common with ...
A Probabilistic Algorithm for Computation of Polynomial Greatest Common with ...A Probabilistic Algorithm for Computation of Polynomial Greatest Common with ...
A Probabilistic Algorithm for Computation of Polynomial Greatest Common with ...
 
lec-ugc-sse.pdf
lec-ugc-sse.pdflec-ugc-sse.pdf
lec-ugc-sse.pdf
 
Uncertain Volatility Models
Uncertain Volatility ModelsUncertain Volatility Models
Uncertain Volatility Models
 
sublabel accurate convex relaxation of vectorial multilabel energies
sublabel accurate convex relaxation of vectorial multilabel energiessublabel accurate convex relaxation of vectorial multilabel energies
sublabel accurate convex relaxation of vectorial multilabel energies
 
Assignment 2 solution acs
Assignment 2 solution acsAssignment 2 solution acs
Assignment 2 solution acs
 
Partial ordering in soft set context
Partial ordering in soft set contextPartial ordering in soft set context
Partial ordering in soft set context
 
Numarical values
Numarical valuesNumarical values
Numarical values
 
Numarical values highlighted
Numarical values highlightedNumarical values highlighted
Numarical values highlighted
 
Notes on Intersection theory
Notes on Intersection theoryNotes on Intersection theory
Notes on Intersection theory
 
Fixed point result in probabilistic metric space
Fixed point result in probabilistic metric spaceFixed point result in probabilistic metric space
Fixed point result in probabilistic metric space
 
Chapter 04 answers
Chapter 04 answersChapter 04 answers
Chapter 04 answers
 
X01 Supervised learning problem linear regression one feature theorie
X01 Supervised learning problem linear regression one feature theorieX01 Supervised learning problem linear regression one feature theorie
X01 Supervised learning problem linear regression one feature theorie
 
Thesis
ThesisThesis
Thesis
 
Linearization
LinearizationLinearization
Linearization
 
presentation
presentationpresentation
presentation
 
Perspectives and application of fuzzy initial value problems
Perspectives and application of fuzzy initial value problemsPerspectives and application of fuzzy initial value problems
Perspectives and application of fuzzy initial value problems
 
Perspectives and application of fuzzy initial value problems
Perspectives and application of fuzzy initial value problemsPerspectives and application of fuzzy initial value problems
Perspectives and application of fuzzy initial value problems
 

More from mathsjournal

OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...mathsjournal
 
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...mathsjournal
 
A Positive Integer 𝑵 Such That 𝒑𝒏 + 𝒑𝒏+𝟑 ~ 𝒑𝒏+𝟏 + 𝒑𝒏+𝟐 For All 𝒏 ≥ 𝑵
A Positive Integer 𝑵 Such That 𝒑𝒏 + 𝒑𝒏+𝟑 ~ 𝒑𝒏+𝟏 + 𝒑𝒏+𝟐 For All 𝒏 ≥ 𝑵A Positive Integer 𝑵 Such That 𝒑𝒏 + 𝒑𝒏+𝟑 ~ 𝒑𝒏+𝟏 + 𝒑𝒏+𝟐 For All 𝒏 ≥ 𝑵
A Positive Integer 𝑵 Such That 𝒑𝒏 + 𝒑𝒏+𝟑 ~ 𝒑𝒏+𝟏 + 𝒑𝒏+𝟐 For All 𝒏 ≥ 𝑵mathsjournal
 
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...mathsjournal
 
Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...
Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...
Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...mathsjournal
 
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...mathsjournal
 
The Impact of Allee Effect on a Predator-Prey Model with Holling Type II Func...
The Impact of Allee Effect on a Predator-Prey Model with Holling Type II Func...The Impact of Allee Effect on a Predator-Prey Model with Holling Type II Func...
The Impact of Allee Effect on a Predator-Prey Model with Holling Type II Func...mathsjournal
 
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...mathsjournal
 
Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...
Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...
Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...mathsjournal
 
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...mathsjournal
 
Modified Alpha-Rooting Color Image Enhancement Method on the Two Side 2-D Qua...
Modified Alpha-Rooting Color Image Enhancement Method on the Two Side 2-D Qua...Modified Alpha-Rooting Color Image Enhancement Method on the Two Side 2-D Qua...
Modified Alpha-Rooting Color Image Enhancement Method on the Two Side 2-D Qua...mathsjournal
 
A Study on L-Fuzzy Normal Subl-GROUP
A Study on L-Fuzzy Normal Subl-GROUPA Study on L-Fuzzy Normal Subl-GROUP
A Study on L-Fuzzy Normal Subl-GROUPmathsjournal
 
An Application of Assignment Problem in Laptop Selection Problem Using MATLAB
An Application of Assignment Problem in Laptop Selection Problem Using MATLABAn Application of Assignment Problem in Laptop Selection Problem Using MATLAB
An Application of Assignment Problem in Laptop Selection Problem Using MATLABmathsjournal
 
ON β-Normal Spaces
ON β-Normal SpacesON β-Normal Spaces
ON β-Normal Spacesmathsjournal
 
Cubic Response Surface Designs Using Bibd in Four Dimensions
Cubic Response Surface Designs Using Bibd in Four DimensionsCubic Response Surface Designs Using Bibd in Four Dimensions
Cubic Response Surface Designs Using Bibd in Four Dimensionsmathsjournal
 
Quantum Variation about Geodesics
Quantum Variation about GeodesicsQuantum Variation about Geodesics
Quantum Variation about Geodesicsmathsjournal
 
Approximate Analytical Solution of Non-Linear Boussinesq Equation for the Uns...
Approximate Analytical Solution of Non-Linear Boussinesq Equation for the Uns...Approximate Analytical Solution of Non-Linear Boussinesq Equation for the Uns...
Approximate Analytical Solution of Non-Linear Boussinesq Equation for the Uns...mathsjournal
 
Common Fixed Point Theorems in Compatible Mappings of Type (P*) of Generalize...
Common Fixed Point Theorems in Compatible Mappings of Type (P*) of Generalize...Common Fixed Point Theorems in Compatible Mappings of Type (P*) of Generalize...
Common Fixed Point Theorems in Compatible Mappings of Type (P*) of Generalize...mathsjournal
 
Table of Contents - September 2022, Volume 9, Number 2/3
Table of Contents - September 2022, Volume 9, Number 2/3Table of Contents - September 2022, Volume 9, Number 2/3
Table of Contents - September 2022, Volume 9, Number 2/3mathsjournal
 
Code of the multidimensional fractional pseudo-Newton method using recursive ...
Code of the multidimensional fractional pseudo-Newton method using recursive ...Code of the multidimensional fractional pseudo-Newton method using recursive ...
Code of the multidimensional fractional pseudo-Newton method using recursive ...mathsjournal
 

More from mathsjournal (20)

OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...
 
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
 
A Positive Integer 𝑵 Such That 𝒑𝒏 + 𝒑𝒏+𝟑 ~ 𝒑𝒏+𝟏 + 𝒑𝒏+𝟐 For All 𝒏 ≥ 𝑵
A Positive Integer 𝑵 Such That 𝒑𝒏 + 𝒑𝒏+𝟑 ~ 𝒑𝒏+𝟏 + 𝒑𝒏+𝟐 For All 𝒏 ≥ 𝑵A Positive Integer 𝑵 Such That 𝒑𝒏 + 𝒑𝒏+𝟑 ~ 𝒑𝒏+𝟏 + 𝒑𝒏+𝟐 For All 𝒏 ≥ 𝑵
A Positive Integer 𝑵 Such That 𝒑𝒏 + 𝒑𝒏+𝟑 ~ 𝒑𝒏+𝟏 + 𝒑𝒏+𝟐 For All 𝒏 ≥ 𝑵
 
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
 
Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...
Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...
Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...
 
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...
 
The Impact of Allee Effect on a Predator-Prey Model with Holling Type II Func...
The Impact of Allee Effect on a Predator-Prey Model with Holling Type II Func...The Impact of Allee Effect on a Predator-Prey Model with Holling Type II Func...
The Impact of Allee Effect on a Predator-Prey Model with Holling Type II Func...
 
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
 
Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...
Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...
Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...
 
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...
 
Modified Alpha-Rooting Color Image Enhancement Method on the Two Side 2-D Qua...
Modified Alpha-Rooting Color Image Enhancement Method on the Two Side 2-D Qua...Modified Alpha-Rooting Color Image Enhancement Method on the Two Side 2-D Qua...
Modified Alpha-Rooting Color Image Enhancement Method on the Two Side 2-D Qua...
 
A Study on L-Fuzzy Normal Subl-GROUP
A Study on L-Fuzzy Normal Subl-GROUPA Study on L-Fuzzy Normal Subl-GROUP
A Study on L-Fuzzy Normal Subl-GROUP
 
An Application of Assignment Problem in Laptop Selection Problem Using MATLAB
An Application of Assignment Problem in Laptop Selection Problem Using MATLABAn Application of Assignment Problem in Laptop Selection Problem Using MATLAB
An Application of Assignment Problem in Laptop Selection Problem Using MATLAB
 
ON β-Normal Spaces
ON β-Normal SpacesON β-Normal Spaces
ON β-Normal Spaces
 
Cubic Response Surface Designs Using Bibd in Four Dimensions
Cubic Response Surface Designs Using Bibd in Four DimensionsCubic Response Surface Designs Using Bibd in Four Dimensions
Cubic Response Surface Designs Using Bibd in Four Dimensions
 
Quantum Variation about Geodesics
Quantum Variation about GeodesicsQuantum Variation about Geodesics
Quantum Variation about Geodesics
 
Approximate Analytical Solution of Non-Linear Boussinesq Equation for the Uns...
Approximate Analytical Solution of Non-Linear Boussinesq Equation for the Uns...Approximate Analytical Solution of Non-Linear Boussinesq Equation for the Uns...
Approximate Analytical Solution of Non-Linear Boussinesq Equation for the Uns...
 
Common Fixed Point Theorems in Compatible Mappings of Type (P*) of Generalize...
Common Fixed Point Theorems in Compatible Mappings of Type (P*) of Generalize...Common Fixed Point Theorems in Compatible Mappings of Type (P*) of Generalize...
Common Fixed Point Theorems in Compatible Mappings of Type (P*) of Generalize...
 
Table of Contents - September 2022, Volume 9, Number 2/3
Table of Contents - September 2022, Volume 9, Number 2/3Table of Contents - September 2022, Volume 9, Number 2/3
Table of Contents - September 2022, Volume 9, Number 2/3
 
Code of the multidimensional fractional pseudo-Newton method using recursive ...
Code of the multidimensional fractional pseudo-Newton method using recursive ...Code of the multidimensional fractional pseudo-Newton method using recursive ...
Code of the multidimensional fractional pseudo-Newton method using recursive ...
 

Recently uploaded

IMPLICATIONS OF THE ABOVE HOLISTIC UNDERSTANDING OF HARMONY ON PROFESSIONAL E...
IMPLICATIONS OF THE ABOVE HOLISTIC UNDERSTANDING OF HARMONY ON PROFESSIONAL E...IMPLICATIONS OF THE ABOVE HOLISTIC UNDERSTANDING OF HARMONY ON PROFESSIONAL E...
IMPLICATIONS OF THE ABOVE HOLISTIC UNDERSTANDING OF HARMONY ON PROFESSIONAL E...RajaP95
 
Introduction and different types of Ethernet.pptx
Introduction and different types of Ethernet.pptxIntroduction and different types of Ethernet.pptx
Introduction and different types of Ethernet.pptxupamatechverse
 
MANUFACTURING PROCESS-II UNIT-5 NC MACHINE TOOLS
MANUFACTURING PROCESS-II UNIT-5 NC MACHINE TOOLSMANUFACTURING PROCESS-II UNIT-5 NC MACHINE TOOLS
MANUFACTURING PROCESS-II UNIT-5 NC MACHINE TOOLSSIVASHANKAR N
 
Microscopic Analysis of Ceramic Materials.pptx
Microscopic Analysis of Ceramic Materials.pptxMicroscopic Analysis of Ceramic Materials.pptx
Microscopic Analysis of Ceramic Materials.pptxpurnimasatapathy1234
 
247267395-1-Symmetric-and-distributed-shared-memory-architectures-ppt (1).ppt
247267395-1-Symmetric-and-distributed-shared-memory-architectures-ppt (1).ppt247267395-1-Symmetric-and-distributed-shared-memory-architectures-ppt (1).ppt
247267395-1-Symmetric-and-distributed-shared-memory-architectures-ppt (1).pptssuser5c9d4b1
 
Extrusion Processes and Their Limitations
Extrusion Processes and Their LimitationsExtrusion Processes and Their Limitations
Extrusion Processes and Their Limitations120cr0395
 
UNIT-V FMM.HYDRAULIC TURBINE - Construction and working
UNIT-V FMM.HYDRAULIC TURBINE - Construction and workingUNIT-V FMM.HYDRAULIC TURBINE - Construction and working
UNIT-V FMM.HYDRAULIC TURBINE - Construction and workingrknatarajan
 
The Most Attractive Pune Call Girls Budhwar Peth 8250192130 Will You Miss Thi...
The Most Attractive Pune Call Girls Budhwar Peth 8250192130 Will You Miss Thi...The Most Attractive Pune Call Girls Budhwar Peth 8250192130 Will You Miss Thi...
The Most Attractive Pune Call Girls Budhwar Peth 8250192130 Will You Miss Thi...ranjana rawat
 
HARDNESS, FRACTURE TOUGHNESS AND STRENGTH OF CERAMICS
HARDNESS, FRACTURE TOUGHNESS AND STRENGTH OF CERAMICSHARDNESS, FRACTURE TOUGHNESS AND STRENGTH OF CERAMICS
HARDNESS, FRACTURE TOUGHNESS AND STRENGTH OF CERAMICSRajkumarAkumalla
 
Processing & Properties of Floor and Wall Tiles.pptx
Processing & Properties of Floor and Wall Tiles.pptxProcessing & Properties of Floor and Wall Tiles.pptx
Processing & Properties of Floor and Wall Tiles.pptxpranjaldaimarysona
 
Model Call Girl in Narela Delhi reach out to us at 🔝8264348440🔝
Model Call Girl in Narela Delhi reach out to us at 🔝8264348440🔝Model Call Girl in Narela Delhi reach out to us at 🔝8264348440🔝
Model Call Girl in Narela Delhi reach out to us at 🔝8264348440🔝soniya singh
 
Introduction to Multiple Access Protocol.pptx
Introduction to Multiple Access Protocol.pptxIntroduction to Multiple Access Protocol.pptx
Introduction to Multiple Access Protocol.pptxupamatechverse
 
Call Girls Service Nashik Vaishnavi 7001305949 Independent Escort Service Nashik
Call Girls Service Nashik Vaishnavi 7001305949 Independent Escort Service NashikCall Girls Service Nashik Vaishnavi 7001305949 Independent Escort Service Nashik
Call Girls Service Nashik Vaishnavi 7001305949 Independent Escort Service NashikCall Girls in Nagpur High Profile
 
HARMONY IN THE NATURE AND EXISTENCE - Unit-IV
HARMONY IN THE NATURE AND EXISTENCE - Unit-IVHARMONY IN THE NATURE AND EXISTENCE - Unit-IV
HARMONY IN THE NATURE AND EXISTENCE - Unit-IVRajaP95
 
High Profile Call Girls Nagpur Isha Call 7001035870 Meet With Nagpur Escorts
High Profile Call Girls Nagpur Isha Call 7001035870 Meet With Nagpur EscortsHigh Profile Call Girls Nagpur Isha Call 7001035870 Meet With Nagpur Escorts
High Profile Call Girls Nagpur Isha Call 7001035870 Meet With Nagpur Escortsranjana rawat
 
VIP Call Girls Service Kondapur Hyderabad Call +91-8250192130
VIP Call Girls Service Kondapur Hyderabad Call +91-8250192130VIP Call Girls Service Kondapur Hyderabad Call +91-8250192130
VIP Call Girls Service Kondapur Hyderabad Call +91-8250192130Suhani Kapoor
 
VIP Call Girls Service Hitech City Hyderabad Call +91-8250192130
VIP Call Girls Service Hitech City Hyderabad Call +91-8250192130VIP Call Girls Service Hitech City Hyderabad Call +91-8250192130
VIP Call Girls Service Hitech City Hyderabad Call +91-8250192130Suhani Kapoor
 
Decoding Kotlin - Your guide to solving the mysterious in Kotlin.pptx
Decoding Kotlin - Your guide to solving the mysterious in Kotlin.pptxDecoding Kotlin - Your guide to solving the mysterious in Kotlin.pptx
Decoding Kotlin - Your guide to solving the mysterious in Kotlin.pptxJoão Esperancinha
 
Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...
Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...
Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...Christo Ananth
 

Recently uploaded (20)

IMPLICATIONS OF THE ABOVE HOLISTIC UNDERSTANDING OF HARMONY ON PROFESSIONAL E...
IMPLICATIONS OF THE ABOVE HOLISTIC UNDERSTANDING OF HARMONY ON PROFESSIONAL E...IMPLICATIONS OF THE ABOVE HOLISTIC UNDERSTANDING OF HARMONY ON PROFESSIONAL E...
IMPLICATIONS OF THE ABOVE HOLISTIC UNDERSTANDING OF HARMONY ON PROFESSIONAL E...
 
Introduction and different types of Ethernet.pptx
Introduction and different types of Ethernet.pptxIntroduction and different types of Ethernet.pptx
Introduction and different types of Ethernet.pptx
 
MANUFACTURING PROCESS-II UNIT-5 NC MACHINE TOOLS
MANUFACTURING PROCESS-II UNIT-5 NC MACHINE TOOLSMANUFACTURING PROCESS-II UNIT-5 NC MACHINE TOOLS
MANUFACTURING PROCESS-II UNIT-5 NC MACHINE TOOLS
 
Microscopic Analysis of Ceramic Materials.pptx
Microscopic Analysis of Ceramic Materials.pptxMicroscopic Analysis of Ceramic Materials.pptx
Microscopic Analysis of Ceramic Materials.pptx
 
247267395-1-Symmetric-and-distributed-shared-memory-architectures-ppt (1).ppt
247267395-1-Symmetric-and-distributed-shared-memory-architectures-ppt (1).ppt247267395-1-Symmetric-and-distributed-shared-memory-architectures-ppt (1).ppt
247267395-1-Symmetric-and-distributed-shared-memory-architectures-ppt (1).ppt
 
Extrusion Processes and Their Limitations
Extrusion Processes and Their LimitationsExtrusion Processes and Their Limitations
Extrusion Processes and Their Limitations
 
UNIT-V FMM.HYDRAULIC TURBINE - Construction and working
UNIT-V FMM.HYDRAULIC TURBINE - Construction and workingUNIT-V FMM.HYDRAULIC TURBINE - Construction and working
UNIT-V FMM.HYDRAULIC TURBINE - Construction and working
 
The Most Attractive Pune Call Girls Budhwar Peth 8250192130 Will You Miss Thi...
The Most Attractive Pune Call Girls Budhwar Peth 8250192130 Will You Miss Thi...The Most Attractive Pune Call Girls Budhwar Peth 8250192130 Will You Miss Thi...
The Most Attractive Pune Call Girls Budhwar Peth 8250192130 Will You Miss Thi...
 
HARDNESS, FRACTURE TOUGHNESS AND STRENGTH OF CERAMICS
HARDNESS, FRACTURE TOUGHNESS AND STRENGTH OF CERAMICSHARDNESS, FRACTURE TOUGHNESS AND STRENGTH OF CERAMICS
HARDNESS, FRACTURE TOUGHNESS AND STRENGTH OF CERAMICS
 
Processing & Properties of Floor and Wall Tiles.pptx
Processing & Properties of Floor and Wall Tiles.pptxProcessing & Properties of Floor and Wall Tiles.pptx
Processing & Properties of Floor and Wall Tiles.pptx
 
Model Call Girl in Narela Delhi reach out to us at 🔝8264348440🔝
Model Call Girl in Narela Delhi reach out to us at 🔝8264348440🔝Model Call Girl in Narela Delhi reach out to us at 🔝8264348440🔝
Model Call Girl in Narela Delhi reach out to us at 🔝8264348440🔝
 
Introduction to Multiple Access Protocol.pptx
Introduction to Multiple Access Protocol.pptxIntroduction to Multiple Access Protocol.pptx
Introduction to Multiple Access Protocol.pptx
 
Call Girls Service Nashik Vaishnavi 7001305949 Independent Escort Service Nashik
Call Girls Service Nashik Vaishnavi 7001305949 Independent Escort Service NashikCall Girls Service Nashik Vaishnavi 7001305949 Independent Escort Service Nashik
Call Girls Service Nashik Vaishnavi 7001305949 Independent Escort Service Nashik
 
HARMONY IN THE NATURE AND EXISTENCE - Unit-IV
HARMONY IN THE NATURE AND EXISTENCE - Unit-IVHARMONY IN THE NATURE AND EXISTENCE - Unit-IV
HARMONY IN THE NATURE AND EXISTENCE - Unit-IV
 
High Profile Call Girls Nagpur Isha Call 7001035870 Meet With Nagpur Escorts
High Profile Call Girls Nagpur Isha Call 7001035870 Meet With Nagpur EscortsHigh Profile Call Girls Nagpur Isha Call 7001035870 Meet With Nagpur Escorts
High Profile Call Girls Nagpur Isha Call 7001035870 Meet With Nagpur Escorts
 
DJARUM4D - SLOT GACOR ONLINE | SLOT DEMO ONLINE
DJARUM4D - SLOT GACOR ONLINE | SLOT DEMO ONLINEDJARUM4D - SLOT GACOR ONLINE | SLOT DEMO ONLINE
DJARUM4D - SLOT GACOR ONLINE | SLOT DEMO ONLINE
 
VIP Call Girls Service Kondapur Hyderabad Call +91-8250192130
VIP Call Girls Service Kondapur Hyderabad Call +91-8250192130VIP Call Girls Service Kondapur Hyderabad Call +91-8250192130
VIP Call Girls Service Kondapur Hyderabad Call +91-8250192130
 
VIP Call Girls Service Hitech City Hyderabad Call +91-8250192130
VIP Call Girls Service Hitech City Hyderabad Call +91-8250192130VIP Call Girls Service Hitech City Hyderabad Call +91-8250192130
VIP Call Girls Service Hitech City Hyderabad Call +91-8250192130
 
Decoding Kotlin - Your guide to solving the mysterious in Kotlin.pptx
Decoding Kotlin - Your guide to solving the mysterious in Kotlin.pptxDecoding Kotlin - Your guide to solving the mysterious in Kotlin.pptx
Decoding Kotlin - Your guide to solving the mysterious in Kotlin.pptx
 
Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...
Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...
Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...
 

THE WEAK SOLUTION OF BLACK-SCHOLE’S OPTION PRICING MODEL WITH TRANSACTION COST

  • 1. Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 1, No. 1, May 2014 43 THE WEAK SOLUTION OF BLACK-SCHOLE’S OPTION PRICING MODEL WITH TRANSACTION COST Bright O. Osu and Chidinma Olunkwa Department of Mathematics, Abia State University, Uturu, Nigeria ABSTRACT This paper considers the equation of the type − + + = , ( , ) ∈ ℝ × (0, ); which is the Black-Scholes option pricing model that includes the presence of transaction cost. The existence, uniqueness and continuous dependence of the weak solution of the Black-Scholes model with transaction cost are established.The continuity of weak solution of the parameters was discussed and similar solution as in literature obtained. KEYWORDS Black-Scholes Model, Option pricing, Transaction costs, Weak solution,Sobolev space 1. INTRODUCTION Options are financial instrument that convey the right but not the obligation to engage in a future transaction on the underlying assets.In a complete financial market without transaction costs, the celebrated Black-Sholes no-arbitrage argument provide not only a rational option pricing formula but also a hedging portfolio that replicate the contingent claim [8] .However the Black-Scholes hedging portfoliorequires trading at all-time instants and the total turnover of stock in the time interval [0, ] is infinite. Accordingly, when transaction cost directly proportional to trading is incorporated in the Black –Scholes model the resulting hedging portfolio is quite expensive. The condition under which hedging can take place has to be relaxed such that the portfolio only dominate rather than replicate the value of the European call option at maturity .The first model in that direction was presented in [4] . Here it was assumed that the portfolio is rebalanced at a discrete time and that the transaction cost in buying and selling the asset are proportional to the monetary value of the transaction. At a price S and a constant K depending on an individual’s aversion to risk, the transaction costs are ∕ ∕ ∕, where N is the number of shares bought ( > 0) or sold ( < 0). In [7], the existence, uniqueness and continuity of the Black –Scholes model was discussed. Also in [6], option pricing with transaction costs that leads to a nonlinear equation was investigated.In a related paper [1],the discretetime, dominating policies was presented. In [3] further work on this in the presence of transaction cost was presented...By applying the theorem of central limit, they show that as the time step ∆ and transaction cost ∅ tend to zero. The price of discrete option converged to a Black –Sholes price with adjusted volatility (. ). Here ∆ represent the mean time length for a change in the value of the stock instead of transaction frequency. Here our adjusted volatility is given by; = (1 − ( ). (1.1)
  • 2. Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 1, No. 1, May 2014 44 If = ( ), = − ∅ √ then we have the adjusted volatility as in[7], where is the time lag between consecutive transaction. Let ( , ) be the value of the option and be the value of the hedge portfolio. We assumeinstead that the value of the underlying follows the random work = + ∅ with∅ drowned from a normal distribution, is a measure of the average rate of growth of the asset price also known as the drift where = − and is a measure of the diffusion coefficient . Then the change in the value of the portfolio over the time step is given by (using (1.1)) ∆ = − ∆ ∅ + ∅ (1 − ( )) + ( − ) + − ∆ − / / . Making a digression and investigating the nature of the number of assets bought or sold given that we posit the number of asset (the delta of our option) as = . Conventionally, thedelta of an option is represented by ∆ . Given that is evaluated at the asset value s and time ,we have = ( , ). Rehedging after finite time ∆ leads to a change in the value of assets as below = ( + ∆ , + ∆ ). This of course evaluated at the new asset price and time .therefore the number of assets to be traded after ∆ is given by = ( + ∆ , + ∆ ) − ( , ) ≈ ∅ . Hence the expected transaction cost over a time step is [ / / ] = [| |] = ∅ = [|∅|] , Where |∅| = . The expected change in the value of the portfolio is
  • 3. Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 1, No. 1, May 2014 45 (∆ ) = ( + ( , , ) − ) If the holder of the option expects to make as much from his portfolio as from a bank account at a riskless interest rate (no arbitrage), then (∆ ) = − . Hence following[9] for option pricing with transaction costs is given by + ( , , ) + − − = 0, ( , ) ∈ (0, ∞) × (0, ), (1.2) and the final condition ( , ) = max( − , 0) , ∈ (0, ∞), for European call option with strike price E. Note that equation (1.2) contents the usual Black-Scholes terms with additional nonlinear term modeling the presence of transaction costs. Setting = log , = − 1 2 , = ( , ), equation (1.2) becomes − + + ( − 1) − = , ( , ) ∈ (0, ∗), (1.3) with initial condition ( , 0) = max( − 1,0) , ∈ ℝ, Where = ( 2⁄ )⁄ , = 8 ( )⁄ ∗ = 2⁄ . Set = ( , ) = ( , ). Then (1.3)gives − + + ( + 1) = + , ( , ) ∈ ℝ × (0, ), (1.4) With the initial condition ( , 0) = (1 − , 0) Let = + 1
  • 4. Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 1, No. 1, May 2014 46 The previous discussion motivates us to consider the following problem that includes cost structures that go beyond proportional transaction costs. − + + = , ( , ) ∈ ℝ × (0, ), (1.5) and ( , 0) = ( ), ∈ ℝ. (1.6) In this paper we looked into parameters that are governing the Black-Scholes option pricing model with the present of transaction costs such that equation (1.5) exhibits the desired behaviour. More precisely, let = = , ∈ [ , ] × , , where > 0 > 0. Defined a functional ( ) by ( ) = ‖ ( , ) − ‖ ( , ; ), (1.7) where the dalta can be thought of as the desired value of ( ; ). The parameter identification problem for (1.5) with the objective function (1.7) is to find ∗ = ∗ , ∗ ∈ Satisfying ( ∗) = ∈ ( ). (1.8) Let → ( ) from, in to ([0, ]; be the solution map . In what follows, the existence and uniqueness of the weak solution of (1.5) is established in the next section. Continuity of the solution with respect to data is established in section 3. 2. EXISTENCE AND UNIQUENESS OF WEAK SOLUTION Since the type of equation in (1.5) do not belong to (ℛ) we introduce weighted lebessgue and sobolev spaces (ℛ)and (ℛ) for > 0 as follows. (ℛ) = ∈ (ℛ): | | ∈ (ℛ) (2.1) H (ℛ) = ∈ (ℛ): | | ∈ (ℛ), | | ∈ (ℛ) .(2.2)
  • 5. Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 1, No. 1, May 2014 47 The respective inner products and norms are defined by ( , ) (ℛ) = ∫ℛ | | (2.3) ( , ) (ℛ) = ∫ℛ | | + ∫ℛ | | (2.4) ‖ ‖ (ℛ) = ∫ℛ | | | | (2.5) ‖ ‖ (ℛ) = ∫ℛ | | | | + ∫ℛ | | | | (2.6) We define the dual space of H (ℛ) as (ℛ) ∗ = : (ℛ) → ℛ (2.7) The duality pairing between (ℛ) and (ℛ) ∗ is given by 〈 , 〉 = ∫ℛ | | | | (2.8) In what follows, we state, LEMMA1: Let = (ℛ).For ∅ ∈ , ∅ = (−1,1), ∫ ∅ ( ) = 1, ∅ =ℛ ∅ , then ∅ ∗ → (ℛ). (2.9) PROOF: Suppose = | | , then we have (∅ ∗ ). = ∅ ∗ ( . ) + (∅ ∗ ). − ∅ ∗ ( . ) . (2.10) since . ∈ ∅ ∗ ( . ) it suffices to show that ‖ ‖ = (‖(∅ ∗ ). − ∅ ∗ ( . )‖) → 0 → 0 (2.11) The fundamental theory of calculus for give ( ) = ∫ℛ∅ ( − ) ( )( ( ) − ( )) (2.12) using
  • 6. Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 1, No. 1, May 2014 48 ∅ = (− , ) We get | ( )| ≤ ∫ℛ |∅ ( − )|| ( )|(2 | ( )|) = ∫ℛ |∅ ( − )|| ( )|(2 | ( + )|) = ( )(2.13) Since ( ) = uniformly and | ( )| ≤ 2 | ( )|, thus ‖ ( )‖ → 0 as → 0 LEMMA 2: (ℛ)the space of test function in ℛ,is densein H (ℛ). PROOF .Let ∈ (ℛ) Φ ∈ such that ( ) = 1, | | ≤ 1 0, | | ≥ 2 Now we show that = . (. ) ∗ ∈ where = , → in (ℛ).ie → ∇ → (ℛ) (2.14) = . ( (. )) ∗ + . (. ) ∗ (2.15) It suffices to show . ( (. )) ∗ → (ℛ) (2.16) By the lebesgue Dominated convergence Theorem ,we get . ( (. )) → (ℛ)(2.17) Hence Lemma 1 concludes the proof. Since (ℛ) is dense in (ℛ) (ℛ) , the following lemma follows immediately.
  • 7. Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 1, No. 1, May 2014 49 LEMMA 3: (ℛ) ⊂ (ℛ) ⊂ (ℛ) ∗ , from Gelfand triple. Note. Since (ℛ) is dense in (ℛ),the definition of 〈. , . 〉 allows us to interprete the operator as a mapping from → ∗ . for our simplicity,we use = (ℛ), ∗ = (ℛ) ∗ and = (ℛ) To use the variational formulation let us defined the following bilinear form on × ( , )( , ) = ∫ℛ | | + ∫ℛ | | − − ∫ℛ | | (2.18) for > 0 > 0 , One can show ( , )( , ) is bounded and coercive in .Define linear operator ( ≡, ): ( , ) = : ∈ , ( , ) ∈ ∗ into ∗ by ( , )( , ) = ( , ), , for all ∈ ( , ) for all ∈ . DEFINATION 4.Let X be a Banach space and , ∈ with < , 1 ≤ < ∞.Then (0, ; ) and (0, ; )denote the space of measurable functions defined on ( , ) with values in such that the function → ‖ (. , )‖ is square integrable and essentially bounded. The respective norms are defined by ‖ ‖ ( , ; ) = ∫ ‖ (. , )‖ (2.19) ‖ ‖ ( , ; ) = . ‖ (. , )‖ . (2.20) For details on these function space ,see [10] Definition 5.A function : [0, ] → is a weak solution of (1.5) if (i) ∈ (0, ; )and ∈ (0, ; ∗); (ii) For every ∈ , 〈 ( ), 〉 + ( , )( ( ), ) = 0 ,for t pointwise a.e.in [0, ]; (0) = .
  • 8. Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 1, No. 1, May 2014 50 Note .The time derivative understood in the distribution sense.The following two lemmas are of critical importance for the existence and uniqueness of the weak solutions. LEMMA 6.Let ↪ ↪ ∗ ∈ (0, ; ) , ∈ (0, ; ∗) ,then ∈ ([0, ]; ). Moreover, for any ∈ ,the real –valued function → ‖ ( )‖ is weakly differentiable in (0, ) and satisfies {‖ ‖ } = 〈 , 〉 (2.21) LEMMA 7. (Gronwall’s Lemma) Let ( ) be a nonnegative,summable function on [0, ] which satisfies the integral inequality ( ) ≤ ∫ ( ) + (2.22) for constant ≥ 0 almost everywhere ∈ [0. ].Then ( ) ≤ (1 + )a.e on 0 ≤ ≤ ( 2.23). in particular, if ( ) ≤ ∫ ( ) a.e on 0 ≤ ≤ ,then ( ) = 0 . on [0, ] (2.24) FOR PROOF SEE [6]. LEMMA 8.The weak solution of (1.5) is unique if it exists. Proof. Let and be two weak solution of (1.5). Let = − .To prove Lemma 8 .suffices to show that = 0 pointwise a.e.on [0, ].since 〈 ( ), 〉 + ( , )( ( ), ) = 0 for any ∈ ,we take = ∈ to get 〈 ( ), 〉 + ( , )( ( ), ) = 0 (2.25) (2.25) is true point wisea.s .on [0, ].Using (2.1) and the coercivity estimate,we have 1 2 ‖ ‖ ≤ ‖ ‖ , (0) = 0 For some > 0.By Lemma 7, ‖ ‖ = 0 for all ∈ [0, ].Thus = 0 pointwise a.e in [0, ]. To show existence of the weak solution of (1.5) .we first show existence and uniqueness of approximation solution. Now we define the approximate solution of (1.5) DEFINITION9.A function : [0, ] → is an approximate solutions of (1.5) if (i) ∈ (0, , )and ) ∈ (0, , );
  • 9. Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 1, No. 1, May 2014 51 (ii) for every ∈ and 〈 ( ), 〉 + ( , )( ( ), ) = 0 pointwise a.e in [ , ] (iii) (0) = To prove the existence of approximate solution ,we take = in 〈 ( ), 〉 + ( , )( ( ), ) = 0 to get following system of ODEs + ∑ = 0 , (0) = (2.26) Where ∈ , ∈ ,for0 ≤ ≤ , ( ) = , ,and = , for : [0, ] → ℛ , equation 2.24 can be written as ⃗ + ( ) ⃗ = 0 , ⃗ (0) = ⃗ (2.27) Since ∈ (0, ; ℛ × ,for ⃗ = ⃗ . 2.25can be written as ⃗ ( ) = ⃗ − ∫ ( ) ⃗ ( ) (2.28) The following lemma is immediate from contraction mapping theorem and (2.28) LEMMA 10: For any ∈ ,there a unique approximate solution : [0, ] → of (2.28). The following theorem provide the energy estimate for approximate solutions. Theorem11.There exist a constant depending only on Ω such that the approximate solution satisfies ‖ ‖ ( , ; ) + ‖ ‖ ( , ; ) + ( , ; ) ≤ ‖ ‖ (2.29) Proof: For every ∈ we have 〈 ( ), 〉 + ( , )( ( ), ) = 0. take ∈ ( ),then we have 〈 ( ), 〉 + ( , )( ( ), ) = 0.,pointwisea.e in (0, ) (2.30) using 2.30 and the coercivity estimate.We find that there exists constants > 0, > 0 such that ( ‖ ‖ ) + ‖ ‖ ≤ 0 (2.31)
  • 10. Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 1, No. 1, May 2014 52 Integrating 2.31 with respect to t,using the initial condition (0) = ( ), ( 2.39). and ‖ ( )‖ ≤ ‖ ‖ , we get ( ‖ ‖ ) + ‖ ‖ (2.32) taking the supriemum over [0, ],we get ‖ ‖ ( , ; ) + ‖ ‖ ( , ; ) ≤ ‖ ‖ (2.33) Since ( ) ∈ ∗ , we have ( ) ∗ = sup ∈ ∗ ( ), ‖ ‖ , ≠ 0 (2.34) Using the notion of approximate solution and boundedness of A we have ‖ ‖ ( , ; ) + ‖ ‖ ( , ; ) + ( , ; ) ≤ ‖ ‖ (2.35) To complete the proof of weak solution, we now show the convergence of the approximate solutions by using weak compactness argument. DEFINITION 12: Let (0, ; ∗) be the dual space of (0, ; ).Let ∈ (0, ; ∗) and ∈ (0, ; ),then we say → (0, ; ) weakly if ∫ 〈 ( ), ( )〉 → ∫ 〈 ( ), ( )〉 ∀ ∈ (0, ; ∗) (2.36) Lemma 13 .A subsequence { } of approximate solutions converge weakly in (0, ; ∗) to a weak solution ∈ ([0, ]; ) ∩ (0, ; )of (1.5) with ∈ (0, ; ∗).Moreover,it satisfies ‖ ‖ ( , ; ) + ‖ ‖ ( , ; ) + ‖ ‖ ( , ; ) ≤ ‖ ‖ (2.37) PROOF.Theorem 11 implies that the approximate solutions { } are bounded in (0, ; ) and their derivatives are bounded in (0, ; ∗). By the Banach-Alaoglu theorem, we can extract a subsequence { } such that → (0, ; ), → (0, ; ∗)weakly(2.38) Let ∅ ∈ (0,T) be a real-valued test function and ∈ for some = .Replacing by ( ) 〈 ( ), 〉 + ( , )( ( ), ) = 0 and integrating from 0 toT, we get. ∫ 〈 ( ), ( ) 〉 + ∫ ( , )( ( ), ( ) ) = 0 ≥ 2.38
  • 11. Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 1, No. 1, May 2014 53 taking the limit as → ∞,we get ∫ ( ), = ∫ 〈 , ∅ 〉 (2.39) by using boundedness of ( , ),we get ∫ ( , )( ( ), ( ) ) = ∫ ( , )( ( ), ∅( ) ) (2.40) using boundedness of ( , ),we get 〈 ( ), 〉 + ( , )( , ) = 0 (2.41) pointwise a.e in (0, ) since 2.41 is true for all ∈ ∈ and( 2.42) is dense in V,so (2.42) holds for all ∈ . now it remains to show that (0) = .using (2.42),integrating by parts and Galerkin approximation we have 〈 (0), 〉 = 〈 , 〉 → ∞ for every ∈ .Thus (0) = 3 EXISTENCEOF OPTIMALPARAMETER Lemma 14 .Let ∈ .Then the mapping , → , from = = , ∈ [ , ] × , into is continuous. Proof .Suppose that → in ℛ as → ∞.We denote = , and = , .We claim that ‖( − ) ‖ → 0 as → ∞. Let ∈ with‖ ‖ ≤ 1.Then |〈( − ) , 〉| ≤ (| − || || | ) ℛ + − | || | ℛ + − | || | ℛ + (| − || || | ) ℛ ≤ 2| − | | |( ) ℛ + − | |( ) ℛ + − | |( ) ℛ → 0 → ∞ Lemma 15.Suppose that , → , in ℛ , and → weakly in V as → ∞.Then → weakly in .
  • 12. Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 1, No. 1, May 2014 54 Proof.Let ∈ ,then. 〈 , , 〉 − 〈 , 〉 = 〈 , ,〉 − 〈 〉 ≤ |〈 − 〉 , | + |〈 , − 〉| (2.43) Since a weakly convergent sequence is bounded, we have |〈 − 〉 , | ≤ ‖ − ‖ ‖ ‖ ≤ ‖ − ‖ → 0 as → ∞ Lemma 14.The second term 〈 , , − 〉 → 0 since → weakly. Lemma16.Let ∈ . Then the solution map → ( ) from into ([0, ]; ) is continuous. Proof.Let → in as → ∞.Since ( ; ) is the weak solution of (1.5) for any ∈ we have the following estimate. ‖ ( ; )‖ ( , ; ) + ‖ ( ; ), ‖ ( , ; ) + ( ; ) ( , ; ) ≤ ‖ ‖ (2.44) Where C is constant independent of ∈ . Estimate (2.44) shows that ( ; ) is bounded in (0, ).Since (0, ) is reflexive.we can choose a sub-sequence ( ; ) weakly convergent to a function in (0, ).The fact that ( ; ) is bounded in (0, ) implies that ( , ) is bounded in (0, ; ),so ( ; )weakly convergent to a function in (0, ; ).Since is compactly imbedded in ,then by the classical compactness theorem[4] ( ; ) → in (0, ; ),.By (2,44) the derivative ( ; ) and are uniformly bounded in (0, ; ).Therefore functions ; , are equicontinuous in ([0, ]; )..Thus ( ; ) → in ([0, ]; ) …In particular ( ; ) → ( ) in H and ( ; ) → weakly in V for any ∈ [0, ].By lemma 15, ] ( ; ) → ( ) weakly in .Now we see that z satisfies the equation given in definition 5,ie it is the weak solution ( ) The uniqueness of the weak solution implies that ( ) → ( ) → ∞ in ([0, ]; ) for the entire sequence ( ) and not for its subsequence. Thus that ( ; ) → ( ) in ([0, ]; ) as that → in as claimed. 3. CONCLUSIONS The Black-Scholes option pricing model with transaction cost was discussed, where we use an adjusted volatility given as = (1 − ( ) and a continuous random work which generalizes the works in the literature.The parameters associated with the Black –Scholes option pricing model with transaction cost was considered. Also the existence and uniqueness of weak solution of Black-Scholes option price with transaction cost was studied. The continuity of weak solution of the parameters was discussed and similar solution as in literature obtained. The extra terms introduced in this paper is to directly model asset pricedynamics in the case when the large trader chooses a givenstock-trading strategy.If transaction costs are taken into account perfect replicationof the contingent claim is no longer possible. Hence, one can re-adjust the volatility (when the investor’s preferences are characterized by anexponential utility function)in the form;
  • 13. Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 1, No. 1, May 2014 55 = 1 + − ( − ) ’ and if a the weak solution can be obtained. REFERENCES [1] Delbaen.F.,Schachermayer, W.(1994), Theorem of asset Pricing.Math.AGeneralVersion of the fundamental Annalen,Vol.300,pp.463-520 [2] Evans L.C (1998) ,Partial Differential Equations, Graduate Studies in Mathematics Vol 19,AMS,providence,Rhodes Island [3] FishcerBlack,Myron Scholes (1973).The pricing of option and corporate liabilities ,J.Political Vol 81 pp 637-659 [4] Hayne E.Leland.(1985) Option pricing and replication with transactions cost The journal of finance vol.40,No5,pp1283-1301 [5] Harrison M and Pliska S.(1981),Martingales and Stochastic Integrals in the theory of continuous trading.Stoch,Proc& Appl.Vol.11,pp 215-260. [6] Maria Cristina .Emmanuel Ncheuhuim.IndranilSengupta(2011).Solution to a nonlinear Black- Scholes Equation Vol.2011,N0 158,pp 1-1 [7] Narayan Thapa,JustinZiegler,Carson Moen (2012).Existence of optimal parameter for the Black- Scholes option pricing model.Vol78,No4,pp523-534 [8] Paul Wilmott,JeffDewynne,SamHowison. ,(1993) Option pricing:Mathematical Models and Computation,Oxford Financial Press,Oxforduk [9] Hoggard.T,WhalleyA.E,Wilmott. P (1994)Hedging option portfolios in the presence of Transaction costs ,Adv .Future opt.Res., Vol 7 pp 21 [10] Dautray,.R,Lions J.L ,Mathematical Analysis and Numerical Methods for Science and Technogy,Volume 5,Springer-Verlag.