Edexcel A2 D2 Mathematics June 2016 - Official Thread

thats what i thought but apparently its not like that......
he would rather play 4 than play 2

Can someone please do me a favour and tell me the exact thing they got for the last dynammic programming question

5225 i think?

i got 1700 and 5550 for dynamic programming.

- Simplex not optimal because you had -5s?
- Hungarian 248
- Flow one you got a flow Max flow of 62 and proved it with min cut, max flow theorem?
- Gametheory 0 does not equal -4 therefore it stable?
- North west corner method dummy with value 14 so they both are 99?

- Simplex not optimal because you had -5s?
- Hungarian 248
- Flow one you got a flow Max flow of 62 and proved it with min cut, max flow theorem?
- Gametheory 0 does not equal -4 therefore it stable?
- North west corner method dummy with value 14 so they both are 99?

- Simplex not optimal because you had -5s?
- Hungarian 248
- Flow one you got a flow Max flow of 62 and proved it with min cut, max flow theorem?
- Gametheory 0 does not equal -4 therefore it stable?
- North west corner method dummy with value 14 so they both are 99?

I think i had a brain fart on the augmented flow diagram. Couldn't find a route from S to T that allowed an extra 3 units to flow??

- Simplex not optimal because you had -5s?
- Hungarian 248
- Flow one you got a flow Max flow of 62 and proved it with min cut, max flow theorem?
- Gametheory 0 does not equal -4 therefore it stable?
- North west corner method dummy with value 14 so they both are 99?

Can you remember how you managed to increase the flow by three units? I couldnt find a route to increase any more than 2...