## Decision Mathematics, Volume 1A syllabus-specific textbook providing worked examples, exam-level questions and many practice exercises, in accordance to the new Edexcel AS and Advanced GCE specification. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Other editions - View all

### Common terms and phrases

Activity Depends activity F activity network adjacency matrix algorithm to find already paired alternating path Basic variable bipartite graph bubble-sort algorithm called complete matching consider constraints critical activities critical events critical path decision variables diagram Dijkstra's algorithm distance duration earliest entry equation Eulerian cycle Example Exercise feasible region find a minimum first-fit algorithm flow pattern flow-augmenting paths given gives graph G Hamiltonian cycle inequality initial matching integer Kruskal's algorithm labelling procedure leaving space linear programming problem Mathematics maximal matching maximum flow maximum value method minimum cut minimum spanning tree modelled number of edges objective function obtain odd vertices optimal solution pivotal column pivotal row planar possible route Prim's algorithm profit route inspection problem saturated arcs shortest route shown shows simplex algorithm smallest solve starting and finishing Step sublist summarised supersink supersource tableau total float units valencies weight worker zero