Hey there! Sign in to join this conversationNew here? Join for free
    Offline

    1
    ReputationRep:
    (Original post by mathswiz:))
    Glad i could help I have done the dynamic programming question but the file is too big
    e done the dynamic programming question but the file is too big [/QUOTE]




    Oh that's a shame could you print screen your table i just want to compare tables please
    Thanks,
    Smith
    Offline

    0
    ReputationRep:
    (Original post by smith50)
    e done the dynamic programming question but the file is too big



    Oh that's a shame could you print screen your table i just want to compare tables please
    Thanks,
    Smith[/QUOTE]

    Finally found a way to save them as pictures, hope they open
    Attached Images
      
    Offline

    0
    ReputationRep:
    Can someone possibly explain why the June 2009 paper has such low boundaries? 65/75 for an A*, and 73/75 for 100 UMS.

    I just did it and it seemed ridiculously easy: no simplex at all and half of the dynamic programming is done for you. What gives? :s
    Offline

    1
    ReputationRep:
    (Original post by mathswiz:))
    Oh that's a shame could you print screen your table i just want to compare tables please
    Thanks,
    Smith
    Finally found a way to save them as pictures, hope they open [/QUOTE]

    Thank you so much
    Smith
    Offline

    0
    ReputationRep:
    does anyone have a copy of definitions and jus writing stuff which is worth like a mark, i knw it hasnt come up recently but jus to be sfe
    Offline

    1
    ReputationRep:
    Could you guys help me with this question Name:  D2 practise paper A.PNG
Views: 79
Size:  55.8 KB please
    Thanks,
    Smith
    Offline

    0
    ReputationRep:
    (Original post by smith50)
    Could you guys help me with this question Name:  D2 practise paper A.PNG
Views: 79
Size:  55.8 KB please
    Thanks,
    Smith
    Draw on the arc EJ with capacity 5, then look for how much spare capacity you can have going along this arc. Remember that everything going into an arc must equal everything coming out of the arc. You want to work out what is the maximum flow you can get through the arc EJ and then the same for the arc FH.


    Posted from TSR Mobile
    Offline

    0
    ReputationRep:
    (Original post by sl96)
    does anyone have a copy of definitions and jus writing stuff which is worth like a mark, i knw it hasnt come up recently but jus to be sfe
    http://www.thestudentroom.co.uk/show....php?t=2013301


    Posted from TSR Mobile
    Offline

    1
    ReputationRep:
    Could anyone help me on this
    QP:Name:  Fw.PNG
Views: 70
Size:  11.4 KB
    MS:Name:  FW2.PNG
Views: 66
Size:  43.8 KB
    Thanks,
    Smith
    Offline

    0
    ReputationRep:
    Guys can anyone tell me if we ever work with the classical problem?

    I was doing a past paper and there was a short-cuts question. I got worried because I thought we weren't allowed to visit already used vertices, but it turns out it was the practical problem thankfully.

    Is this always the case in D2 problems? Thanks
    Offline

    1
    ReputationRep:
    (Original post by Hamburglar)
    Guys can anyone tell me if we ever work with the classical problem?

    I was doing a past paper and there was a short-cuts question. I got worried because I thought we weren't allowed to visit already used vertices, but it turns out it was the practical problem thankfully.

    Is this always the case in D2 problems? Thanks
    Use the classical problem for complete graphs satisfying the triangle inequality.
    Smith
    Offline

    0
    ReputationRep:
    (Original post by smith50)
    Use the classical problem for complete graphs satisfying the triangle inequality.
    Smith
    Oh, yeah but that is just finding least distances and stuff isn't it?

    I'm mainly on about the three algorithms: nearest neighbour, RMST and MST + Shortcuts.

    I think nearest neighbour is always classical because you always visit unique vertices.

    I'm mainly worried about finding a spanning tree and shortcuts, because I hope that is always practical. If it was classical then that would be a bit of a mess...
    Offline

    0
    ReputationRep:
    Guys, just want to ask something real quick.

    You know when you're working with the hungarian algorithm in a maximising problem, does it matter what number you pick to subtract the other elements from? I pick the largest number, but often mark schemes pick a number that is 1 larger and all my numbers are different by 1.

    Does this matter? I'm worried it'll get marked wrong or something - thanks.

    Also, is it just me or is the mock mark scheme a bit dodgy? :s The simplex question in particular
    Offline

    16
    ReputationRep:
    (Original post by Hamburglar)
    Guys, just want to ask something real quick.

    You know when you're working with the hungarian algorithm in a maximising problem, does it matter what number you pick to subtract the other elements from? I pick the largest number, but often mark schemes pick a number that is 1 larger and all my numbers are different by 1.

    Does this matter? I'm worried it'll get marked wrong or something - thanks.

    Also, is it just me or is the mock mark scheme a bit dodgy? :s The simplex question in particular
    For the Hungarian algorithm, I think you can choose any number, as long as it is at least as big as the largest number in the matrix. You basically want the initially largest number to be the smallest one, and the initially smallest one to be the largest. Do you usually get the correct numbers after you have reduced the rows and columns?
    Offline

    0
    ReputationRep:
    (Original post by brittanna)
    For the Hungarian algorithm, I think you can choose any number, as long as it is at least as big as the largest number in the matrix. You basically want the initially largest number to be the smallest one, and the initially smallest one to be the largest. Do you usually get the correct numbers after you have reduced the rows and columns?
    I think my final allocation was correct, and I feel as though my tables were correct too It's just the mark scheme seems to be a bit dodgy for the mock paper :s

    But okay cool, thanks!

    I was just wondering if you might be able to quickly answer this one too? When you're doing simplex and they say you should use the smallest positive value of theta for the pivot row - well, does this include zero as well?
    Offline

    16
    ReputationRep:
    (Original post by Hamburglar)
    I think my final allocation was correct, and I feel as though my tables were correct too It's just the mark scheme seems to be a bit dodgy for the mock paper :s

    But okay cool, thanks!

    I was just wondering if you might be able to quickly answer this one too? When you're doing simplex and they say you should use the smallest positive value of theta for the pivot row - well, does this include zero as well?
    I'm not sure. I always thought it had to be positive (so greater than zero), and the textbook also says positive as well. But then when you're doing game theory ones, you have to use a zero. So i'm guessing that you don't use zero, unless you're solving a game theory simplex question.
    Offline

    0
    ReputationRep:
    (Original post by brittanna)
    I'm not sure. I always thought it had to be positive (so greater than zero), and the textbook also says positive as well. But then when you're doing game theory ones, you have to use a zero. So i'm guessing that you don't use zero, unless you're solving a game theory simplex question.
    Ah I see in the book now, they do use zero in the game theory questions. Thanks

    I would assume this means that you use zero in any other linear programming question too though? It's basically the same thing :s
    Offline

    0
    ReputationRep:
    (Original post by smith50)
    Could anyone help me on this
    QP:Name:  Fw.PNG
Views: 70
Size:  11.4 KB
    MS:Name:  FW2.PNG
Views: 66
Size:  43.8 KB
    Thanks,
    Smith
    Hello just wondering where these questions are from , the old edexcel d1? solomon?
    Offline

    0
    ReputationRep:
    Anybody have any advice on flow diagrams in terms of presentation?

    Usually there's a question which says, start the procedure by entering values at these points. But then you have to use this diagram to find a flow and the original values get lost, in a giant sea of numbers and commas. How on earth is the examiner supposed to see what is going on? xD
    Offline

    0
    ReputationRep:
    (Original post by Hamburglar)
    Anybody have any advice on flow diagrams in terms of presentation?

    Usually there's a question which says, start the procedure by entering values at these points. But then you have to use this diagram to find a flow and the original values get lost, in a giant sea of numbers and commas. How on earth is the examiner supposed to see what is going on? xD
    Feel exactly the same way. When i use the flow augmenting procedure I have to change the flow values accordingly for every route i use and if i initaially had to label the diagram the original values are lost. Getting paranoid about this

    Posted from TSR Mobile
 
 
 
  • See more of what you like on The Student Room

    You can personalise what you see on TSR. Tell us a little about yourself to get started.

  • Poll
    Are unpaid trial work shifts fair?
  • See more of what you like on The Student Room

    You can personalise what you see on TSR. Tell us a little about yourself to get started.

  • 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

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