(Original post by Arsey)
D2 May 2012
Overall I think this was a fair paper. However, it did take a very long time to complete.
So I would imagine quite a few candidates will have run out of time and dropped big marks
on the linear programming question.
Trickyish in that it was a 5x5 matrix and it weirdly went from 3 lines to 5 lines.
It also took a long time.
The first stepping stone path was weird and it was odd that it wasn't optimal; otherwise okay.
Pretty easy but it was fraction city
I doubt many people will get part c) correct. Stating no negatives in the profit row will not be sufficent.
Q5 Game Theory
What a great question.
Fairly standard, I very much doubt many people will have reduced to a 2x2 game, using the well graph will be fine.
Pretty standard, fairly easy
Q7 Linear Programming (Allocation)
Very, very, very easy if you learnt it. It was on the 2011 paper.
4x4 was a bit mean and involved unnecessary extra writing.
Q8 Dynamic Programming
Order book... don't say you were not warned.
As order book questions go it was easy, but I still think it will be poorly answered due to candidates rushing it.
Last few June boundaries were 64, 61, 57 for 80ums
It certainly wasn't more difficult than last year so I will guess at
100ums - 75
90ums - 70
80ums - 65
70ums - 57
60ums - 50
50ums - 43
40ums - 36
This thread will be locked at somepoint and then unlocked at midnight following the Decision 2 examination. I will upload the paper and my solutions to this post.
I will do my best to answer questions about the paper but please try to read the thread first so that I am not answering the same questions lots of times.