Edexcel AS and A level Further Mathematics Decision Mathematics 2 Textbook + e-book
1st Edition
Published on 5. June 2018
334 pages
978-1-292-20716-2 (ISBN)
Description
Exam Board: EdexcelLevel: AS and A levelSubject: Further MathematicsFirst teaching: September 2017First exams: Summer 2018With over 1.3 million copies sold of the previous edition, Pearsons textbooks are the market-leading and most trusted resources for AS and A level Further Mathematics. This book covers all the content needed for the optional Edexcel AS and A level Decision Mathematics 2 exams. Fully updated to match the 2017 specifications, with more of a focus on problem-solving and modelling. FREE additional online content to support your independent learning, including full worked solutions for every question in the book (SolutionBank) and GeoGebra interactives. Includes access to an online digital edition (valid for 3 years once activated). Includes worked examples with guidance, lots of exam-style questions, practice papers, and plenty of mixed and review exercises.
More details
Other editions
Additional editions
Book
06/2018
Pearson Education Limited
€53.43
Shipment within 10-20 days
Content
- Front Cover
- Contents
- Overarching themes
- Extra online content
- Chapter 1: Transportation problems
- 1.1: The north-west corner method
- 1.2: Unbalanced problems and degenerate solutions
- 1.3: Finding an improved solution
- 1.4: The stepping-stone method
- 1.5: Linear programming
- Mixed exercise: 1
- Chapter 2: Allocation problems
- 2.1: The Hungarian algorithm
- 2.2: Using a dummy
- 2.3: Maximum profit allocation
- 2.4: Managing incomplete data
- 2.5: Linear programming
- Mixed exercise: 2
- Chapter 3: Flows in networks 1
- 3.1: Flows in networks
- 3.2: Cuts and their capacities
- 3.3: Finding an initial flow
- 3.4: Flow-augmenting routes
- 3.5: Maximum flow - minimum cut theorem
- Mixed exercise: 3
- Chapter 4: Flows in networks 2
- 4.1: Lower capacities
- 4.2: Sources and sinks
- 4.3: Restricted capacity nodes
- Mixed exercise: 4
- Review exercise: 1
- Chapter 5: Dynamic programming
- 5.1: Shortest and longest path problems
- 5.2: Minimax and maximin problems
- 5.3: Dynamic programming problems in table form
- Mixed exercise: 5
- Chapter 6: Game theory
- 6.1: Play-safe strategies and stable solutions
- 6.2: Reducing the pay-off matrix
- 6.3: Optimal strategies for games with no stable solution
- 6.4: Converting games to linear programming problems
- Mixed exercise: 6
- Chapter 7: Recurrence relations
- 7.1: Forming recurrence relations
- 7.2: Solving first-order recurrence relations
- 7.3: Solving second-order recurrence relations
- Mixed exercise: 7
- Chapter 8: Decision analysis
- 8.1: Decision trees
- 8.2: Utility
- Mixed exercise: 8
- Review exercise: 2
- Exam-style practice (AS level)
- Exam-style practice (A level)
- Answers
- Index
- Back Cover
