Pearson Maths A level Decision 2

Pearson Secondary Maths, Feb 15, 2019

A set of activities designed to be used in conjunction with exercises from Edexcel A level Mathematics: Decision Mathematics Year 2

Table of Contents

  1. Transportation problems
    1. 1 Transportation problems: page 4
    2. 1 Transportation problems: page 13
    3. 1 Transportation problems: page 16
    4. 1 Transportation problems: page 20
  2. Allocation problems
  3. Flows in networks 1
    1. 3 Flows in networks 1: page 81
    2. 3 Flows in networks 1: page 89
  4. Flows in networks 2
    1. 4 Flows in networks 2: page 113
    2. 4 Flows in networks 2: page 116
  5. Dynamic programming
  6. Game theory
    1. 6 Game theory: page 186
    2. 6 Game theory: page 199
  7. Recurrence relations
    1. 7 Recurrence relations: page 224
  8. Decision analysis
    1. 8 Decision analysis: page 246

1.

Transportation problems

  • 1. 1 Transportation problems: page 4
  • 2. 1 Transportation problems: page 13
  • 3. 1 Transportation problems: page 16
  • 4. 1 Transportation problems: page 20

1.1.

1 Transportation problems: page 4

Use the sliders to adjust the number of rows and columns. Enter the table values. Then, find the initial solution.
– Pearson Secondary Maths

1.2.

–

1.3.

–

1.4.

–

2.

Allocation problems


    This chapter does not contain any resources yet.

3.

Flows in networks 1

  • 1. 3 Flows in networks 1: page 81
  • 2. 3 Flows in networks 1: page 89

3.1.

3 Flows in networks 1: page 81

– Pearson Secondary Maths

3.2.

–

4.

Flows in networks 2

  • 1. 4 Flows in networks 2: page 113
  • 2. 4 Flows in networks 2: page 116

4.1.

4 Flows in networks 2: page 113

Select any arc to show the amounts by which the flow can be increased or decreased along that arc.
– Pearson Secondary Maths

4.2.

–

5.

Dynamic programming


    This chapter does not contain any resources yet.

6.

Game theory

  • 1. 6 Game theory: page 186
  • 2. 6 Game theory: page 199

6.1.

6 Game theory: page 186

– Pearson Secondary Maths

6.2.

–

7.

Recurrence relations

  • 1. 7 Recurrence relations: page 224

7.1.

7 Recurrence relations: page 224

Tower of Hanoi
Transfer the disks from the left peg to the right peg. To move a disk click on it then click the peg you want to transfer it to.[br][list][*]Only one disk at a time can be moved.[br][/*][*]A disk can only be moved if it is the top disk on a pile.[/*][*]A larger disk can never be placed on a smaller one.[/*][/list]
– Pearson Secondary Maths

8.

Decision analysis

  • 1. 8 Decision analysis: page 246

8.1.

8 Decision analysis: page 246

– Pearson Secondary Maths

Information