Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more.
Course Hero has millions of course specific materials providing students with the best way to expand
their education.
Below is a small sample set of documents:
Ohio State - FINANCE - 741
Business Finance 741Life and Health Risk ManagementWinter 2012PROBLEM ASSIGNMENT 1DirectionsYou work for Woodruff Products, a large industrial company. You have been tasked bythe companys CFO to prepare a series of short reports (memoranda). Each re
Ohio State - FINANCE - 741
Introduction toAnnuity ContractsAnnuityBusiness Finance 741Winter 2012AnnuitiesAnnuitiesDefinition and Purpose An insurance contract that promises to make aseries of payments: for a fixed time period, or over a persons lifetime. Annuities addr
Ohio State - FINANCE - 741
Business Finance 741PROBLEM ASSIGNMENT 2Winter 2012DirectionsAnswer each of the following questions and organize your answers into a written report.Your report should not exceed two (2) letter-size pages (typewritten on one side of thepage only, sin
Purdue - IE - 336
Homework Set #1 SolutionsIE 336 Spring 20121. Let S denote the sample space. If events Bi partition the sample space, then:S = B1 B2 Bn If A is an event from the sample space, then A can also be expressed as:A= AS = A (B1 B2 Bn ) = (A B1 ) (A B2 ) (A
Purdue - IE - 336
Homework Set #2 SolutionsIE 336 Spring 20121. (a) Let X equal number of good chips that appear. Then, X Binomial(n, p), where n > 1000 and p = 2/5. Since n is sufficiently large, the binomial distribution can be approximated using a normal distribution,
Purdue - IE - 336
Homework Set #3 SolutionsIE 336 Spring 20121. From HW1, we know that fX (x) = 2ex - 2e-2x , 0 x < and fY (y) = 2e-2y , 0 y < . Determine E(Y ): Y exp(2). Therefore, E(Y ) = Determine E(X): E (X) = =0 1 = 1. 2xfX (x)dxx x 2e-x - 2e-2x dx 2xe-x dx -
Purdue - IE - 336
Homework Set #4 SolutionsIE 336 Spring 20121. (a) Let cfw_1, 2, 3 represent the states of the Markov chain.Figure 1: Transition Diagram for Problem 1a (b) Determine p, q, and r. q 32r + 3p += = = =1 1 1 6r3q q +r+ + 2r 8 8 q r + 6p + 6 q2Solving t
Purdue - IE - 336
Homework Set #5 SolutionsIE 336Spring 20121. (a) p, q , and r can be determined by solving the matrix form of the system of equations:121/2 2p14/3 q = 13r124/31Solving yields p = 1/4, q = 1/8, and r = 1/4.(b) Using the values of p, q ,
Purdue - IE - 336
Homework Set #6 SolutionsIE 336 Spring 20111. (a) p = 1/4, q = 1/8, r = 1/4. Transition diagram omitted. 2q P = 3r 6q (b) Given p(4) = 0.6 0.3 rp 2 2p 3 2p 1/4 1/4 q = 3/4 1/8 r 3/4 1/6 3 1/2 1/8 1/120.1 , the vector at time step 8 is:p(8)= p(4) P
Purdue - IE - 336
Homework Set #8 SolutionsIE 336 Spring 20111. (a) To estimate the mean time, let nij be the number of transitions from i to j, and let Tij (k) be the kth observed value of a transition time from i to j: nij E(Tij ) E(T12 ) E(T21 ) k=1Tij (k)nij 3+2+4
Purdue - IE - 336
Homework Set #9 SolutionsIE 336 Fall 20111. (a) Determine the steady-state probabilities. Since each row in a transition probability matrix must equal 1: 7 4 7 1 - e-11t = + e-11t 11 11 11p11 (t) = 1 - p12 (t) = 1 -Using the definition of steady-state
Purdue - IE - 336
Homework Set #10 SolutionsIE 336 Fall 20111. (a) This is the M/M/1 queue. The transition diagram is shown in Figure 1.Figure 1: Transition Diagram for Problem 1a (b) If there are 5 customers in the queue at steady-state, then there must be 6 customers
Purdue - IE - 330
4 May 2010IE330 Spring 2010Final ExamPart 1: Mandatory (Chapters 15 and 16)No calculators, closed book, closed notes.Do not tear off any pages.11. CHAPTER 15 - True/False questions (3 points each, 15 points total)a. (TRUE or FALSE) In a sign test,
Purdue - IE - 330
Name: _KEY_ 5 May 2006 IE330 Spring 2006 Final Exam #1 No calculators, closed book, closed notes. Do not tear off any pages.1 of 18Name: _KEY_1. (TRUE or FALSE) To estimate the arithmetic mean of a population by taking a sample from that same populatio
Purdue - IE - 330
Name: _ 5 May 2006 IE330 Spring 2006 Final Exam #1 No calculators, closed book, closed notes. Do not tear off any pages.1 of 18Name: _1. (TRUE or FALSE) To estimate the arithmetic mean of a population by taking a sample from that same population, the d
Purdue - IE - 330
Name: _ 5 May 2006 IE330 Spring 2006 Final Exam #2 No calculators, closed book, closed notes. Do not tear off any pages.1 of 18Name: _1.(TRUE or FALSE) The nonparametric sign test can be run on a sample of a population regardless of its distribution,
Purdue - IE - 330
Name: _ 5 May 2006 IE330 Spring 2006 Final Exam #2 No calculators, closed book, closed notes. Do not tear off any pages.1 of 18Name: _1. (TRUE or FALSE) To estimate the arithmetic mean of a population by taking a sample from that same population, the d
Purdue - IE - 330
Name: _ 16 December 2008 IE330 Fall 2008 Final Exam A Part 1: Mandatory No calculators, closed book, closed notes. Do not tear off any pages.1 of 20Name: _ 1. CHAPTER 14 - True/False questions (3 points each, 9 points total) a. (TRUE or FALSE) When show
Purdue - IE - 330
Name: _ 16 December 2008 IE330 Fall 2008 Final Exam A Part 1: Mandatory No calculators, closed book, closed notes. Do not tear off any pages.1 of 18Name: _ 1. CHAPTER 14 - True/False questions (3 points each, 9 points total) a. (TRUE or FALSE) When show
Purdue - IE - 330
Name: _7 May 2009IE330 Spring 2009Final Exam APart 1: MandatoryNo calculators, closed book, closed notes.Do not tear off any pages.1 of 24Name: _1. CHAPTER 15 - True/False questions (3 points each, 15 points total)a. (TRUE or FALSE) To conduct a
Purdue - IE - 330
Name: _ 16 December 2008 IE330 Fall 2008 Final Exam #1 Part 1: Mandatory No calculators, closed book, closed notes. Do not tear off any pages.1 of 30Name: _1.CHAPTER 14 - True/False questions (3 points each, 9 points total) a. (TRUE or FALSE) When sho
Purdue - IE - 330
Name: _ 16 December 2008 IE330 Fall 2008 Final Exam B Part 1: Mandatory No calculators, closed book, closed notes. Do not tear off any pages.1 of 20Name: _ 1. CHAPTER 14 - True/False questions (3 points each, 9 points total) a. (TRUE or FALSE) Two lines
Purdue - IE - 330
Name: _ 16 December 2008 IE330 Fall 2008 Final Exam B Part 1: Mandatory No calculators, closed book, closed notes. Do not tear off any pages.1 of 19Name: _ 1. CHAPTER 14 - True/False questions (3 points each, 9 points total) a. (TRUE or FALSE) Two lines
Purdue - IE - 330
Name: _ 7 May 2009 IE330 Spring 2009 Final Exam B Part 1: Mandatory No calculators, closed book, closed notes. Do not tear off any pages.1 of 24Name: _ 1. CHAPTER 15 - True/False questions (3 points each, 15 points total) a. (TRUE or FALSE) In a Wilcoxo
Purdue - IE - 330
Name: _ 16 December 2008 IE330 Fall 2008 Final Exam C Part 1: Mandatory No calculators, closed book, closed notes. Do not tear off any pages.1 of 19Name: _ 1. CHAPTER 14 - True/False questions (3 points each, 9 points total) a. (TRUE or FALSE) In a two-
Purdue - IE - 330
Name: _ 16 December 2008 IE330 Fall 2008 Final Exam C Part 1: Mandatory No calculators, closed book, closed notes. Do not tear off any pages.1 of 18Name: _ 1. CHAPTER 14 - True/False questions (3 points each, 9 points total) a. (TRUE or FALSE) In a two-
Purdue - IE - 332
IE 332 Computing in IEExam #1 Fall 2008Name: _EXAM #1 Wednesday, 8 October 2008 IE 332 Computing in Industrial EngineeringJi Soo Yi Fall 2008 Notes: Exam time: 2:30 3:20 pm Please write down your name on top of this page Please write down your initial
Purdue - IE - 332
IE 332 Computing in IEExam #2 Fall 2008Name: _EXAM #2 Wednesday, 10 November 2008 IE 332 Computing in Industrial EngineeringJi Soo Yi Fall 2008 Notes: Exam time: 2:30 3:20 pm Please write down your name on top of this page. Please write down your init
Purdue - IE - 332
IE 332 Computing in IEExam #3 Fall 2008Name: _EXAM #3 TYPE X SolutionsWednesday, 19 December 2008IE 332 Computing in Industrial EngineeringJi Soo YiFall 2008Notes: Exam time: 3:20 4:10 pm Please write down your name on top of this page. Please
Purdue - IE - 332
IE 332 Computing in IEExam #1 Fall 2010Name: _EXAM #1 Friday, 9/17/2010 IE 332 Computing in Industrial EngineeringJi Soo Yi Fall 2010 Notes: Exam time: 2:30 3:20 pm Exam points (grades): total 40 points + extra 1 point Please write down your name at t
Purdue - IE - 332
IE 332 Computing in IEExam #2A Fall 2010Name: _EXAM #2 Friday, 10/22/2010 IE 332 Computing in Industrial EngineeringJi Soo Yi Fall 2010 Notes: Exam time: 2:30 3:20 pm Exam points (grades): total ? points + extra 1 point Please write down your name on
Purdue - IE - 332
IE 332 Computing in IEExam #2A Fall 2010Name: _EXAM #3 Monday, 12/13/2010 IE 332 Computing in Industrial EngineeringJi Soo Yi Fall 2010 Notes: Exam time: 1:00 1:50 pm Exam points (grades): total 38 points + extra 1 point Please write down your name on
Purdue - IE - 332
IE 332 Computing in IEExam #1 Spring 2009Name: _EXAM #1 Monday, 9 February 2009 IE 332 Computing in Industrial EngineeringJi Soo Yi Spring 2009 Notes: Exam time: 2:30 3:20 pm Exam points (grades) : total 37 points + extra 1 point Please write down you
Purdue - IE - 332
IE 332 Computing in IEExam #1 Spring 2010Name: _EXAM #1 Monday, 8 February 2010 IE 332 Computing in Industrial EngineeringJi Soo Yi Spring 2010 Notes: Exam time: 2:30 3:20 pm Exam points (grades): total 38 points + extra 1 point Please write down your
Purdue - IE - 332
IE 332 Computing in IEExam #1A Spring 2010EXAM #2 Monday, March 8, 2010 IE 332 Computing in Industrial EngineeringJi Soo Yi Spring 2010 Notes: Exam time: 2:30 3:20 pm Exam points (grades): total 39 points + extra 1 point Please write down your name on
Purdue - IE - 332
IE 332 Computing in IEExam #3A Spring 2010EXAM #3 Friday, April 23, 2010 IE 332 Computing in Industrial EngineeringJi Soo Yi Spring 2010 Notes: Exam time: 2:30 3:20 pm Exam points (grades): total 39.5 points + extra 1 point Please write down your name
Purdue - IE - 332
IE 332 Computing in IEExam #1A Spring 2011Name: _EXAM #1 Friday, 2/4/2011 IE 332 Computing in Industrial EngineeringJi Soo Yi Spring 2011 Notes: Exam time: 2:30 3:20 pm Exam points (grades): total ? points + extra ? point Please write down your name a
Purdue - IE - 332
IE 332 Computing in IEExam #2A Spring 2011Name: _EXAM #2 Monday, 3/7/2011 IE 332 Computing in Industrial EngineeringJi Soo Yi Spring 2011 Notes: Exam time: 2:30 3:20 pm Exam points (grades): total 32 points + extra 2 point Please write down your name
Purdue - IE - 332
IE 332 Computing in IEExam #3 Spring 2011Name: _EXAM #3Saturday, 5/7/2011IE 332 Computing in Industrial EngineeringJi Soo YiSpring 2011Notes: Exam time: 9:00am 9:50am Exam points (grades): total ? points + extra ? point Please write down your n
Purdue - IE - 332
IE 332 Computing in IEExam #2 Spring 2009Name: _EXAM #2 Monday, 9 March 2009 IE 332 Computing in Industrial EngineeringJi Soo Yi Spring 2009 Notes: Exam time: 2:30 3:20 pm Exam points (grades): total 38 points + extra 1 point Please write down your na
Purdue - IE - 332
IE 332 Computing in IEExam #3 Spring 2009Name: _EXAM #3 Wednesday, May 6, 2009 IE 332 Computing in Industrial EngineeringJi Soo Yi Spring 2009 Notes: Exam time: 8:00am 8:50am Exam points (grades): total 39 points Please write down your name on top of
Purdue - IE - 383
Problem 5Assuming all jobs were released at the same time (rj = 0). Breaking ties rule: select the job with the lower value of job code. a) SPT Dispatching Rule Sequence:Job pj dj D 3 18 B 6 12 A 8 10 E 12 22 C 15 20Jobs Measures Job Cj Lj Tj Ej Uj D 3
Purdue - IE - 383
17-18. Breaking ties rule: select the job with the lower value of job code. As quick as soon as possible: Cmax Objective Machine environment: Flowshop, two machines: F2Cmax Scheduling Problem. Using Johnson's Rule to determinet a SPT(1)-LPT(2) Schedule y
Purdue - IE - 383
17-9Assuming all jobs were released at the same time (rj = 5), since now: tNOW = 5. Breaking ties rule: select the job with the lower value of job code. SPT Dispatching Rule Sequence:Job pt dt D 3 20 H 3 50 A 5 10 C 6 15 G 7 45 B 8 15 E 10 25 F 14 40Jo
Purdue - IE - 383
17-6Assuming all jobs were released at the same time (rj = 0).Breaking ties rule: select the job with the lower value of job code.FCFS Dispatching RuleSequence:JobpjdjABCDEF23124123448510Jobs MeasuresJobCjLjTjEjUjABCDE
Purdue - IE - 383
IE 383 Integrated Production Systems Spring 2012HW 10: Scheduling Due: TBAProblem 17-6 As in the textbook. Problem 17-9 As in the textbook. Problem 17-14 a) As in the textbook. b) Evaluate (i) Average Flowtime and (ii) Utilization of the Polishing Depar
Purdue - IE - 383
Single-Machine cheduling: ApplicationDeveloped by: Alejandro TernSPT Dispatching RuleObjective: To develop an Application (Excel + VBA) that determines a schedule using the SPT Dispatching Rule.APPLICATION CHARACTERISTICS Consider the SPT Dispatching
Purdue - IE - 383
P15-15a.b. c.5 days no;d.Inventory the back panel, drawer guide, side panel and legsP15-151
Purdue - IE - 383
P15-4P15-41
Purdue - IE - 383
IE 383 Integrated Production Systems Spring 2012HW 9: Lot Sizing, MRP Due: To be announced in classProblem 15-4 As in the textbook. Problem 15-10 As in the textbook. Problem 15-15 As in the textbook. Problem 15-16 As in the textbook.Bonus Develop appli
Purdue - IE - 383
Lot Sizing: ApplicationDeveloped by: Alejandro TernLot SizingObjective: To develop an Application (Excel + VBA) that determines schedulesunder a L4L Lot Sizing policy.APPLICATION CHARACTERISTICSConsider the Lot for Lot Policy for Lot Sizing.Develop
Purdue - IE - 383
13-24D K i 1,700 120 0.25j 1 2 3 4LBPj 1 300 500 800UBPj 299 499 799Cj 38 37.24 36.48 36.1hj 8 8 8 8EOQj 225.83 225.83 225.83 225.83Realizable? Candidate Yes 225.83 No 300 No 500 No 800Optimal?OptimalTAC(Q) $66,406.65 $65,188.00 $64,424.00 $64,
Purdue - IE - 383
13-23D K i 1,700 120 0.25j 1 2 3 4LBPj 1 300 500 800UBPj 299 499 799Cj 38 37.24 36.48 36.1hj 9.5 9.31 9.12 9.025EOQj 207.24 209.34 211.51 212.62Realizable? Candidate Yes 207.24 No 300 No 500 No 800Optimal?OptimalTAC(Q) $66,568.76 $65,384.50 $64
Purdue - IE - 383
13-20D K h QEOQ 40,000 800 1.9 5,803.81j 1 2 3 4 5 6LBPj 1 10,000 20,000 30,000 40,000 50,000UBPj 9,999 19,999 29,999 39,999 49,999Cj 3.4 3.2 3 2.8 2.6 2.4EOQj Realizable? Candidate Optimal? TAC(Q) DC KD/Q hQ/2 5,803.81 Yes 5,803.81 $147,027.24 $136
Purdue - IE - 383
IE 383 Integrated Production Systems Spring 2012HW 8: Discounts, Random Demand Due: TBAProblem 13-20 As in the textbook. Problem 13-23 As in the textbook. Problem 13-24 As in the textbook. Problem 13-31 a) As in the textbook. b) Based on your answers to
Purdue - IE - 383
Inventory Discount Models: ApplicationDeveloped by: Alejandro TernDiscount ModelsObjective: To develop an Application (Excel + VBA) that determines the optimal inventory policy under an All-Units Discount scheme.APPLICATION CHARACTERISTICS Consider th
Purdue - IE - 383
13-40Calculations (items ranked):ItemDemandCostUsage Value % Usage Value Cum Usage Value % Cum Usage Value1372,30016,10013.65%16,10013.65%491,23011,0709.38%27,17023.03%10273509,4508.01%36,62031.04%20109359,3507.93%45,97038