IEOR 6711: Stochastic Models I Fall 2012, Professor Whitt, Thursday, October 4 Renewal Theory: Renewal Reward Processes

Similar documents
Random Walk on a Graph

Q = (c) Assuming that Ricoh has been working continuously for 7 days, what is the probability that it will remain working at least 8 more days?

1 Some basic renewal theory: The Renewal Reward Theorem

IEOR 3106: Introduction to Operations Research: Stochastic Models. Professor Whitt. SOLUTIONS to Homework Assignment 2

Renewal theory and its applications

1 Delayed Renewal Processes: Exploiting Laplace Transforms

IEOR 6711: Stochastic Models I, Fall 2003, Professor Whitt. Solutions to Final Exam: Thursday, December 18.

IEOR 6711: Stochastic Models I, Fall 2003, Professor Whitt. Second Midterm Exam, November 13, Based on Chapters 1-3 in Ross

SOLUTIONS IEOR 3106: Second Midterm Exam, Chapters 5-6, November 8, 2012

(b) What is the variance of the time until the second customer arrives, starting empty, assuming that we measure time in minutes?

Poisson Processes. Stochastic Processes. Feb UC3M

Since D has an exponential distribution, E[D] = 0.09 years. Since {A(t) : t 0} is a Poisson process with rate λ = 10, 000, A(0.

Introduction to Reliability Theory (part 2)

IEOR 3106: Fall 2013, Professor Whitt Topics for Discussion: Tuesday, November 19 Alternating Renewal Processes and The Renewal Equation

IEOR 3106: Introduction to Operations Research: Stochastic Models. Fall 2011, Professor Whitt. Class Lecture Notes: Thursday, September 15.

IEOR 6711: Stochastic Models I Fall 2013, Professor Whitt Lecture Notes, Thursday, September 5 Modes of Convergence

MAT SYS 5120 (Winter 2012) Assignment 5 (not to be submitted) There are 4 questions.

IEOR 3106: Introduction to Operations Research: Stochastic Models. Professor Whitt. SOLUTIONS to Homework Assignment 1

5.2 Exponential and Logarithmic Functions in Finance

IEOR 3106: Introduction to Operations Research: Stochastic Models Final Exam, Thursday, December 16, 2010

Class 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis.

IEOR 3106: Second Midterm Exam, Chapters 5-6, November 7, 2013

IEOR 4106: Introduction to Operations Research: Stochastic Models Spring 2011, Professor Whitt Class Lecture Notes: Tuesday, March 1.

CAS Exam MAS-1. Howard Mahler. Stochastic Models

Optional Stopping Theorem Let X be a martingale and T be a stopping time such

Graphing Equations Chapter Test

CS 1538: Introduction to Simulation Homework 1

IEOR 6711: Stochastic Models I SOLUTIONS to the First Midterm Exam, October 7, 2008

DO NOT OPEN THIS QUESTION BOOKLET UNTIL YOU ARE TOLD TO DO SO

RELATING TIME AND CUSTOMER AVERAGES FOR QUEUES USING FORWARD COUPLING FROM THE PAST

HITTING TIME IN AN ERLANG LOSS SYSTEM

DISCRETE STOCHASTIC PROCESSES Draft of 2nd Edition

Chapter 4: CONTINUOUS RANDOM VARIABLES AND PROBABILITY DISTRIBUTIONS

Continuous Probability Spaces

Example. Determine the inverse of the given function (if it exists). f(x) = 3

Exponential Distribution and Poisson Process

Poisson Processes for Neuroscientists

PoissonprocessandderivationofBellmanequations

IEOR 8100: Topics in OR: Asymptotic Methods in Queueing Theory. Fall 2009, Professor Whitt. Class Lecture Notes: Wednesday, September 9.

1 Inverse Transform Method and some alternative algorithms

Probability Density Functions and the Normal Distribution. Quantitative Understanding in Biology, 1.2

STAT/MA 416 Midterm Exam 2 Thursday, October 18, Circle the section you are enrolled in:

LIMITS FOR QUEUES AS THE WAITING ROOM GROWS. Bell Communications Research AT&T Bell Laboratories Red Bank, NJ Murray Hill, NJ 07974

Exam 3, Math Fall 2016 October 19, 2016

IEOR 6711, HMWK 5, Professor Sigman

Chapter 4 Continuous Random Variables and Probability Distributions

3. Poisson Processes (12/09/12, see Adult and Baby Ross)

Queueing Theory I Summary! Little s Law! Queueing System Notation! Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K "

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 22 12/09/2013. Skorokhod Mapping Theorem. Reflected Brownian Motion

Renewal Process Models for Crossover During Meiosis

2DI90 Probability & Statistics. 2DI90 Chapter 4 of MR

A Review of Basic FCLT s

(u v) = f (u,v) Equation 1

C. HECKMAN TEST 1A SOLUTIONS 170

2.4 Slope and Rate of Change

MATH 120 Elementary Functions Test #2

The exponential distribution and the Poisson process

Lecture 17: The Exponential and Some Related Distributions

IE 230 Probability & Statistics in Engineering I. Closed book and notes. 60 minutes.

1 Stationary point processes

Math 180 Chapter 4 Lecture Notes. Professor Miguel Ornelas

1. (Regular) Exponential Family

Massachusetts Institute of Technology Department of Electrical Engineering & Computer Science 6.041/6.431: Probabilistic Systems Analysis

SOME MEMORYLESS BANDIT POLICIES

Stochastic Renewal Processes in Structural Reliability Analysis:

Homework 4 due on Thursday, December 15 at 5 PM (hard deadline).

Stochastic Processes

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science

Lecture 1: Brief Review on Stochastic Processes

Dr. Maddah ENMG 617 EM Statistics 10/15/12. Nonparametric Statistics (2) (Goodness of fit tests)

A COMPOUND POISSON APPROXIMATION INEQUALITY

f X (x) = λe λx, , x 0, k 0, λ > 0 Γ (k) f X (u)f X (z u)du

Point Process Control

arxiv: v1 [math.pr] 7 Aug 2014

Solution: By Markov inequality: P (X > 100) 0.8. By Chebyshev s inequality: P (X > 100) P ( X 80 > 20) 100/20 2 = The second estimate is better.

Basics of Stochastic Modeling: Part II

DO NOT OPEN THIS QUESTION BOOKLET UNTIL YOU ARE TOLD TO DO SO

Rewrite logarithmic equations 2 3 = = = 12

Chapter Learning Objectives. Probability Distributions and Probability Density Functions. Continuous Random Variables

Example continued. Math 425 Intro to Probability Lecture 37. Example continued. Example

2. The CDF Technique. 1. Introduction. f X ( ).

X = lifetime of transistor

Cumulative chapters 1-3 review Period: 1. Tell whether each graph represents a function.

S1. Proofs of the Key Properties of CIATA-Ph

IEOR 4701: Stochastic Models in Financial Engineering. Summer 2007, Professor Whitt. SOLUTIONS to Homework Assignment 9: Brownian motion

Probability Midterm Exam 2:15-3:30 pm Thursday, 21 October 1999

Houston County School System Mathematics

Poisson Cluster process as a model for teletraffic arrivals and its extremes

IEOR 6711: Stochastic Models I Professor Whitt, Thursday, November 29, Weirdness in CTMC s

Choosing Arrival Process Models for Service Systems: Tests of a Nonhomogeneous Poisson Process

STAT/MA 416 Answers Homework 6 November 15, 2007 Solutions by Mark Daniel Ward PROBLEMS

Lecture 5: Asymptotic Equipartition Property

57:022 Principles of Design II Final Exam Solutions - Spring 1997

Introductory Statistics

Modelling the risk process

1 Probability and Random Variables

Houston County School System Mathematics

Temporal point processes: the conditional intensity function

Let X be a continuous random variable, < X < f(x) is the so called probability density function (pdf) if

STAT 516 Midterm Exam 2 Friday, March 7, 2008

Transcription:

IEOR 67: Stochastic Models I Fall 202, Professor Whitt, Thursday, October 4 Renewal Theory: Renewal Reward Processes Simple Renewal-Reward Theory Suppose that we have a sequence of i.i.d. random vectors {(X n, R n ) : n }, where P (X > 0). The random variable variable X n is regarded as the interrenewal time between the (n ) st and n th renewals in a renewal process; i.e., there is an associated renewal counting process {N(t) : t 0} with N(t) sup {n 0 : S n t}, t 0, where S n is the n th partial sum from {X n }, i.e., S n X + X n, n, with S 0 0; see Chapter 3 in Ross. We think of the random variables R n as rewards. We earn reward R n at time S n. We define an associated continuous-time renewal-reward stochastic process by setting R(t) N(t) n R n, t 0. The stochastic process {R(t) : t 0} is the renewal-reward process. The random variable R(t) is the cumulative reward earned up to time t; see Section 3.6 of Ross. We can do a surprising amount with the law of large numbers (LLN) for renewal-reward processes. This is perhaps the easiest part of renewal theory and yet it is perhaps the most useful part. So let us start by studying this part. Theorem 0. (SLLN for renewal-reward processes) If E[X ] < and E[ R ] <, then R(t) t E[R ] E[X ]. It has an easy proof, which we will go through. See Theorem 3.6. of Ross. It draws on the SLLN for the renewal counting process {N(t) : t 0}; see Proposition 3.3. in Ross. Theorem 0.2 (SLLN for renewal counting process) If E[X ] <, then N(t) t E[X ]. Problems with Solutions Source: Reference: Problems 37 and 38 in Chapter 7 of the Green Ross book.. A Computer with Three Parts A computer has three parts, each of which is needed for the computer to work. The computer runs continuously as long as the three required parts are working. The three parts have mutually independent exponential lifetimes before they fail. The expected lifetime of parts

, 2 and 3 are 0 weeks, 20 weeks and 30 weeks, respectively. When a part fails, the computer is shut down and an order is made for a new part of that type. When the computer is shut down (to order a replacement part), the remaining two working parts are not subject to failure. The time required to receive an order for a new part of type is exponentially distributed with mean week; the time required for a part of type 2 is uniformly distributed between week and 3 weeks; and the time required for a part of type 3 has a gamma distribution with mean 3 weeks and standard deviation 0 weeks. (a) What is the probability that part is the first part to fail? (b) Assuming that all parts are initially working, what is the expected time until the first failure? (c) Assuming that all parts are initially working, what is the probability that the computer is still working (without having required to be shut down) after 5 weeks? (d) What is the long-run proportion of time that the computer is working? (e) What is the long-run proportion of time that the computer is down waiting for an order of a new part? (f) What is the long-run proportion of time that part 2 is in a state of suspended animation (part 2 is working, but the computer is shut down)? (g) Suppose that new parts of type each cost $50; new parts of type 2 each cost $00; and new parts of type 3 each cost $400. What is the long-run average cost of replacement parts per week? 2. Trucks A truck driver regularly drives round trips from Atlanta (A) to Boston (B) and then back. Each time he drives from A to B he drives at a fixed speed (in miles per hour) that is uniformly distributed between 40 and 60. Each time he drives from B to A, he drives at a fixed speed that is equally likely to be 40 or 60 miles per hour. (a) In the long-run, what proportion of his driving time is spent going to B? (b) In the long run, for what proportion of his driving time is he driving at a speed of 40 miles per hour? SOLUTIONS - Solution to Number. (a) What is the probability that part is the first part to fail? Let N be the index of the first part to fail. Since the failure times are mutually independent exponential random variables (see Concise notes on exponential and Poisson), P (N ) λ λ + λ 2 + λ 3 (/0) (/0) + (/20) + (/30) 6. 2

(b) Assuming that all parts are initially working, what is the expected time until the first failure? Let T be the time until the first failure. Then T is exponential with rate equal to the sum of the rates; i.e., ET λ + λ 2 + λ 3 (/0) + (/20) + (/30) (/60) 60 5.45 weeks. (c) Assuming that all parts are initially working, what is the probability that the computer is still working (without having required to be shut down) after 5 weeks? Continuing from the last part, P (T > 5) e (/60)5 e 55/60 0.40. (d) What is the long-run proportion of time that the computer is working? Now for the first time we need to consider the random times it takes to get the replacement parts. Actually these distributions beyond their means do not affect the answers to the questions asked here. Only the means matter here. Use elementary renewal theory. The successive times that the computer is working and shut down form an alternating renewal process. Let T be a time until a failure (during which the computer is working) and let D be a down time. Then the long-run proportion of time that the computer is working is ET/(ET +ED). By part (b) above, ET 60/. It suffices to find ED. To find ED, we consider the three possibilities for the part that fails: ED P (N )E[D N ] + P (N 2)E[D N 2] + P (N 3)E[D N 3] (6/)E[D N ] + (3/)E[D N 2] + (2/)E[D N 3] (6/) + (3/)2 + (2/)3 8/. Hence, ET/(ET + ED) (60/) (60/) + (8/) 60 78 30 39 0.769 (e) What is the long-run proportion of time that the computer is down waiting for an order of a new part? Again apply renewal theory. In particular, apply the renewal reward theorem. The longrun proportiuon of time can be found by the renewal reward theorem: We want /EC, where is the expected reward per cycle and EC is the expected length of a cycle. Here a 3

cycle is an up time plus a down time; i.e., EC ET + ED from the last part. Here P (N )E(D N ) (6/) 6/. So EC (6/) () 6 78 3 39. (f) What is the long-run proportion of time that part 2 is in a state of suspended animation (part 2 is working, but the computer is shut down)? This is a minor modification of the last part. We again use the renewal reward theorem, but now with a different reward. Now P (N )E(D N ) + P (N 3)E(D N 3) (6/) + (2/)3 2/. So EC (2/) () 2 78 6 39. (g) Suppose that new parts of type each cost $50; new parts of type 2 each cost $00; and new parts of type 3 each cost $400. What is the long-run average cost of replacement parts per week? This is yet another application of the renewal reward theorem. The cycle is the same as before, but now we have a new reward R. Now EC ET + ED P (N )50 + P (N 2)00 + P (N 3)400 (6/)50 + (3/)00 + (2/)400 (300/) + (300/) + (800/) 400/ 400 7.95 dollars per week 78 Solution to Problem 2. (a) The proportion of his driving time spent driving from A to B is E[T A,B ] E[T A,B ] + E[T B,A ], where E[T A,B ] is the expected time to drive from A to B, while E[T B,A ] is the expected time to drive from B to A. 4

To find E[T A,B ] and E[T B,A ], we use the elementary formula d rt (distance rate time). Let S be the driver s random speed driving from A to B. Then Similarly, E[T A,B ] 20 20 60 40 60 40 E[T A,B S s] ds d s ds d (ln(60) ln(40)) 20 d 20 (ln(3/2). E[T B,A ] 2 E[T B,A S 40] + 2 E[T B,A S 60] 2 ( d 40 + d 60 ) d 48 (b) Assume that a reward is earned at rate per unit time whenever he is driving at a rate of 40 miles per hour, we can again apply the renewal reward approach. If p is the long-run proportion of time he is driving 40 miles per hour, (/2)d/40 p E[T A,B ] + E[T B,A ] /80. ln(3/2) + /48 20 5