lp-model and markov decision problem, Operation Research

Assignment Help:

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. "

 


Related Discussions:- lp-model and markov decision problem

Methods of survey and study, Methods of Survey and Study:   Some method...

Methods of Survey and Study:   Some methods of collecting information about the organisation and about the information requirement of potential users are mentioned below. No si

Linear Programming Problem, A paper mill produces two grades of paper viz.,...

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

Techniques of observation method, Techniques of Observation Method Obs...

Techniques of Observation Method Observation always involves some interaction between respondent and researcher in which researcher has an opportunity to watch respondent fu

Pay-off matrix , In a rectangular game, pay-off matrix of player A is as fo...

In a rectangular game, pay-off matrix of player A is as follows: Player B B1 B2 Player A A1 A2 i) Solve the game. ii) Write down the pay-off matrix of B and th

Cpm/pert, how to make an attractive assignment

how to make an attractive assignment

Simplex method, Solve the following Linear Programming Problem using Simple...

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

Categories, what are the operation research?

what are the operation research?

RJR NABISCO, WOULD YOU RECOMMEND FOCUS GROUPS OR SOME OTHER RESEARCH DESIGN...

WOULD YOU RECOMMEND FOCUS GROUPS OR SOME OTHER RESEARCH DESIGN IN THIS SITUATION

OPTIMAL ASSIGNMENT., Six Operators are to be assigned to five jobs with the...

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

LLP Simple method, Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2...

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

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