Advice
Rates & FAQS
Maths/Physics Notes
Our Blog
Contact Us
Online Tests
Call Us
07766496223
Search
Home
GCSE Maths Notes
GCSE Physics Notes
IGCSE Maths Notes
IGCSE Physics Notes
O Level Maths Notes
O Level Additional Maths
O Level Physics Notes
IB Maths Notes
IB Physics Notes
A Level Maths Notes
C1
C2
C3
C4
D1
D2
FP1
FP2
FP3
FP4
FP5
M1
M2
M3
M4
M5
S1
S2
S3
S4
S6
Statistical/Reference Tables
A Level Physics Notes
University Maths Notes
University Physics Notes
Tools and Resources
Maths Tuition
Physics Tuition
Tutor Profiles
Tuition Enquiry
Tutor Registration
Open University
Newsletter
My Favourite Education Links
Privacy Policy
About Us
Latest Videos
Feed not found.
Log In or Register to Comment Without Captcha
Username
Password
Show Password
Remember Me
Sign in with a passkey
Log in
Forgot your password?
Forgot your username?
Create an account
Latest Forum Posts
seo
Re: I have been cheated
Latest D2 Maths Notes
Minimum Cell Method
Competing Costume Companies and Saddle Points
Zero Sum Games
Vertex Testing For The Best Solution
Using the Stepping Stone Method to Find an Improved Solution to the Transportation Problem
Latest Blog Posts
New credit score
Next door has a skip
Understand?
Take a Test.
Subscribe to Category Feed
Home
Main
A Level Maths Notes
D2
D2
Title Filter
Filter
Clear
Display #
5
10
15
20
25
30
50
100
All
Articles
Title
Bellman's Principle of Optimality
Changing Zero Sum Games into Linear Programming Problems
Competing Costume Companies and Saddle Points
Connecting Three Houses With Gas, Electricity and Water Without Crossings
Converting a Network Into a Network of Least Distances
Degenerate Solutions to the Transportation Problem
Determination of Consistency of Set of Sentences
Dominating Strategies in Two Player Games
Dummies
Dynamic Programming - Worked Example
Finding the Reduced Cost Matrix
Flow Augmentation
Formulating a Problem for the Simplex Algorithm
Formulating an Allocation Problem as a Linear Programming Problem
Graphical Representation of Method to Find Optimal Strategy for Two Player Game
Intoroduction to Critical Path Analysis
Introduction to Dynamic Programming
Introduction to Flows
Introduction to the Simplex Algorithm
Minimum Cell Method
Play Safe Strategies
Proof of the Stable Solution Theorem
Solving Linear Programming Problems Graphically
Stable Solutions to Zero Sum Games
The Allocation Assignment Problem
The Dynamic Programming Labelling Procedure
The Maximum Flow Minimum Cut Theorem
The North West Corner Method
The Prisoner's Dilemma
The Transportation Problem
The Transportation Problem - Shadow Costs
The Transportation Problem - The North West Corner Method
The Transportation Problem - Using Shadow Costs to Find an Improved Solution to the North West Corner Solution
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 For The Best Solution
Zero Sum Games
