x Turn on thread page Beta
 You are Here: Home >< Maths

Edexcel A2 D2 Mathematics June 2016 - Official Thread watch

1. (Original post by fpmaniac)
Sorry for all the rookie questions, but how did they find the empty arc without going through augmenting process. In the book they have augmented one route then another route and then carried on until the Vertices after the first one all have saturated arcs.
in order to find a maximum flow, sometimes you have to reduce some flow routes in order to maximise another.

i dont know what you mean by how did they find the empty arc
2. Guys, I have a question. For dynamic programming, is it possible to get a maximin or minimax Question that's based on table(s) and not a diagraph / network ???????? or are tables only for maximum and minimum questions?
3. (Original post by NotNotBatman)
Actually I think I understand it now. You're changing the direction of the flow, so that every arc in the route following A would have an extra 2 added to the flow.
Yup that's it!!
4. (Original post by yesyesyesno)
Guys, I have a question. For dynamic programming, is it possible to get a maximin or minimax Question that's based on table(s) and not a diagraph / network ???????? or is tables only for maximum and minimum questions?
You can get maximin/ minimax in worded problems too! Trying to learn it now
5. (Original post by TrueDAN)
You can get maximin/ minimax in worded problems too! Trying to learn it now
How can I?

There's never been a maximin/minimax problem for a table question, according to all of the past questions by topic anyways.
How would minimax and maximin for table and worded questions work?
6. (Original post by yesyesyesno)
How can I?

There's never been a maximin/minimax problem for a table question, according to all of the past questions by topic anyways.
How would minimax and maximin for table and worded questions work?
Just found it now! Page 225 on the textbook.
7. (Original post by TrueDAN)
No you can't I think sorry!!! Haha
are you are sure?
this is actually confusing me
8. Definitions?
9. (Original post by KloppOClock)
in order to find a maximum flow, sometimes you have to reduce some flow routes in order to maximise another.

i dont know what you mean by how did they find the empty arc
Dont worry I just got confused...I realised what I did wrong
10. Is it in anyway possible a game theory simplex question could come up?
11. Does anyone recommend drawing a diagram for DP through tables because I dont understand it no matter how much I try
12. (Original post by ReeceFraser)
Is it in anyway possible a game theory simplex question could come up?
13. (Original post by fpmaniac)
Does anyone recommend drawing a diagram for DP through tables because I dont understand it no matter how much I try
whats your problem with it
14. (Original post by KloppOClock)
whats your problem with it
First of all I cant even list the state stage action and destination...
Then its actually applying it to the problem
15. (Original post by fpmaniac)
First of all I cant even list the state stage action and destination...
Then its actually applying it to the problem
Same here, I mean how on earth am I supposed to know? and they are around 13 marks usually.
Sometimes they are generous though and give the first row of working and it can be worked out from there, I'm hoping we get that tomorrow.
16. (Original post by ReeceFraser)
Is it in anyway possible a game theory simplex question could come up?
(Original post by mxixbl)
It has only been tested once since 2002. Never on current-spec papers. It's a very rare question indeed.

But it is on the spec.

You will be guided through it. And there'll be simplex tableaux in the answer book. So you'll have no bother doing it.
17. Please can anyone explain question 17b here https://1cb7ab25ef4ef909bacd98c7d41a...ZuaGc/REV2.pdf I don't understand how one of the states for October can be 3 because in September none of the destinations are 3 so surely it wouldn't be possible to have 3 in stock at the start of October? Thanks
Can anyone help please?
18. (Original post by NotNotBatman)
Same here, I mean how on earth am I supposed to know? and they are around 13 marks usually.
Sometimes they are generous though and give the first row of working and it can be worked out from there, I'm hoping we get that tomorrow.
Well you could try if you are really really stuck on it, drawing a diagram to illustrate. It will take longer but its better than nothing I guess. Thats my back up plan. Do you know any questions where they dont give you the first row?
19. (Original post by fpmaniac)
Well you could try if you are really really stuck on it, drawing a diagram to illustrate. It will take longer but its better than nothing I guess. Thats my back up plan. Do you know any questions where they dont give you the first row?
I've only done 3 papers, of those only June 2012 didn't have the first row, but they did give you the definitions of stage, state actions and destination in brackets.
It was the storage type; having done 2 examples of these, I think they are always the same.
20. How come in dynamic programming you have to start at the end and then work backwards? Why not work forwards? I know it's not a question that will come up but I have always wondered why and it was never explained to us.

Turn on thread page Beta
TSR Support Team

We have a brilliant team of more than 60 Support Team members looking after discussions on The Student Room, helping to make it a fun, safe and useful place to hang out.

This forum is supported by:
Updated: August 14, 2016
Today on TSR

Loughborough better than Cambridge

Loughborough at number one

Can I date a girl with no boobs?

Poll
Useful resources

The Student Room, Get Revising and Marked by Teachers are trading names of The Student Room Group Ltd.

Register Number: 04666380 (England and Wales), VAT No. 806 8067 22 Registered Office: International House, Queens Road, Brighton, BN1 3XE