formulate the optimality equations, Operation Research

Assignment Help:

Each day you own 0 or 1 stocks of certain commodity. The price of the stock is a stochastic process that can be modeled as a Markov chain with transition rates as follows

 

 

day n+1

 

 

 

100

200

day n

100

0.5

0.5

 

200

0.25

0.75

At the start of a day at which you own a stock you may choose to either sell at the current price, or keep the stock. At the start of a day at which you do not own stock, you may choose to either buy one stock at the current price or do nothing. You have initial capital of 200.

Your target is to maximize the discounted value of the profit over an infinite horizon, use discountfactor 0.8 (per day).

a) Define the states and give for each state the possible decisions.

b) Formulate the optimality equations.

c) Carry out two iterations of value iteration.

d) Formulate the L.P.-model to solve this problem. Describe how you can obtain the optimal policy from the LP formulation.

e) Choose a stationary policy and investigate using the policy iteration algorithm whether or not that policy is optimal.

f) Give the number of stationary policies. Motivate your answer by using the definition of stationary policy.


Related Discussions:- formulate the optimality equations

Periodicals and serials - classification of documents, Periodicals and Seri...

Periodicals and Serials: Periodical publications form an important part of today's information world. It is one of the oft chosen forms of research communication. There are ov

Linear programming, maximize z=3x1+2*2 subject to the constraints x1+x2=4 x...

maximize z=3x1+2*2 subject to the constraints x1+x2=4 x1-x2=2 x1.x2=0

Operations research, What are artificial variable why do you need them

What are artificial variable why do you need them

Analyse the average number and mean number, Consider the closed network of ...

Consider the closed network of the following figure. The number at the arrows give the transition probabilities for a customer leaving the queue to route to a subsequent queue. Eve

Dual of the lpp, the dual form of the following lpp min z=3x1+2.5x2 constra...

the dual form of the following lpp min z=3x1+2.5x2 constraints:2x1+4x2>=40, 3x1+2x2>=50 and x1,x2>=0

Drurys principles, Drury's Principles: The basic principle, which stil...

Drury's Principles: The basic principle, which still governs the selection of reading material for a library, was enunciated by Drury  in 1930. It states: "To provide the righ

Production and operations management., layout of any retailer shop and the ...

layout of any retailer shop and the reasons for the layout

Lpp using sipmle method, Maximize Z= 3x1 + 2X2 Subject to the constraints: ...

Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

Jaguar, how jaguar implements aggregate planning?

how jaguar implements aggregate planning?

Linear programming simplex method, How to solve linear programming problems...

How to solve linear programming problems using simplex method introducing slack variable,surplus variable and artificial variable

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd