Final Exam Due: December 14 (Noon), 2004

Slides:



Advertisements
Similar presentations
Chapter 17 Multivariable Calculus.
Advertisements

Treatments of Risks and Uncertainty in Projects The availability of partial or imperfect information about a problem leads to two new category of decision-making.
Facilities and Aggregate Planning. A digression I am not an advocate of gambling, but use an example here that you might draw on later. Say I have a coin.
SA-1 Probabilistic Robotics Planning and Control: Partially Observable Markov Decision Processes.
1 1 Slide © 2004 Thomson/South-Western Payoff Tables n The consequence resulting from a specific combination of a decision alternative and a state of nature.
Lecture 5 Decision Analysis Chapter 14.
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.
Chapter 4 Decision Analysis.
Clear your desk for your quiz. Unit 2 Day 8 Expected Value Average expectation per game if the game is played many times Can be used to evaluate and.
1 1 Slide Decision Analysis n Structuring the Decision Problem n Decision Making Without Probabilities n Decision Making with Probabilities n Expected.
Chapter 8 Decision Analysis MT 235.
Topic 2. DECISION-MAKING TOOLS
Business 260: Managerial Decision Analysis
Section 1.1, Slide 1 Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 13.4, Slide 1 13 Probability What Are the Chances?
Warm up 1)We are drawing a single card from a standard deck of 52 find the probability of P(seven/nonface card) 2)Assume that we roll two dice and a total.
INDR 343 Problem Session
BA 452 Lesson C.4 The Value of Information ReadingsReadings Chapter 13 Decision Analysis.
Example 14.3 Football Production at the Pigskin Company
Solutions Markov Chains 1
INDR 343 Problem Session
The Multiple Regression Model Prepared by Vera Tabakova, East Carolina University.
Example 6.2 Fixed-Cost Models | 6.3 | 6.4 | 6.5 | 6.6 | Background Information n The Great Threads Company is capable of manufacturing.
EMGT 501 Fall 2005 Midterm Exam SOLUTIONS.
EMGT 501 HW # Due Day: Sep 12.
1 1 Slide © 2005 Thomson/South-Western Final Exam (listed) for 2008: December 2 Due Day: December 9 (9:00AM) Exam Materials: All the Topics After Mid Term.
Due Day: Dec 8 (Monday), 2008 (9:00AM)
HW # Due Day: Nov. 9.
1 1 Slide © 2005 Thomson/South-Western Final Exam: December 6 (Te) Due Day: December 12(M) Exam Materials: all the topics after Mid Term Exam.
Chapter 9 © 2006 Thomson Learning/South-Western Profit Maximization and Supply.
1 1 Slide © 2005 Thomson/South-Western EMGT 501 HW Solutions Chapter 12 - SELF TEST 9 Chapter 12 - SELF TEST 18.
EMGT 501 HW # Due Day: Oct. 12.
Chapter 8 Decision Analysis n Problem Formulation n Decision Making without Probabilities n Decision Making with Probabilities n Risk Analysis and Sensitivity.
Solutions Queueing Theory 1
Section 1.1, Slide 1 Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 13.4, Slide 1 13 Probability What Are the Chances?
Integer Programming Models
EMGT 501 Fall 2005 Final Exam Due Day: Dec 12 (Noon)
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
1 1 Slide Decision Theory Professor Ahmadi. 2 2 Slide Learning Objectives n Structuring the decision problem and decision trees n Types of decision making.
EMGT 501 Fall 2005 Midterm Exam Due Day: Oct 17 (Noon)
Mini-Lesson MA.912.A.3.5 Solve linear equations and inequalities
Solutions Markov Chains 2 3) Given the following one-step transition matrix of a Markov chain, determine the classes of the Markov chain and whether they.
Expected Value.
© 2015 McGraw-Hill Education. All rights reserved. Chapter 19 Markov Decision Processes.
1 Parrondo's Paradox. 2 Two losing games can be combined to make a winning game. Game A: repeatedly flip a biased coin (coin a) that comes up head with.
Copyright © 2009 Cengage Learning 22.1 Chapter 22 Decision Analysis.
Copyright © 2005 Brooks/Cole, a division of Thomson Learning, Inc Chapter 23 Decision Analysis.
Conditional Probability Mass Function. Introduction P[A|B] is the probability of an event A, giving that we know that some other event B has occurred.
Dan Piett STAT West Virginia University Lecture 12.
Problems Markov Chains 2
1 Chapter 8 Revising Judgments in the Light of New Information.
Example 1: The Absolute Value Function
Problems Markov Chains 1 1) Given the following one-step transition matrices of a Markov chain, determine the classes of the Markov chain and whether they.
1 1 Slide © 2005 Thomson/South-Western Chapter 13 Decision Analysis n Problem Formulation n Decision Making without Probabilities n Decision Making with.
Linear Programming Applications
Problems Markov Chains ) Given the following one-step transition matrices of a Markov chain, determine the classes of the Markov chain and whether.
Decisions under uncertainty and risk
Final exam, Problem 1: The disappearing money pot
Input – Output Models P = # of items produced
Solutions Markov Chains 1
Solutions Queueing Theory 1
Solutions Markov Chains 1
Solutions Queueing Theory 1
Solutions Markov Chains 1
Solutions Markov Chains 2
Lial/Hungerford/Holcomb/Mullins: Mathematics with Applications 11e Finite Mathematics with Applications 11e Copyright ©2015 Pearson Education, Inc. All.
Solutions Queueing Theory 1
EMGT 501 Fall 2005 Final Exam Due Day: Dec 12 (Noon)
Solutions Markov Chains 6
Presentation transcript:

Final Exam Due: December 14 (Noon), 2004 EMGT 501 Final Exam Due: December 14 (Noon), 2004

Note Summarize your solutions in a condensed way. Send your PPS at toshi@nmt.edu . Answer on PPS that has a series of slides. Do not discuss the Final Exam with other people.

(1) You are given the opportunity to guess whether a coin is fair or two-headed, where the prior probabilities are 0.5 for each of these possibilities. If you are correct, you win $5; otherwise, you lose $5. You are also given the option of seeing a demonstration flip of the coin before making your guess. You wish to use Bayes’ decision rule to maximize expected profit.

Develop a decision analysis formulation of this problem by identifying the alternative actions, states of nature, and payoff table. What is the optimal action, given that you decline the option of seeing a demonstration flip? Find EVPI. Calculate the posterior distribution if the demonstration flip is a tail. Do the same if the flip is a head. Determine your optimal policy. Now suppose that you must pay to see the demonstration flip. What is the most that you should be willing to pay?

(2) Consider the following blood inventory problem facing a hospital (2) Consider the following blood inventory problem facing a hospital. There is need for a rare blood type, namely, type AB, Rh negative blood. The demand D (in pints) over any 3-day period is given by

Note that the expected demand is 1 pint, since E(D)=0. 3(1)+0. 2(2)+0 Note that the expected demand is 1 pint, since E(D)=0.3(1)+0.2(2)+0.1(3)=1. Suppose that there are 3 days between deliveries. The hospital proposes a policy of receiving 1 pint at each delivery and using the oldest blood first. If more blood is required than the amount on hand, an expensive emergency delivery is made. Blood is discarded if it is still on the shelf after 21 days. Denote the state of the system as the number of pints on hand just after a delivery. Thus, because of the discarding policy, the largest possible state is 7.

Construct the (one-step) transition matrix for this Markov chain. Find the steady-state probabilities of the state of the Markov chain. Use the results from part (b) to find the steady-state probability that a pint of blood will need to be discarded during a 3-day period. (Hint: Because the oldest blood is used first, a pint reaches 21 days only if the state was 7 and then D=0.) Use the results from part (b) to find the steady-state probability that an emergency delivery will be needed during the 3-day period between regular deliveries.

(3) A maintenance person has the job of keeping two machines in working order. The amount of time that a machine works before breaking down has an exponential distribution with a mean of 10 hours. The time then spent by the maintenance person to repair the machine has an exponential distribution with a mean of 8 hours.

Show that this process fits the birth-and-death process by defining the states, specifying the values of the and , and then constructing the rate diagram. Calculate the . Calculate , , , and . Determine the proportion of time that the maintenance person is busy. Determine the proportion of time that any given machine is working.

(4) Consider the EOQ model with planed shortage, as discussed in our class. Suppose, however, that the constraint S/Q=0.8 is added to the model. Derive the expression for the optimal value of Q

(5) A market leader in the production of heavy machinery, the Spellman Corporation, recently has been enjoying a steady increase in the sales of its new lathe. The sales over the past 11 months are shown below. Month Sales Month Sales 1 2 3 4 5 6 530 546 564 580 598 570 7 8 9 10 11 614 632 648 670 691

Find a linear regression line that fits the data set. Use both Least Squares (LS) and Least Absolute Value (LAV) methods. (b) Show the formulation for LAV regression. (c) Forecast the amount of sales for the 12th month, based upon LS regression.