Decision maths calculator: Dijkstra, critical path and simplex worksheet with answers
Further maths: Further maths Tiers are typical for England, Wales and Northern Ireland specifications. Boards differ, so check your own specification.
10 practice questions on decision maths calculator: dijkstra, critical path and simplex. Print the questions on their own, or with the answers. Worked solutions for any question are one click away in the solver.
Name: ______________ Date: ________ Score: ____ / 10
Dijkstra shortest path from A to D with edges A-B 4, A-C 2, B-D 5, C-B 1, C-D 8critical path analysis A 3, B 2 after A, C 4 after A, D 2 after B Csimplex maximise 3x+2y subject to x+y<=4, x<=3critical path analysis A 6, B 4 after A, C 1 after A, D 2 after B Csimplex maximise 3x+3y subject to x+y<=4, x<=5Dijkstra shortest path from A to D with edges A-B 3, A-C 3, B-D 3, C-B 1, C-D 9critical path analysis A 1, B 5 after A, C 6 after A, D 5 after B Csimplex maximise 4x+2y subject to x+y<=4, x<=5Dijkstra shortest path from A to D with edges A-B 3, A-C 5, B-D 2, C-B 2, C-D 11critical path analysis A 2, B 1 after A, C 7 after A, D 1 after B C
Answers
Dijkstra shortest path from A to D with edges A-B 4, A-C 2, B-D 5, C-B 1, C-D 8Show the working
- Start at A with distance 0; every other node is ∞
- Repeatedly finalise the closest unfinished node, then update its neighbours (finalised order, with distance)
- Trace back from D using the nodes that gave each best distance
- Check: a second method (Bellman–Ford) gives the same distance, and the route’s edges add up to it
critical path analysis A 3, B 2 after A, C 4 after A, D 2 after B CShow the working
- Forward pass: earliest start = latest earliest finish of the predecessors
- Backward pass: latest finish = earliest latest start of the successors (start from the project time 9)
- Table of times and floats (float = LST − EST)
- Critical activities have zero float
- Check: the longest of all routes through the network (found by trying every path) equals the project time
simplex maximise 3x+2y subject to x+y<=4, x<=3Show the working
- Add slack variables s to turn each ≤ into =, and write the objective row as P − (objective) = 0
- Pivot on column x, row 2 (most negative in the P row; smallest positive ratio)
- Pivot on column y, row 1 (most negative in the P row; smallest positive ratio)
- No negatives left in the P row: optimal. Read the values of the basic variables (the others are 0)
- Check: trying every corner of the feasible region gives the same maximum
critical path analysis A 6, B 4 after A, C 1 after A, D 2 after B CShow the working
- Forward pass: earliest start = latest earliest finish of the predecessors
- Backward pass: latest finish = earliest latest start of the successors (start from the project time 12)
- Table of times and floats (float = LST − EST)
- Critical activities have zero float
- Check: the longest of all routes through the network (found by trying every path) equals the project time
simplex maximise 3x+3y subject to x+y<=4, x<=5Show the working
- Add slack variables s to turn each ≤ into =, and write the objective row as P − (objective) = 0
- Pivot on column x, row 1 (most negative in the P row; smallest positive ratio)
- No negatives left in the P row: optimal. Read the values of the basic variables (the others are 0)
- Check: trying every corner of the feasible region gives the same maximum
Dijkstra shortest path from A to D with edges A-B 3, A-C 3, B-D 3, C-B 1, C-D 9Show the working
- Start at A with distance 0; every other node is ∞
- Repeatedly finalise the closest unfinished node, then update its neighbours (finalised order, with distance)
- Trace back from D using the nodes that gave each best distance
- Check: a second method (Bellman–Ford) gives the same distance, and the route’s edges add up to it
critical path analysis A 1, B 5 after A, C 6 after A, D 5 after B CShow the working
- Forward pass: earliest start = latest earliest finish of the predecessors
- Backward pass: latest finish = earliest latest start of the successors (start from the project time 12)
- Table of times and floats (float = LST − EST)
- Critical activities have zero float
- Check: the longest of all routes through the network (found by trying every path) equals the project time
simplex maximise 4x+2y subject to x+y<=4, x<=5Show the working
- Add slack variables s to turn each ≤ into =, and write the objective row as P − (objective) = 0
- Pivot on column x, row 1 (most negative in the P row; smallest positive ratio)
- No negatives left in the P row: optimal. Read the values of the basic variables (the others are 0)
- Check: trying every corner of the feasible region gives the same maximum
Dijkstra shortest path from A to D with edges A-B 3, A-C 5, B-D 2, C-B 2, C-D 11Show the working
- Start at A with distance 0; every other node is ∞
- Repeatedly finalise the closest unfinished node, then update its neighbours (finalised order, with distance)
- Trace back from D using the nodes that gave each best distance
- Check: a second method (Bellman–Ford) gives the same distance, and the route’s edges add up to it
critical path analysis A 2, B 1 after A, C 7 after A, D 1 after B CShow the working
- Forward pass: earliest start = latest earliest finish of the predecessors
- Backward pass: latest finish = earliest latest start of the successors (start from the project time 10)
- Table of times and floats (float = LST − EST)
- Critical activities have zero float
- Check: the longest of all routes through the network (found by trying every path) equals the project time
Learn the method: Decision maths calculator: Dijkstra, critical path and simplex solver and worked examples. All worksheets: worksheet index.