D2 Revision 3.0 / 5 based on 2 ratings ? MathematicsNetworks, algorithms and problem solvingA2/A-levelEdexcel Created by: Yvonne AndrewsCreated on: 28-05-13 23:28 A degenerate solution has less than n+m - 1 sed cells 1 of 11 The residual minimum spanning tree method finds a lower bound 2 of 11 A pay-off matrix can be reduced by deleting a dominated row or column 3 of 11 The conservation conditions says that total flow into a vertex = total flow out of the vertex 4 of 11 Bellman's Principle of Optimality says any part of an optimal path is itself optimal 5 of 11 The vertex you arrive at having taken an an action is the destination 6 of 11 A minimax problem is one where the longest leg is as short as possible 7 of 11 The value of a cut is calculated using capacities 8 of 11 The Hungarian algorithm is used to find an optimal allocation 9 of 11 In a zero sum game there wil be a stable solution if and only if the row maximin = the column minimax 10 of 11 A saddle point is the location of the stable solution 11 of 11
Comments
No comments have yet been made