Рисуют деревья слева направо. Места, где принимаются решения, обозначают квадратами □, места появления исходов – кругами ○, возможные решения – пунктирными линиями ----, возможные исходы – сплошными линиями
EMV(F) = 0, 4 × 200 + 0, 6 × (-150) = -10
EMV(F) = 0, 4 × 200 + 0, 6 × (-150) = -10 EMV(G) = 0
EMV(F) = 0, 4 × 200 + 0, 6 × (-150) = -10 EMV(G) = 0 EMV(4) = max {EMV(F), EMV(G)} = max {-10, 0} = 0 = EMV(G)
EMV(F) = 0, 4 × 200 + 0, 6 × (-150) = -10 EMV(G) = 0 EMV(4) = max {EMV(F), EMV(G)} = max {-10, 0} = 0 = EMV(G) EMV(B) = 0, 9 × 200 + 0, 1 × (-150) = 180 – 15 = 165 EMV(С) = 0
EMV(F) = 0, 4 × 200 + 0, 6 × (-150) = -10 EMV(G) = 0 EMV(4) = max {EMV(F), EMV(G)} = max {-10, 0} = 0 = EMV(G) EMV(B) = 0, 9 × 200 + 0, 1 × (-150) = 180 – 15 = 165 EMV(С) = 0 EMV(2) = max {EMV(В), EMV(С)} = max {165, 0} = 165 = EMV(B)
EMV(F) = 0, 4 × 200 + 0, 6 × (-150) = -10 EMV(G) = 0 EMV(4) = max {EMV(F), EMV(G)} = max {-10, 0} = 0 = EMV(G) EMV(B) = 0, 9 × 200 + 0, 1 × (-150) = 180 – 15 = 165 EMV(С) = 0 EMV(2) = max {EMV(В), EMV(С)} = max {165, 0} = 165 = EMV(5) EMV(D) = 0, 2 × 200 + 0, 8 × (-150) = 40 – 120 = -80 EMV(E) = 0
EMV(F) = 0, 4 × 200 + 0, 6 × (-150) = -10 EMV(G) = 0 EMV(4) = max {EMV(F), EMV(G)} = max {-10, 0} = 0 = EMV(G) EMV(B) = 0, 9 × 200 + 0, 1 × (-150) = 180 – 15 = 165 EMV(С) = 0 EMV(2) = max {EMV(В), EMV(С)} = max {165, 0} = 165 = EMV(5) EMV(D) = 0, 2 × 200 + 0, 8 × (-150) = 40 – 120 = -80 EMV(E) = 0 EMV(3) = max {EMV(D), EMV(E)} = max {-80, 0} = 0 = EMV(E)