D2 6th June 2013

I can never tell which row/column to delete in the two person zero-sum matrices! Any advice in how to tell which one dominates which?


Posted from TSR Mobile

Has anyone noticed how question 7 in the June 2010 paper isn't on the mark scheme?


Posted from TSR Mobile

it is because if player X? is playing safe then his best option is to pick the highest point of the lowest lines, which in this case is where Y2 and Y3 meet. Therefore, Y should not play Y1.

Where is this question from?

I think it is common that they start the table off, however last years paper was a bit hideous if you hadn't practiced enough. Was a paragraph, no table no graph and they didn't start us off. So I think this year the dynamic programming will be easier. Im hoping there isn't going to be a huge constraint or game theory question.

Anyone got any tips of what might come up on this paper?

I'm thinking there might be some annoying definitions in there, since we haven't had those for a while.

Hoping for a dynamic programming question on a graph, instead of a table. We might also get linear programming on game theory?

By the way, is it common practice for Edexcel to help us out a bit on the dynamic programming questions? By usually starting off the table or something or telling us what state/stage/action actually is in the table headings, like on the last paper? That would make my life a bit easier :s

On the game theory linear programming formulating questions, could they tell us a specific method we have to use, or do we only need to know one of the methods?

They are never going to ask you to solve graphically as in D1. It is very unlikely you will have to use Simplex. Which means other than context Game Theory is always the same.

Could someone explain this question to me i mean the mark scheme why does it not include a zero.

Thanks,
Smith

Sorry, I meant as in you can either:

Let
$p_1 = P(A plays 1)$
$p_2 = P(A plays 2)$
$p_3 = P(A plays 3)$

or

$Let x_i=\frac{p_i}{v}$ and continue using this format.

They have the two methods in this mark scheme on page 167: http://www.edexcel.com/migrationdocuments/QP%20GCE%20Curriculum%202000/June09-ms/8371_9374_GCE_Maths_msc_20090717_UA021531.pdf

Because in D1 they could specify which method to use in linear programming (points testing or profit line), so could they do the same thing here by telling you which method you have to use to formulate it as a linear programming problem?

Very good idea, might start doing that

Oh don't do the second method, you can but don't.


Posted from TSR Mobile

Guys I just have a quick question if that is okay.

When you're calculating shadow costs and stuff, does it matter if you still have your original route in the table? I've seen some papers where the mark schemes has the shadow costs surrounding the original route. I've seen other mark schemes where the shadow costs surround a table which actually has the improvement indices in it.

Does it matter which way you show your shadow costs and improvement indices? Thanks.

EDIT: These cases are what I am referring to.





EDIT 2: Another question please if someone could answer it? In a hungarian algorithm question where there is data missing, does it matter what large value we assign to the missing data? Mark scheme was kind of specific about 60, and I had 55 or something.

Thanks!

It's just because I was doing a paper, (I think it was a Solomon paper) and it said define your objective function in terms of your decision variables, and the only method listed in the mark scheme was the second one. But I never really understood it, but if they can't specify which, then i'm happy with that . Thank you.

No it doesn't

I always surround the table with SC and put II inside the table.


Posted from TSR Mobile