Category Archives: D1

Decision mathematics 1

Linear Programming Example

A worked example of a linear programming problem Question Clive … read more

Linear Programming

Linear programming is an optimisation technique that will enable you … read more

Allocating Resources

Once you have decided on the critical path for an … read more

Float

Float is a measure of the amount of ‘spare’ time … read more

Earliest and Latest Times

Once you have drawn out an activity network the next … read more

Activity Networks

As we saw in the introduction to critical path analysis, … read more

Critical Path Analysis – Introduction

Critical path analysis allows you to determine the best way … read more

Dijkstra’s Complexity

Dijkstra’s algorithm inspects each of the nodes that have not … read more

Prim’s Complexity

Prim’s algorithm starts by selecting the least weight edge from … read more

Kruskal’s Complexity

In Kruskal’s algorithm we need to find edge with the … read more