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.

Open the Worksheet Studio
  1. Dijkstra shortest path from A to D with edges A-B 4, A-C 2, B-D 5, C-B 1, C-D 8
  2. critical path analysis A 3, B 2 after A, C 4 after A, D 2 after B C
  3. simplex maximise 3x+2y subject to x+y<=4, x<=3
  4. critical path analysis A 6, B 4 after A, C 1 after A, D 2 after B C
  5. simplex maximise 3x+3y subject to x+y<=4, x<=5
  6. Dijkstra shortest path from A to D with edges A-B 3, A-C 3, B-D 3, C-B 1, C-D 9
  7. critical path analysis A 1, B 5 after A, C 6 after A, D 5 after B C
  8. simplex maximise 4x+2y subject to x+y<=4, x<=5
  9. Dijkstra shortest path from A to D with edges A-B 3, A-C 5, B-D 2, C-B 2, C-D 11
  10. critical path analysis A 2, B 1 after A, C 7 after A, D 1 after B C

Answers

  1. Dijkstra shortest path from A to D with edges A-B 4, A-C 2, B-D 5, C-B 1, C-D 8
    Show the working
    1. Start at A with distance 0; every other node is ∞
    2. Repeatedly finalise the closest unfinished node, then update its neighbours (finalised order, with distance)
    3. Trace back from D using the nodes that gave each best distance
    4. Check: a second method (Bellman–Ford) gives the same distance, and the route’s edges add up to it

    Open this question in the solver

  2. critical path analysis A 3, B 2 after A, C 4 after A, D 2 after B C
    Show the working
    1. Forward pass: earliest start = latest earliest finish of the predecessors
    2. Backward pass: latest finish = earliest latest start of the successors (start from the project time 9)
    3. Table of times and floats (float = LST − EST)
    4. Critical activities have zero float
    5. Check: the longest of all routes through the network (found by trying every path) equals the project time

    Open this question in the solver

  3. simplex maximise 3x+2y subject to x+y<=4, x<=3
    Show the working
    1. Add slack variables s to turn each ≤ into =, and write the objective row as P − (objective) = 0
    2. Pivot on column x, row 2 (most negative in the P row; smallest positive ratio)
    3. Pivot on column y, row 1 (most negative in the P row; smallest positive ratio)
    4. No negatives left in the P row: optimal. Read the values of the basic variables (the others are 0)
    5. Check: trying every corner of the feasible region gives the same maximum

    Open this question in the solver

  4. critical path analysis A 6, B 4 after A, C 1 after A, D 2 after B C
    Show the working
    1. Forward pass: earliest start = latest earliest finish of the predecessors
    2. Backward pass: latest finish = earliest latest start of the successors (start from the project time 12)
    3. Table of times and floats (float = LST − EST)
    4. Critical activities have zero float
    5. Check: the longest of all routes through the network (found by trying every path) equals the project time

    Open this question in the solver

  5. simplex maximise 3x+3y subject to x+y<=4, x<=5
    Show the working
    1. Add slack variables s to turn each ≤ into =, and write the objective row as P − (objective) = 0
    2. Pivot on column x, row 1 (most negative in the P row; smallest positive ratio)
    3. No negatives left in the P row: optimal. Read the values of the basic variables (the others are 0)
    4. Check: trying every corner of the feasible region gives the same maximum

    Open this question in the solver

  6. Dijkstra shortest path from A to D with edges A-B 3, A-C 3, B-D 3, C-B 1, C-D 9
    Show the working
    1. Start at A with distance 0; every other node is ∞
    2. Repeatedly finalise the closest unfinished node, then update its neighbours (finalised order, with distance)
    3. Trace back from D using the nodes that gave each best distance
    4. Check: a second method (Bellman–Ford) gives the same distance, and the route’s edges add up to it

    Open this question in the solver

  7. critical path analysis A 1, B 5 after A, C 6 after A, D 5 after B C
    Show the working
    1. Forward pass: earliest start = latest earliest finish of the predecessors
    2. Backward pass: latest finish = earliest latest start of the successors (start from the project time 12)
    3. Table of times and floats (float = LST − EST)
    4. Critical activities have zero float
    5. Check: the longest of all routes through the network (found by trying every path) equals the project time

    Open this question in the solver

  8. simplex maximise 4x+2y subject to x+y<=4, x<=5
    Show the working
    1. Add slack variables s to turn each ≤ into =, and write the objective row as P − (objective) = 0
    2. Pivot on column x, row 1 (most negative in the P row; smallest positive ratio)
    3. No negatives left in the P row: optimal. Read the values of the basic variables (the others are 0)
    4. Check: trying every corner of the feasible region gives the same maximum

    Open this question in the solver

  9. Dijkstra shortest path from A to D with edges A-B 3, A-C 5, B-D 2, C-B 2, C-D 11
    Show the working
    1. Start at A with distance 0; every other node is ∞
    2. Repeatedly finalise the closest unfinished node, then update its neighbours (finalised order, with distance)
    3. Trace back from D using the nodes that gave each best distance
    4. Check: a second method (Bellman–Ford) gives the same distance, and the route’s edges add up to it

    Open this question in the solver

  10. critical path analysis A 2, B 1 after A, C 7 after A, D 1 after B C
    Show the working
    1. Forward pass: earliest start = latest earliest finish of the predecessors
    2. Backward pass: latest finish = earliest latest start of the successors (start from the project time 10)
    3. Table of times and floats (float = LST − EST)
    4. Critical activities have zero float
    5. Check: the longest of all routes through the network (found by trying every path) equals the project time

    Open this question in the solver

Learn the method: Decision maths calculator: Dijkstra, critical path and simplex solver and worked examples. All worksheets: worksheet index.