Jankord Jewelers permits the return of their diamond wedding rings, provided the return occurs within two weeks. Typically, 20 percent are returned. If nine rings are sold today, what is the probability that fewer than four will be returned? A- 0.914 B- 0.962 C- 0.923 D- 0.935

Jankord Jewelers permits the return of their diamond wedding rings, provided the return occurs within two weeks. Typically, 20 percent are returned. If nine rings are sold today, what is the probability that fewer than four will be returned? A- 0.914 B- 0.962 C- 0.923 D- 0.935

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter11: Simulation Models

Section: Chapter Questions

Problem 44P: You now have 5000. You will toss a fair coin four times. Before each toss you can bet any amount of...

See similar textbooks

Similar questions

You now have 10,000, all of which is invested in a sports team. Each year there is a 60% chance that the value of the team will increase by 60% and a 40% chance that the value of the team will decrease by 60%. Estimate the mean and median value of your investment after 50 years. Explain the large difference between the estimated mean and median.
It costs a pharmaceutical company 75,000 to produce a 1000-pound batch of a drug. The average yield from a batch is unknown but the best case is 90% yield (that is, 900 pounds of good drug will be produced), the most likely case is 85% yield, and the worst case is 70% yield. The annual demand for the drug is unknown, with the best case being 20,000 pounds, the most likely case 17,500 pounds, and the worst case 10,000 pounds. The drug sells for 125 per pound and leftover amounts of the drug can be sold for 30 per pound. To maximize annual expected profit, how many batches of the drug should the company produce? You can assume that it will produce the batches only once, before demand for the drug is known.
The game of Chuck-a-Luck is played as follows: You pick a number between 1 and 6 and toss three dice. If your number does not appear, you lose 1. If your number appears x times, you win x. On the average, use simulation to find the average amount of money you will win or lose on each play of the game.
You have 5 and your opponent has 10. You flip a fair coin and if heads comes up, your opponent pays you 1. If tails comes up, you pay your opponent 1. The game is finished when one player has all the money or after 100 tosses, whichever comes first. Use simulation to estimate the probability that you end up with all the money and the probability that neither of you goes broke in 100 tosses.
A new edition of a very popular textbook will be published a year from now. The publisher currently has 1000 copies on hand and is deciding whether to do another printing before the new edition comes out. The publisher estimates that demand for the book during the next year is governed by the probability distribution in the file P10_31.xlsx. A production run incurs a fixed cost of 15,000 plus a variable cost of 20 per book printed. Books are sold for 190 per book. Any demand that cannot be met incurs a penalty cost of 30 per book, due to loss of goodwill. Up to 1000 of any leftover books can be sold to Barnes and Noble for 45 per book. The publisher is interested in maximizing expected profit. The following print-run sizes are under consideration: 0 (no production run) to 16,000 in increments of 2000. What decision would you recommend? Use simulation with 1000 replications. For your optimal decision, the publisher can be 90% certain that the actual profit associated with remaining sales of the current edition will be between what two values?
Based on Babich (1992). Suppose that each week each of 300 families buys a gallon of orange juice from company A, B, or C. Let pA denote the probability that a gallon produced by company A is of unsatisfactory quality, and define pB and pC similarly for companies B and C. If the last gallon of juice purchased by a family is satisfactory, the next week they will purchase a gallon of juice from the same company. If the last gallon of juice purchased by a family is not satisfactory, the family will purchase a gallon from a competitor. Consider a week in which A families have purchased juice A, B families have purchased juice B, and C families have purchased juice C. Assume that families that switch brands during a period are allocated to the remaining brands in a manner that is proportional to the current market shares of the other brands. For example, if a customer switches from brand A, there is probability B/(B + C) that he will switch to brand B and probability C/(B + C) that he will switch to brand C. Suppose that the market is currently divided equally: 10,000 families for each of the three brands. a. After a year, what will the market share for each firm be? Assume pA = 0.10, pB = 0.15, and pC = 0.20. (Hint: You will need to use the RISKBINOMLAL function to see how many people switch from A and then use the RISKBENOMIAL function again to see how many switch from A to B and from A to C. However, if your model requires more RISKBINOMIAL functions than the number allowed in the academic version of @RISK, remember that you can instead use the BENOM.INV (or the old CRITBENOM) function to generate binomially distributed random numbers. This takes the form =BINOM.INV (ntrials, psuccess, RAND()).) b. Suppose a 1% increase in market share is worth 10,000 per week to company A. Company A believes that for a cost of 1 million per year it can cut the percentage of unsatisfactory juice cartons in half. Is this worthwhile? (Use the same values of pA, pB, and pC as in part a.)
You now have 5000. You will toss a fair coin four times. Before each toss you can bet any amount of your money (including none) on the outcome of the toss. If heads comes up, you win the amount you bet. If tails comes up, you lose the amount you bet. Your goal is to reach 15,000. It turns out that you can maximize your chance of reaching 15,000 by betting either the money you have on hand or 15,000 minus the money you have on hand, whichever is smaller. Use simulation to estimate the probability that you will reach your goal with this betting strategy.
Software development is an inherently risky and uncertain process. For example, there are many examples of software that couldnt be finished by the scheduled release datebugs still remained and features werent ready. (Many people believe this was the case with Office 2007.) How might you simulate the development of a software product? What random inputs would be required? Which outputs would be of interest? Which measures of the probability distributions of these outputs would be most important?
Assume a very good NBA team has a 70% chance of winning in each game it plays. During an 82-game season what is the average length of the teams longest winning streak? What is the probability that the team has a winning streak of at least 16 games? Use simulation to answer these questions, where each iteration of the simulation generates the outcomes of all 82 games.
In this version of dice blackjack, you toss a single die repeatedly and add up the sum of your dice tosses. Your goal is to come as close as possible to a total of 7 without going over. You may stop at any time. If your total is 8 or more, you lose. If your total is 7 or less, the house then tosses the die repeatedly. The house stops as soon as its total is 4 or more. If the house totals 8 or more, you win. Otherwise, the higher total wins. If there is a tie, the house wins. Consider the following strategies: Keep tossing until your total is 3 or more. Keep tossing until your total is 4 or more. Keep tossing until your total is 5 or more. Keep tossing until your total is 6 or more. Keep tossing until your total is 7 or more. For example, suppose you keep tossing until your total is 4 or more. Here are some examples of how the game might go: You toss a 2 and then a 3 and stop for total of 5. The house tosses a 3 and then a 2. You lose because a tie goes to the house. You toss a 3 and then a 6. You lose. You toss a 6 and stop. The house tosses a 3 and then a 2. You win. You toss a 3 and then a 4 for total of 7. The house tosses a 3 and then a 5. You win. Note that only 4 tosses need to be generated for the house, but more tosses might need to be generated for you, depending on your strategy. Develop a simulation and run it for at least 1000 iterations for each of the strategies listed previously. For each strategy, what are the two values so that you are 95% sure that your probability of winning is between these two values? Which of the five strategies appears to be best?
At the beginning of each week, a machine is in one of four conditions: 1 = excellent; 2 = good; 3 = average; 4 = bad. The weekly revenue earned by a machine in state 1, 2, 3, or 4 is 100, 90, 50, or 10, respectively. After observing the condition of the machine at the beginning of the week, the company has the option, for a cost of 200, of instantaneously replacing the machine with an excellent machine. The quality of the machine deteriorates over time, as shown in the file P10 41.xlsx. Four maintenance policies are under consideration: Policy 1: Never replace a machine. Policy 2: Immediately replace a bad machine. Policy 3: Immediately replace a bad or average machine. Policy 4: Immediately replace a bad, average, or good machine. Simulate each of these policies for 50 weeks (using at least 250 iterations each) to determine the policy that maximizes expected weekly profit. Assume that the machine at the beginning of week 1 is excellent.
Big Hit Video must determine how many copies of a new video to purchase. Assume that the companys goal is to purchase a number of copies that maximizes its expected profit from the video during the next year. Describe how you would use simulation to shed light on this problem. Assume that each time a video is rented, it is rented for one day.