sol7 - EE292 Analysis & Control of Markov Chains Prof. Ben...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
EE292 Spring 2006 June 7 , 2006 Prof. Ben Van Roy Homework Assignment 7 : Solutions 1 We use the notation s for our state variable; x for queue length, i to indicate on/off. S = { ( x, i ) : x ∈ { 0 , 1 , . . . , 100 } , i ∈ { on, off }} . Further, p ( x, on ) , ( x +1 , off ) ( off ) = 0 . 75 for x < 100 p ( x, on ) , ( x, off ) ( off ) = 0 . 25 for x < 100 p ( x, on ) , ( x, off ) ( off ) = 1 for x = 100 p ( x, on ) , ( x, on ) ( on ) = 0 . 75 for x 100 p ( x, on ) , (( x - 1) + , on ) ( on ) = 0 . 25 for x 100 p ( x, off ) , ( x, on ) ( on ) = 0 . 75 for x 100 p ( x, off ) , (( x - 1) + , on ) ( on ) = 0 . 25 for x 100 p ( x, off ) , ( x +1 , off ) ( off ) = 0 . 75 for x < 100 p ( x, off ) , ( x, off ) ( off ) = 0 . 25 for x < 100 p ( x, off ) , ( x, off ) ( off ) = 1 for x = 100 . The costs g ( s, u ) are immediate from the question. Define h ( s, u ) = 1 if x > 10 . We then have the following linear program: min s ∈S u U
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/15/2011 for the course EECS 6.231 taught by Professor Bertsekas during the Spring '10 term at MIT.

Page1 / 2

sol7 - EE292 Analysis & Control of Markov Chains Prof. Ben...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online