Hey there! Sign in to join this conversationNew here? Join for free
x Turn on thread page Beta
    Offline

    0
    ReputationRep:
    (Original post by bonjour04)
    Aha hopefully. Just realised we have game theory too *face palm*
    Game theory looks scary but actually isn't, it's just about learning how to set out a mixed strategy answer and then just practicing
    Offline

    0
    ReputationRep:
    Anyone else finding the linear programming at the end of the chapters really annoying? I can never remember what to do for each one!
    Offline

    0
    ReputationRep:
    (Original post by Lilmzbest)
    Oh you meant the one in the book! My bad i got SCBEDT, its a confusing one because both arcs BC and DE have backflow
    Since BC and DE have back flows is it possible for SCBEDT to be a flow augmenting route?
    Offline

    0
    ReputationRep:
    (Original post by imasha.sj)
    Can someone please explain to me the answer to Edexcel D2 examination style paper Q 2e?

    Is there any flow-augmenting route?

    Thank you
    Well, it says by inspection so consider the possible path.
    First, you look at the arcs leading away from the source node of which only SC is not saturated.
    Then, you look at the arcs from C; you can see that both CE and CF are saturated BUT you can use a backflow from CB.
    Then, you get a flow through BE. Now, the only way you can arrive at T is to use DT so you use another back flow from E to D, followed by DT.
    Thus, the answer is SCBEDT with value 3.

    On the side, is it a bad thing that I'm going to do no work on D2 until after my C2/S2 exam on the 24th of May?
    Offline

    0
    ReputationRep:
    (Original post by Epic Flawless)
    Well, it says by inspection so consider the possible path.
    First, you look at the arcs leading away from the source node of which only SC is not saturated.
    Then, you look at the arcs from C; you can see that both CE and CF are saturated BUT you can use a backflow from CB.
    Then, you get a flow through BE. Now, the only way you can arrive at T is to use DT so you use another back flow from E to D, followed by DT.
    Thus, the answer is SCBEDT with value 3.

    On the side, is it a bad thing that I'm going to do no work on D2 until after my C2/S2 exam on the 24th of May?
    Thanks I don't think it' bad as long as you are confident about the subject.

    Btw I don't get how a back flow can increase the value of the path.
    Offline

    2
    ReputationRep:
    (Original post by imasha.sj)
    Thanks I don't think it' bad as long as you are confident about the subject.

    Btw I don't get how a back flow can increase the value of the path.
    This probably won't make any sense but I'll say it anyway on the off-chance:

    Increasing backflow means there is more flow at the starting node (e.g. the node where the edge started). This means you can divert more flow to the other pipes that start at the node. This enables you to increase the total flow going through the path.
    Offline

    0
    ReputationRep:
    (Original post by knowledgecorruptz)
    This probably won't make any sense but I'll say it anyway on the off-chance:

    Increasing backflow means there is more flow at the starting node (e.g. the node where the edge started). This means you can divert more flow to the other pipes that start at the node. This enables you to increase the total flow going through the path.
    Can you please explain it a little bit more?
    Offline

    2
    ReputationRep:
    (Original post by imasha.sj)
    Can you please explain it a little bit more?
    Yeah it's kinda hard. Umm, well, here it goes:

    Imagine this network here:

    A-----------B
    |
    |
    |
    C

    So let's say you're at C and you take a backflow route back to A. Because you're going the opposite way, rather than increasing the flow you are decreasing it.

    This means that at point A, there is no more available flow (as less is now being given to C). This means there is more available for B, and so the flow can be increased through B, and the total value of the network flow may rise.
    Offline

    0
    ReputationRep:
    (Original post by knowledgecorruptz)
    Yeah it's kinda hard. Umm, well, here it goes:

    Imagine this network here:

    A-----------B
    |
    |
    |
    C

    So let's say you're at C and you take a backflow route back to A. Because you're going the opposite way, rather than increasing the flow you are decreasing it.

    This means that at point A, there is no more available flow (as less is now being given to C). This means there is more available for B, and so the flow can be increased through B, and the total value of the network flow may rise.
    Got it!!! Thank you soooooo much!!!!!
    Offline

    0
    ReputationRep:
    (Original post by Lilmzbest)
    Anyone else finding the linear programming at the end of the chapters really annoying? I can never remember what to do for each one!
    I've written out methods for formulating linear programming problems on my website (with examples) which can be found here http://www.mattsrevision.com/decision-2/

    Matt
    Offline

    0
    ReputationRep:
    (Original post by mattj94)
    I've written out methods for formulating linear programming problems on my website (with examples) which can be found here http://www.mattsrevision.com/decision-2/

    Matt
    Thanks for this, a nice concise explanation
    Offline

    0
    ReputationRep:
    Hey, has anybody done the mock paper? The mark scheme is really confusing me, especially Q5.
    Offline

    2
    ReputationRep:
    (Original post by mattj94)
    I've written out methods for formulating linear programming problems on my website (with examples) which can be found here http://www.mattsrevision.com/decision-2/

    Matt
    Awesome. And that's it right? That's all I need to do to score full marks on a linear programming question?
    Offline

    8
    (Original post by kashagupta)
    Actually so worried for this exam! Has anyone got any revision tips for it? Not many people seem to be sitting it for some reason?
    http://www.thestudentroom.co.uk/show....php?t=2013301

    A revision thread I started last year. Contains lots of papers etc.

    Here is a sheet of definitions; however, don't forget any definition from D1 'could' be asked.

    absolutely hammer the 3 different LP questions; Allocation, Transportation, Game theory. One is guaranteed to come up and it is gift marks if revised properly.
    Attached Files
  1. File Type: docx D2 Definitions to learn.docx (14.1 KB, 143 views)
    Offline

    8
    Another tip

    On GT questions. If you have row domination, say row 3 is deleted. Don't forget in your final answer to say...

    A should never play row 3.

    Easy mark to drop.
    Offline

    2
    ReputationRep:
    (Original post by Arsey)
    Another tip

    On GT questions. If you have row domination, say row 3 is deleted. Don't forget in your final answer to say...

    A should never play row 3.

    Easy mark to drop.
    Hi, do you know where I could find a list of D1 definitions? (just in case)

    Also, there's a link above which summarises LP - is that really everything? I know it's decision maths but it seems too easy for the 7/8 marks that are typically awarded.
    Offline

    8
    (Original post by knowledgecorruptz)
    Hi, do you know where I could find a list of D1 definitions? (just in case)

    Also, there's a link above which summarises LP - is that really everything? I know it's decision maths but it seems too easy for the 7/8 marks that are typically awarded.
    I haven't looked at the link yet but here are my D1 definitions
    Attached Files
  2. File Type: docx Definitions for the D1 Exam.docx (16.0 KB, 119 views)
    Offline

    8
    (Original post by knowledgecorruptz)
    Hi, do you know where I could find a list of D1 definitions? (just in case)

    Also, there's a link above which summarises LP - is that really everything? I know it's decision maths but it seems too easy for the 7/8 marks that are typically awarded.
    pretty much, although I would use Sigma notation in the first one too. Also you ought to say what i and j are, workers, tasks etc.

    You may need to put the Game Theory one into a simplex tableau too
    Offline

    0
    ReputationRep:
    Do is everyone ready for this exam ???? And how are you lot revising


    Posted from TSR Mobile
    Offline

    0
    ReputationRep:
    (Original post by Lubnahmasembe)
    Do is everyone ready for this exam ???? And how are you lot revising


    Posted from TSR Mobile
    I'm actually feeling quite good for this exam, for me i just make stupid calculation mistakes so i'm practicing doing things slowly and checking as i go along Otherwise i think the content is quite easy compared to other modules

    How's your revision going?
 
 
 
Reply
Submit reply
Turn on thread page Beta
Updated: June 11, 2013
Poll
Are you going to a festival?

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

Write a reply...
Reply
Hide
Reputation gems: You get these gems as you gain rep from other members for making good contributions and giving helpful advice.