Exam Flashcards
Create a linprog program based on
max 6š„ ā š¦
s. t. 4š¦ ā š„ ā„ 10
2š„ + š¦ ā¤ 10
2š¦ ā š„ ā¤ 5
š„, š¦ ā ā
f = [-6 1]
A = [1 -4;2 1;-1 2]
b = [-10 10 5]
linprog(f,A,b)
Probability shop is empty
is just p0
probability queue is empty
all shop employees are used
aka if 4 shop employies: p0+p1+p2+p3
aka p0(1+c1+c2+c3+c4)
newtons step
minimise š(š”) = š(š„0 ā š”šā²(š„0))
šā²(š”) = šā²(š„0 ā š”šā²(š„0))(āšā²(š„0)) = 0
solve for t
š” = (š„0 ā šš)/šā²(š„0)
find the smallest positive optimal step size for k
š„1 = š„0 ā tšā²(š„0) = š„0 ā [(š„0 ā š)/šā²(š„0)]šā²(š„0)
mean service
times
W-Wq