lecturemania chain, determine the classes of the Markov chain and whether they are recurrent. P= ... 16.5-7." Consider the inventory example introduced in Sec. 16.1,

lecturemaniasuccess ma ximtzer

Z

frfCB.

3,

O* J.

. 5 - - - -

AlpGirayOzen! 053354991 08 | [email protected] | www.lecturemanta.com

lecturemaniasuccess maxmzer

, /) &A/J

S.S. * fe>, £, 2, 33

^ 1-

//»C, - J //

. . ,

AlpGirayOzen| 05335499108 j [email protected] | www.lecturemania.com

iecturemaniasuccess maximizer

/^5 -• ty-/«»2f- ***• Me, «

7, /,*, 3,4 J

7 — 1Xr-1 ***Z

v

&"

ti-

A- .-

/>-• • / s - o / ' e .X

- '**«* v /« -/JAlpGiraydzenl 053354991 08 | alp@lecturemaniaxom | www.lecturemaniaxom

lecturernaniasuccess maximizer

SS=

ffj"A* - - *

PS*,, =2; Xj.

* 2, Xi*t,j

-7= — -

SS-f0,lf 2, , _

AlpGirayOzen | 05335499108 | [email protected] | www.lecturemania.com

lecturemaniasuccess maximizer

16.2-1. Assume that the probability of rain tomorrow is 0£ if it israining today, and assume that the probability of its being clear (norain) tomorrow is 0.9 if it is clear today. Also assume that theseprobabilities do not change if information is also provided aboutthe weather before today.(a) Explain why the stated assumptions imply that the Markovian

property holds for the evolution of the weather.(b) Formulate the evolution of the weather as a Markov chain by

defining its states and giving its (one-step) transition matrix.

16.2-2. Consider the second version of the stock market modelpresented as an example in Sec. 16.2. Whether the stock goes uptomorrow depends upon whether it increased today and yesterday.If the stock increased today and yesterday, it will increase tomor-row with probability a i . If the stock increased today and decreasedyesterday, it will increase tomorrow with probability «2. If the stockdecreased today and increased yesterday, it will increase tomorrow

with probability «3. Finally, if the stock decreased today and yes-terday, it will increase tomorrow with probability «4.(a) Construct the (one-step) transition matrix of the Markov chain.(b) Explain why the states used for this Markov chain cause the

mathematical definition of the Markovian property to hold eventhough what happens in the future (tomorrow) depends uponwhat happened in the past (yesterday) as well as the present(today).

It. 2 -

/-• u sj

y+s-ks-dc^ v«v- iX/

cxx

^J

2-3

C. .

053354991 08 |alp tectur^maniaxom| www.tectu^mania.com


3

^

//I

/

*S? ?/&- &/&QS-A4QL- A6^ *6

f X±

™ ^ <&**^

3

AlpGirayOzenj 05335499108 | [email protected] | www.lecturemania.com


- /

"=2 '- •

J.7-

^r~<9/tf/-o

0*631

OtZttj

. rtfrt

X

^///<^

£>,36f

0,3 * f

0,1 ?£*

— ^-2- 3

0/3 6 f 0, 3 &

& &

£,3£f o0/J6f <2sJ#/

,. ^- e

AlpGirayOzen | 0533 5499108 | alp@lecturemaniaxom | www.lecturemaniaxom


M

At

SS;

O

*9~sty

*

/

^ >»-*#1 -TT i?

--»> /^——?/

, . - _

p

AlpGirayOzenj 05335499108 | [email protected] | www.Iecturemania.com


to =**/>„+/>„/>„

- °4 • 0,3-f

(3)

a

a

&

t

JL

<?

/ -<£>

AlpGirayOzeni 05335499108 | [email protected] j www.lecturemania.com


'>/*)

f

X

16.3-3. A particle moves on a circle through points that have beenmarked 0, 1, 2, 3, 4 (in a clockwise order). The particle starts atpoint 0. At each step it has probability QS of moving one pointclockwise (0 follows 4) and 0£ of moving one point counter-clockwise. Let X,, (n 5: 0) denote its location on the circle afterstep n. [Xn] is a Markov chain,(a) Construct the (one-step) transition matrix.

. / ^ x? 1'&• -* *" -y

/ / -•" /0C.C/ -rr&SL,

yCCt*

^*?

_

^ ? "/O/ ,/y ^-/ J / ^ ?"»

30

0,2-

&

&

0,2-

]0<? O & &

AlpGirayOzenl 05335499108 |alp tectur maniaxom| www.Jecture^aniaxor


<*>?

is,

Alp Giray Ozen | 053354991 08 | [email protected] | www.iecturemania.com


tfC

2 f 3 J

7* J

&(&

.

AIPG,rayOzen| 05335499108

#&&

<@*—xS

3-2 - -^-

lecturemaniasuccess rnaximizer

16.4-3. Given the following (one-step) transition matrix of aMarkov chain, determine the classes of the Markov chain andwhether they are recurrent.

P=

State 0012

3

4

43413

0,0

J3414i

0

0

2

0013

00

3

0003414

4

0"001434-

16.4-4. Determine the period of each of the states in the Markovchain that has the following (one-step) transition matrix. f2)

State

01

234

5

0 1 2 3 4 5

O 0 0 | 0 f0 0 1 0 0 0

1 0 0 0 0 00 | 0 0 I 0

0 0 1 0 0 016-6-

a>/

CD*/*'<*£.£-

0-2 -6-2. - O

M

*^

*f

AlpGirayOzenj 05335499108 | [email protected] | www.lecturemania.


U

T

fa)

C 16.5-4. The leading brewery on the West Coast (labeled /O hashired an OR analyst to analyze its market position. It is particu-larly concerned about its major competitor (labeled 5). The ana-lyst believes that brand switching can be modeled as a Markovchain using three states, with states A and B representing customersdrinking beer produced from the aforementioned breweries andstate C representing all other brands. Data are taken monthly, andthe analyst has constructed the following (one-step) transition ma-trix from past data.

B

0.70.20.1

0.20.750.1

0.10.050.8

What arc the steady-state market shares for the two major breweries?

7% + 6,^ .- * 7T . .Q &J & */£

etna

^ L

' ,%**#*

AlpGiray Ozen | 0533 54991 08 | [email protected] | www.lecturemania.co

<3^T<


=&, 2-5-6

/s

A^^t &*+ ^ */£&</t*»s&&r^&af v^^S

05335499,08


-t

,

16.5-7." Consider the inventory example introduced in Sec. 16.1,but with the following change in the ordering policy. If the num- — ^ 1her of cameras on hand at the end of each week is 0 or 1, two ad- lo • -? " ^~/ditional cameras will be ordered. Otherwise, no ordering will take ^ w / - .. -,place. Assume that the storage costs are the same as given in the & / /) — . Q \ ^ ff &S-f & {jsecond subsection of Sec. 16.5. * * +• "C (a) Find the steady-state probabilities of the state of this Markov ^ ••* £. ? X" &

chdn. *(b) Find the long-run expected average storage cost per week.

a_

2.

3

Alp Giray Ozen | 0533 549 9108 | [email protected] | www.lecturemania,


1

u.

2 ?'

-3 *6s'

AlpGirayOzen] 05335499108 | [email protected] | www.lecturemanta.com

lecturemania chain, determine the classes of the Markov chain and whether they are recurrent. P= ... 16.5-7." Consider the inventory example introduced in Sec. 16.1,

Documents