The Student Room Group
Uni students - Complete our survey >>
Uni students - Complete our survey >>
Uni students - Complete our survey >>

Edexcel A2 D2 Mathematics June 2016 - Official Thread

Scroll to see replies

Reply 240
Avatar for 8752
8752
1
Original post by Historygcse
I got that. Was the final solution optimal?


yes because all my improvement indices were positive
Reply 241
Avatar for 8752
8752
1
Original post by anonymous2410
What did you guys get for the profit of the last question? i got 900 something


£5550. total revenue - total costs (minimum cost was £1700 for the dynamic programming)
Original post by Historygcse
I got that. Was the final solution optimal?


Yes
Reply 243
Avatar for 8752
8752
1
For the question on game theory when it asked you to formulate it as a linear programming problem (the question before you had to put it in the simplex) did it say write your answer as inequalities or equalities??
Original post by 8752
£5550. total revenue - total costs (minimum cost was £1700 for the dynamic programming)


werent there two costs? one for material and the other was time
My answers:

1. Classical - each vertex only visited once, practical - vertices can be revisited
Nearest neighbour lengths - 158 and 149
Lower bound = 86 (RMST) + 27 (Shortest arcs from A) = 113
113<optimal<=149

2. Initial flow = 59
C1 = 72
C2 = 86
New flow = 62, Cut = 62 so maximum due to minimum cut = maximum flow theorem

3. Alexa - 2, Ewan - 4, Faith - 1, cant remember - 3
maximum score = 248

4. Pivot row = R1
P+13....-5s=27
P=5s......
increasing s would increase P so not optimal

5. ....

6. Row minimums = ..... Row maximin = 0
Column maximums = ...... Column minimax = 4
0=/=4 so Row maximin =/= Column minimax so not stable

Let p1 be the probability with which A plays 1, p2 be the probability with which A plays 2 and p3 be the probability with which A plays 3 with p1,p2,p3>=0

Let v be the value of the original game to A
Let V=v+5 be the value of the new game to A

Maximise P-V=0

Subject to V - ...... + r = 0
V - ...... + r = 0
V - ...... + s = 0
V - ...... + t = 0
p1 + p2 + p3 + u = 1

7. Cost = 1700, 3,3,5,5,3
Profit = 5550
Original post by 8752
For the question on game theory when it asked you to formulate it as a linear programming problem (the question before you had to put it in the simplex) did it say write your answer as inequalities or equalities??


It said equalities
Reply 247
Avatar for 8752
8752
1
Original post by anonymous2410
werent there two costs? one for material and the other was time


Yes. total revenue = (19*700)=13300
Total cost of material= (200*19)= 3800
Total cost for time= (5*450)=2250
Minimum cost for production in the previous questio= 1700
total revenue-all the costs above=5550
Original post by lukejoshjames
For the optimal length in question 1, the boundaries were 113 and 158 right?

It was 149
Original post by 8752
Yes. total revenue = (19*700)=13300
Total cost of material= (200*19)= 3800
Total cost for time= (5*450)=2250
Minimum cost for production in the previous questio= 1700
total revenue-all the costs above=5550


yeah you are right, i got that wrong
Original post by anonymous2410
Yes


And was your most negative improvement index -2 after you worked out the first set of shadow costs. So before you found the second theta value to be 11 in the second iteration , did u get the most negative improvment index to be -2
Original post by anonymous2410
yeah you are right, i got that wrong


I copied the answer from the table wrong for the last question so I wrote 2000 instead of 1700 by accident. How many marks would I lose for that

Also for the profit part I used 2000 instead of 7000 so would I get 1/2 or 0/2?



Posted from TSR Mobile
Original post by Themathgeek
I copied the answer from the table wrong for the last question so I wrote 2000 instead of 1700 by accident. How many marks would I lose for that

Also for the profit part I used 2000 instead of 7000 so would I get 1/2 or 0/2?



Posted from TSR Mobile

You should only drop 4 for part a and 1 for part b in my opinion
on 6 how do u make the simplex tableau??? i just left it blank because i didn't know how to do it lmao
And was your most negative improvement index -2 after you worked out the first set of shadow costs. So before you found the second theta value to be 11 in the second iteration , did u get the most negative improvment index to be -2
Reply 255
Avatar for js.int
js.int
3
Grade boundary opinions?
Original post by Will_R_9999
It was 149 you little ***** boy


Mate calm down :tongue:
What was the most negative improvement index in part b? Was it -2?
Reply 258
Avatar for USB111
USB111
3
I failed that dynamic question
Original post by Historygcse
What was the most negative improvement index in part b? Was it -2?


I got a -3, can anyone agree?

Quick Reply

Related discussions

Latest

Trending

Trending

Articles for you