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

Solve the following lpp by graphical method, A company manufactures two typ...

A company manufactures two types of printed circuits. The requirements of transistors, resistors and capacitor for each type of printed circuits along with other data are given in

Assignment answer, Q2.Six Operators are to be assigned to five jobs with th...

Q2.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 assignm

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

What are artificial variable why do you need them

Explain the method of taylor scientific management, a. Explain the method o...

a. Explain the method of "Taylor's Scientific Management". List the elements of Taylor's Scientific Management. b. List the necessary managerial functions of a Manager. Explain.

Linear programming , Solve the following Linear Programming Problem using S...

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

Word problems based on formulation of linear programming, Word problems bas...

Word problems based on formulation of linear programming problems. 2.   A manufacturer produces nuts and bolts for industrial machinery. It takes 1 hour of work on machine 1 an

Report writing - report writing presentation, REPORT WRITING The final...

REPORT WRITING The final step in research is to report the study  findings to those  who authorized the investigation. The American marketing association is  of the opinion  t

Simplex method of LP, MAX: 150 X1 + 250 X2 Subject to: 2 X1 + 5 X2 = 200 - ...

MAX: 150 X1 + 250 X2 Subject to: 2 X1 + 5 X2 = 200 - resource 1 3 X1 + 7 X2 = 175 - resource 2 X1, X2 = 0 2. How many units of resource 1 are cons

Sequencing problem, if one no. is repeated 2-3 times in machine-1 and machi...

if one no. is repeated 2-3 times in machine-1 and machine-2 what is to be prefer first

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