Compute the joining, marginal and posterior probability, Operation Research

Assignment Help:

The Best Corporation is considering making either minor or major repairs to a malfunctioning production process.  When the process is malfunctioning, the percentage of defective items produced seems to be a constant with either   p = 0.10 or p = 0.25.  Defective items are produced randomly, and there is no way Best can tell for sure whether the machine needs minor or major repairs.  If minor repairs are made when p = 0.25, the probability of a defective item is reduced to 0.05.  If minor repairs are made when p = 0.10 or major repairs are made when p = 0.10 or p = 0.25, the proportion of defectives is reduced to zero. The company's prior probability that p = 0.10 is 0.70.  Best has recently received an order for 1000 items.  This item yields Best a profit of $0.50 per unit, except when the company has to pay a $2 penalty cost for each defective item.  Major repairs to the process cost $100 and minor repairs to the process cost $60.  The process cannot be adjusted once a production run has begun. Prior to starting a production run, however, Best can sample (at a cost of $1 per item) items from a trial rum.

Questions

i)      Find Best's optimal course of action if the company is trying to decide between not sampling at all and sampling one item. (Draw, properly label and evaluate the decision tree).

ii)     Find the optimal action for Best if it is willing to consider a sample of either one or two item, (Draw, properly label and evaluate the decision tree).

iii)    Compute the joining probabilities, marginal probabilities and posterior probabilities for (i) and (ii) using MS Excel.

iv)    Use Decision Tree Analysis and find the best strategy.


Related Discussions:- Compute the joining, marginal and posterior probability

Network models, These models are applied to the management ( planning con...

These models are applied to the management ( planning controlling and scheduling ) of large scale projects. PERT/ CPM techniques help in identifying potential trouble spots in

LP - Assignment problem, I have looked at Hungarian algorithm to solve assi...

I have looked at Hungarian algorithm to solve assignment problem, but it seems like it is limited to 1-to-1 assignment. I would like to know how to do 1-to-3 assignment.

Lpp using sipmle method, Maximize Z= 3x1 + 2X2 Subject to the constraints: ...

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

Automation, whatdo you mean by automation

whatdo you mean by automation

information on research done, Information on Research Done Informatio...

Information on Research Done Information on Doctoral research work already done  is available from  the followings  sources: a. Bibliography of Doctoral  Dissertations Acce

Rank sum test the mann whitney u - test, RANK SUM TEST THE  MANN WHITNEY U...

RANK SUM TEST THE  MANN WHITNEY U - TEST Mann  Whitney u test is an alternative to the  samples  test. This  test is based  on the ranks  of the  observation of two samples pu

Lpp, a paper mill prodecs two grades of paper viz., X and Y. Because of raw...

a paper mill prodecs 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 in

Linear programming problem, Solve the following Linear Programming Problem ...

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

Types of correlation - correlation & regression analysis, Types of Correlat...

Types of Correlation 1. Positive Correlation : When the values  of two variables move  in the  same direction .e.  when an increase in  the values  of one  variables  is ass

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