There are 6 sections in Decision 2 Maths, and each section is independent of all the other sections.

• Hungarian Algorithm
• Critical Path Analysis
• Network Flows
• Simplex Algorithm
• Dynamic Programming
• Game Theory

This means that although these notes are in a certain order, they can be studied in any independent order.

In the past different students have found different topics both easy and difficult and there is no hard and fast rule to the complexity of the topics. It may be that students will concentrate on their particular strengths. If a student does find a particular topic difficult, then it will not in any way affect his/her performance on any of the other sections

When the students take the exam in Decision Mathematics all 6 topics will be tested and questions will be completely stand-alone. It is only in this branch of Mathematics where there is no dependence from one topic onto another.

Each topic area is split into 4 sections:

detailed notes, practice questions, exam questions and a single set of statements summarising the method.

CONTENTS

Hungarian Algorithm
(a) Method for minimising
(b) Non-square matrices
(c) Method for maximising
(d) Practice questions
(e) Exam questions

Critical Path Analysis
(f) Finding a critical path
(g) Gantt diagram
(h) Resource levelling
(i) Practice questions
(j) Exam questions

Network Flows
(k) Maximum flows
(l) Flow augmentation
(m) Minimum cut
(n) Practice questions
(o) Exam questions

Simplex algorithm
(p) Simplex tableau
(q) Selecting the pivot
(r) Interpretation of results
(s) Practice questions
(t) Exam questions

Dynamic Programming
(u) Minimum path through a network
(v) Maximum path through a network
(w) Maximin and minimax problem
(x) Practice questions
(y) Exam questions

Game Theory
(z) Dominance
(aa) Stable solutions
(bb) Mixed strategies
(cc) Practice questions
(dd) Exam questions