Problems Markov Chains 2

Slides:



Advertisements
Similar presentations
MARKOV ANALYSIS Andrei Markov, a Russian Mathematician developed the technique to describe the movement of gas in a closed container in 1940 In 1950s,
Advertisements

Discrete time Markov Chain
ST3236: Stochastic Process Tutorial 3 TA: Mar Choong Hock Exercises: 4.
Lecture 6  Calculating P n – how do we raise a matrix to the n th power?  Ergodicity in Markov Chains.  When does a chain have equilibrium probabilities?
Continuous-Time Markov Chains Nur Aini Masruroh. LOGO Introduction  A continuous-time Markov chain is a stochastic process having the Markovian property.
A Game Theoretic Model of Strategic Conflict in Cyberspace Operations Research Department Naval Postgraduate School, Monterey, CA 80 th MORS 12 June, 2012.
1 Chapter 5 Continuous time Markov Chains Learning objectives : Introduce continuous time Markov Chain Model manufacturing systems using Markov Chain Able.
INDR 343 Problem Session
Project Management. Maintenance and Reliability 14 Aug 2001.
Topics Review of DTMC Classification of states Economic analysis
Lecture 12 – Discrete-Time Markov Chains
TCOM 501: Networking Theory & Fundamentals
Solutions Markov Chains 1
10.3 Absorbing Markov Chains
IEG5300 Tutorial 5 Continuous-time Markov Chain Peter Chen Peng Adapted from Qiwen Wang’s Tutorial Materials.
What is the probability that the great-grandchild of middle class parents will be middle class? Markov chains can be used to answer these types of problems.
INDR 343 Problem Session
Reliable System Design 2011 by: Amir M. Rahmani
Markov Processes Homework Solution MGMT E
Final Exam Due: December 14 (Noon), 2004
INDR 343 Problem Session
Limiting probabilities. The limiting probabilities P j exist if (a) all states of the Markov chain communicate (i.e., starting in state i, there is.
Facility Maintenance. Typical Job Categories for Maintenance Plant Maintenance General Mechanics Machinists Sheet Metal Workers Welders Electronics Technicians.
 Group 3 Vahe Karapetyan Dena Rad Eidin Balali Patrick Njathi Zhong Zheng Damilare Adeoye Operations Research & Linear Programming Agenda Introduction.
Lecture 11 – Stochastic Processes
Solutions Queueing Theory 1
Machine Shop Model. Lecture Two by: Lecturer/ Nada Ahmed.
CDA6530: Performance Models of Computers and Networks Examples of Stochastic Process, Markov Chain, M/M/* Queue TexPoint fonts used in EMF. Read the TexPoint.
Statistics & Econometrics Statistics & Econometrics Statistics & Econometrics Statistics & Econometrics Statistics & Econometrics Statistics & Econometrics.
CH – 11 Markov analysis Learning objectives:
NETE4631:Capacity Planning (2)- Lecture 10 Suronapee Phoomvuthisarn, Ph.D. /
Manijeh Keshtgary. Queuing Network: model in which jobs departing from one queue arrive at another queue (or possibly the same queue)  Open and Closed.
TexPoint fonts used in EMF.
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.
© 2015 McGraw-Hill Education. All rights reserved. Chapter 19 Markov Decision Processes.
CIS 540 Principles of Embedded Computation Spring Instructor: Rajeev Alur
1 Markov chains and processes: motivations Random walk One-dimensional walk You can only move one step right or left every time unit Two-dimensional walk.
CS433 Modeling and Simulation Lecture 07 – Part 01 Continuous Markov Chains Dr. Anis Koubâa 14 Dec 2008 Al-Imam.
CS433 Modeling and Simulation Lecture 11 Continuous Markov Chains Dr. Anis Koubâa 01 May 2009 Al-Imam Mohammad Ibn Saud University.
Asst. Professor in Mathematics
Markov Games TCM Conference 2016 Chris Gann
Lecture PowerPoint Slides Basic Practice of Statistics 7 th Edition.
© 2015 McGraw-Hill Education. All rights reserved. Chapter 17 Queueing Theory.
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.
Planning and Scheduling.  A job can be made up of a number of smaller tasks that can be completed by a number of different “processors.”  The processors.
Theory of Computational Complexity Probability and Computing Lee Minseon Iwama and Ito lab M1 1.
5 Why analysis By its very nature, a Lean Six Sigma program requires a number of changes throughout the organization. That’s what we are trying to do right?
Problems Markov Chains ) Given the following one-step transition matrices of a Markov chain, determine the classes of the Markov chain and whether.
Discrete-time Markov chain (DTMC) State space distribution
Discrete-time markov chain (continuation)
Discrete Time Markov Chains
Solutions Markov Chains 1
Solutions Queueing Theory 1
TexPoint fonts used in EMF.
Facility Maintenance. Typical Job Categories for Maintenance Plant Maintenance General Mechanics Machinists Sheet Metal Workers Welders Electronics Technicians.
Solutions Markov Chains 1
Solutions Queueing Theory 1
Problem Markov Chains 1 A manufacturer has one key machine at the core of its production process. Because of heavy use, the machine.
Solutions Markov Chains 1
Solutions Markov Chains 1
Solutions Markov Chains 2
Solutions Queueing Theory 1
Planning and Scheduling
Problem Markov Chains 1 A manufacturer has one key machine at the core of its production process. Because of heavy use, the machine.
Planning and Scheduling
UML State Diagrams.
Discrete-time markov chain (continuation)
Solutions Markov Chains 6
TexPoint fonts used in EMF.
Markov Chains & Population Movements
Presentation transcript:

Problems 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 are recurrent.

Solutions Markov Chains 6 4) A computer is inspected at the end of every hour. It is found to be either working (up) or failed (down). If the computer is found to be up, the probability of its remaining up for the next hour is 0.90. It it is down, the computer is repaired, which may require more than one hour. Whenever, the computer is down (regardlewss of how long it has been down), the probability of its still being down 1 hour later is 0.35. a. Construct the one-step transition probability matrix. b. Find the expected first passage time from i to j for all i, j.

Solutions Markov Chains 10 5) A manufacturer has a machine that, when operational at the beginning of a day, has a probability of 0.1 of breaking down sometime during the day. When this happens, the repair is done the next day and completed at the end of that day. a. Formulate the evolution of the status of the machine as a 3 state Markov Chain. b. Fine the expected first passage times from i to j. c. Suppose the machine has gone 20 full days without a breakdown since the last repair was completed. How many days do we expect until the next breakdown/repair?

Ch 12, #3a 6. A military maintenance depot overhauls tanks. There is room for three tanks in the facility and one tank in an overflow area outside. At most four tanks can be at the depot at one time. Every morning a tank arrives for an overhaul. If the depot is full, however, it is turned away, so no arrivals occur under these circumstances. When the depot is full, the entire overhaul schedule is delayed 1 day. On any given day, the following probabilities govern the completion of overhauls. Number of tanks completed 0 1 2 3 Probability 0.2 0.4 0.3 0.1 These values are independent of the number of tanks in the depot, but obviously no more tanks than are waiting at the start of the day can be completed. Develop a Markov chain model for this situation. Begin by defining the state to be the number of tanks in the depot at the start of each day (after the scheduled arrival). Draw the network diagram and write the state-transition matrix.