~~Read your relevant specification here to know what you have to learn. We currently have the following maths notes on A-Level Maths Decision 2 (D2). (These notes are in alphabetical order to make it easier to find the specific one)~~

- Flow Augmentation
- Bellman’s Principle of Optimality
- Changing Zero Sum Games Into Linear Programming Problems
- Converting a Network into a Network of Least Distances
- Critical Path Analysis – A Brief Explanation
- D2 NOTES START HERE
- Degenerate Solutions to the Transportation Problem
- Determination of Consistency of Set of Sentences
- Dominating Strategies in Two Player Games
- Dummies
- Dynamic Programming – Worked Example
- Formulating a Problem for the Simplex Algorithm
- Formulating an Allocation Problem as a Linear Programming Problem
- Game Theory – Play Safe Strategies
- Graphical Representation of Method to Find Optimal Strategy for Two Player Game
- Introduction to Dynamic Programming
- Introduction to Flows
- Introduction to the Simplex Algorithm
- Optimal Strategies in Games That Are Not Stable When Players Have Two Possible Strategies Each
- Proof of the Stable Solution Theorem
- Solving Linear Programming Problems Graphically
- Stable Solutions in a Zero Sum Game
- The Allocation (Assignment) Problem
- The Allocation Problem – Finding the Reduced Cost Matrix
- The Dynamic Programming Labelling Procedure
- The Maximum Flow Minimum Cut Theorem
- The Prisoner’s Dilemma
- The Transportation Problem
- The Transportation Problem – Shadow Costs
- The Transportation Problem – The North West Corner Method
- The Travelling Salesman Problem
- The Travelling Salesman Problem – Finding a Lower Bound
- The Travelling Salesman Problem – Finding an Upper Bound
- The Travelling Salesman Problem – Finding an Upper Bound Using the Nearest Neighbour Algorithm
- The Unbalanced Transportation Problem
- Using the Hungarian Algorithm to Find an Allocation That Maximises Profit
- Using The Hungarian Algorithm to Find the Least Cost Allocation
- Using the Stepping Stone Method to Find an Improved Solution to the Transportation Problem
- Vertex Testing
- Zero Sum Games

If you believe that there are any mistakes with the notes or that there are notes missing, then please contact us here. We advise you to use the search bar for our website on the right to find any notes that you think are missing from this section as those particular notes might be somewhere else on this website. These notes are for all A-Level specifications but we have found it difficult to accommodate each specification for each module so contact us if you have a solution or if there are notes missing for a specification that you think should be here. We are trying to make this a maths website for all. Any help or feedback will be appreciated.