lp-model and markov decision problem, Operation Research

The supply of a certain good is inspected periodically. If an order is placed of size x>0 (integer), the ordering costs are 8+2.x. The delivery time is zero. The demand is stochastic en equals 1 or 2 with probability ½ . Demand in subsequent periods are independent. The size of an order must be such that (a) demand in a period is always satisfied, and (b) the stock at the end of a period never exceeds 2. The holding costs in a period are 2 per unit remaining at the end of a period. Target is to minimize the expected discounted costs over infinite horizon, use discount factor 0.8.

(a)   Give the optimality equations for the Markov decision problem.

(b)   Give an LP-model that allows you to determine the optimal policy.

(c)    Carry out two iterations of the value iteration algorithm

(d)   Choose an odering policy, and investigate using the policy iteration algorithm whether or not this policy is optimal. "

 

Posted Date: 3/5/2013 8:11:19 AM | Location : United States







Related Discussions:- lp-model and markov decision problem, Assignment Help, Ask Question on lp-model and markov decision problem, Get Answer, Expert's Help, lp-model and markov decision problem Discussions

Write discussion on lp-model and markov decision problem
Your posts are moderated
Related Questions
Meaning of Linear programming problem and explanation of graphical method of solving Linear Programming Problem

factors affecting tha transportation cost

Question 1 Explain Pre-Store opening activities and State at least 10 pre-store opening activities that should be ideally carried out in a retail store? Question 2 What ar

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

Problem based on graphical solution of a given LPP when feasible region is bounded. 1.    Solve the following linear programming graphically; Maximize and minimize z = 60x+

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

Knowledge: The dictionary definition of knowledge is 'organised body of information or the comprehension and understanding, consequent on having acquired an organised body of

Reference Books If an article  in a reference  books has more  than one  author use the  same  format  for  authors  given for  books above. a. Authors Known :Authors last

discuss applications and scope of operations research in diverse areas.

#question.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.