You are Here: Home >< Maths

# D2 6th June 2013 watch

1. If we get given a dynamic programming problem from a table, will they always hint as to what the state etc is? If not how do we work it out?
2. (Original post by Knoyle quiah)
What do u mean 2 tables per iteration? so for example, 2 tables of the exact same iteration (theoretically same values) to double check values??
What I do (which is what I think Arsey also meant when he said two tables) is first you divide the pivot row, and then rewrite the table in the same way as the old one, just with the new pivot row. Then you do the other row operations. This way you don't have to look between two different tables and so you are less likely to make mistakes. If you have the textbook, I think it's how they do the first few examples, and then they show you how to do it with one table per iteration.
3. (Original post by brittanna)
What I do (which is what I think Arsey also meant when he said two tables) is first you divide the pivot row, and then rewrite the table in the same way as the old one, just with the new pivot row. Then you do the other row operations. This way you don't have to look between two different tables and so you are less likely to make mistakes. If you have the textbook, I think it's how they do the first few examples, and then they show you how to do it with one table per iteration.
i have been doing it from 2 tables all this time i havnt looked in the text book for over a month but i remember seeing what u said in the text book, this sounds like a much less complicated idea, doing from 2 tables kills me every time
4. (Original post by Knoyle quiah)
i have been doing it from 2 tables all this time i havnt looked in the text book for over a month but i remember seeing what u said in the text book, this sounds like a much less complicated idea, doing from 2 tables kills me every time
I find that using two tables helps me, but if you find it easier with one table, then I would use that .
5. Am I the only one who HATES tables of least distances?

I always get paranoid that there's a quicker route...
6. Guess who just got their first ever 100% in a decision maths paper .
7. (Original post by Hamburglar)
Am I the only one who HATES tables of least distances?

I always get paranoid that there's a quicker route...
mhmm, only problem with me is, my paranoia is correct, because I ALWAYS miss one
8. (Original post by Knoyle quiah)
yeah correct mark scheme wrong
That's another markscheme wrong
Smith
9. (Original post by brittanna)
Guess who just got their first ever 100% in a decision maths paper .
Well done which paper may i ask
Smith
10. (Original post by smith50)
Well done which paper may i ask
Smith
Thanks, now I just need to do that in the real thing . It was the June 2011 Paper.
11. (Original post by brittanna)
Thanks, now I just need to do that in the real thing . It was the June 2011 Paper.
I reckon for the flows question we may be have to use super sources/sinks never come up so we may be the first
Smith
12. (Original post by brittanna)
What I do (which is what I think Arsey also meant when he said two tables) is first you divide the pivot row, and then rewrite the table in the same way as the old one, just with the new pivot row. Then you do the other row operations. This way you don't have to look between two different tables and so you are less likely to make mistakes. If you have the textbook, I think it's how they do the first few examples, and then they show you how to do it with one table per iteration.
Yeah i always get confused because of all the comparing tables, but i just put pencils under the 2 rows i'm using so i can focus on them, and then go back on my calculator to check i've used all the right values
13. (Original post by Hamburglar)
Classical = Visiting each vertex only once. Practical = Visiting each vertex at least once. If you have a classical problem, then you also have a practical problem.

The reason it gets converted to a classical problem is because the algorithms used visit each vertex only once. Nearest neighbour starts at a vertex, visits every other vertex once only and returns to the start.

However, finding a lower bound by using RMST + 2 smallest arcs doesn't give you a classical problem - that is why they say it is not a viable solution. This is also why when dealing with inequalities, it is strict with respect to the lower bound, but inclusive of the upper bound.

Hope this helps
Thank you! Just one thing though- isn't it a non-viable solution because normally it doesn't give a tour? And if it does then it's an optimal solution? ( I though that was why it had a strict inequality for the lower bound)
14. (Original post by Mallika)
Thank you! Just one thing though- isn't it a non-viable solution because normally it doesn't give a tour? And if it does then it's an optimal solution? ( I though that was why it had a strict inequality for the lower bound)
Yeah, that's exactly it. If it does give a tour, then the lower bound is viable, and since it's therefore the lowest possible value, it is the optimal solution.
15. Hi, Can anyone tell me why they have chosen to use r as their pivot ROW, I always divide the value by the column numbers and use the smallest one but for this problem they would all be equal?!
Attached Images

16. (Original post by ChelseaSam)
Hi, Can anyone tell me why they have chosen to use r as their pivot ROW, I always divide the value by the column numbers and use the smallest one but for this problem they would all be equal?!
In that case you can choose any of the rows. It makes no difference.
17. Also, Can anyone tell me if doing row operations like this would be credited all the marks? The answer is correct.
Attached Images

18. (Original post by knowledgecorruptz)
In that case you can choose any of the rows. It makes no difference.
I thought that was the case but wanted to check. Thanks
19. (Original post by Mallika)
Thank you! Just one thing though- isn't it a non-viable solution because normally it doesn't give a tour? And if it does then it's an optimal solution? ( I though that was why it had a strict inequality for the lower bound)
That's alright. And yeah you're correct, which is why normally it would be a loose inequality with respect to the lower bound.

If it does give a tour then you have an optimal solution. The thing is, they'd never ask you to write this as an inequality in the exam then, because you have actually found the optimal solution.

But yes if you were to write it as an inequality, then it would be strict with respect to the lower bound if you found a tour. Like I said though, writing it as an inequality makes no sense because you don't need a range of values, you have the optimal solution. (Very rare)
20. (Original post by Hamburglar)
That's alright. And yeah you're correct, which is why normally it would be a loose inequality with respect to the lower bound.

If it does give a tour then you have an optimal solution. The thing is, they'd never ask you to write this as an inequality in the exam then, because you have actually found the optimal solution.

But yes if you were to write it as an inequality, then it would be strict with respect to the lower bound if you found a tour. Like I said though, writing it as an inequality makes no sense because you don't need a range of values, you have the optimal solution. (Very rare)
Thank you again, I think I understand :P
Another question if you don't mind

I was doing practice paper B and saw the LP question was unbalanced- this means if you were asked to solve it using simplex you would need to add slack variables right?
If the supply=demand and the question was balanced, would you still use inequalities or use an equals sign? In the textbook they use inequality signs (so in theory you would need to add slack variables if you were to solve it) but wouldn't they all be 0?

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: June 11, 2013
Today on TSR

### Struggling to get going with your revision?

Get going with the all day revision thread

### Uni strikes! How do they affect you?

Discussions on TSR

• Latest
Poll
Useful resources

Can you help? Study help unanswered threadsStudy Help rules and posting guidelinesLaTex guide for writing equations on TSR

## Groups associated with this forum:

View associated groups
Discussions on TSR

• Latest

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