formulate the optimality equations, Operation Research

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.

Posted Date: 3/5/2013 8:10:30 AM | Location : United States







Related Discussions:- formulate the optimality equations, Assignment Help, Ask Question on formulate the optimality equations, Get Answer, Expert's Help, formulate the optimality equations Discussions

Write discussion on formulate the optimality equations
Your posts are moderated
Related Questions
SING TEST The sign test  is the simplest  of the  parametric  tests. Its name comes  from the  fact  that it is based  on the direction ( or sings  for  pluses or minuses ) of

A company manufactures 2 kinds of hats. Each hat of the I type needs twice as much as labour time as the II type. The company can manufacture a sum of 500 hats a day. The market re

A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper i

discuss the seauencing decision problem for n jobs on two and three machines

Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

Question : Suppose that you want to invest $10000 in the stock market by buying shares in one of two companies: A and B. Shares in Company A are risky but could yield a 50% ret

advantage of quality circle process

Minimize: 60P + 120Q Subject to: 2P + 3Q >10 P + 4Q >12 P, Q> 0

Six Operators are to be assigned to five jobs with the cost of assignment in Rs. given in the matrix below. Determine the optimal assignment. Which operator will have no assignment

POSSON DISTRIBUTION   In binomial  distribution the value of n was  finite. But  there are few  problems  when  cannot  be estimated. So in these  binomial  distribution