Edexcel A Level Further Mathematics Decision
US$ 32.39
The publisher has enabled DRM protection, which means that you need to use the BookFusion iOS, Android or Web app to read this eBook. This eBook cannot be used outside of the BookFusion platform.
Description
Contents
Reviews
Language
English
ISBN
9781510433380
Cover
Title Page
Copyright
Contents
Getting the most from this book
Prior knowledge
1 Algorithms and graph theory
1.1 About algorithms
1.2 Packing and sorting
1.3 Types of graphs
1.4 Planarity of graphs
2 Algorithms on graphs
2.1 The minimum connector problem
2.2 The route inspection problem
2.3 Dijkstra’s algorithm
2.4 Floyd’s algorithm
2.5 The travelling salesperson problem
3 Critical path analysis
3.1 Constructing an activity network
3.2 Critical paths and Gantt charts
3.3 Using Gantt charts
4 Linear programming
4.1 Solving linear programming problems
4.2 The Simplex algorithm
4.3 Advanced Simplex methods
5 Allocation problems
5.1 Cost matrix reduction
5.2 The Hungarian algorithm
5.3 Modifications
5.4 Formulation as a linear programming problem
6 Recurrence relations
6.1 Solving first-order recurrence relations
6.2 Solving second-order recurrence relations
6.3 Generating functions
7 Network flows
7.1 The language of network flows
7.2 Flow augmenting
7.3 Refinements
8 Game theory
8.1 Pay-off matrices
8.2 Dominated strategies
8.3 Optimal mixed strategies
8.4 Converting games to linear programming problems
9 Transportation problems
9.1 Finding initial solutions
9.2 Finding an improved solution
9.3 Formulation as a linear programming problem
10 Dynamic programming
10.1 Principles of dynamic programming
10.2 Solving problems using dynamic programming
11 Decision analysis
11.1 Decision analysis
Answers
The book hasn't received reviews yet.