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
A certain type of machine breaks down at an average rate of 5/hour. the break down is in accordance with Poisson process.cost of idle machine hour is $15/hour. 2 repairmen Peter an

Discuss the methodology of operation research


a paper mill produce two grades of paper viz., X and Y. because of raw material restrictions, it cannot produce more than 400 tona of grade X and 300 tons of grade Yin a week. ther

Level of Significance In testing a given  hypothesis  the maximum  probability with which  we would  be willing  to take  risk is called  level of  significance of the  test.

LIMITS OF TRANSPOTATION PROBLEM

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

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

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

Sample Assignment for minimum spanning tree problems For the subsequent graph get the minimum spanning tree. The numbers on the branches presents the cost.