Book contents
- Frontmatter
- Contents
- Preface
- Acknowledgements
- 1 Preliminaries
- 2 Matrix Algebra
- 3 Graphical Linear Programming
- 4 Sensitivity Analysis and Duality
- 5 The Simplex Algorithm
- 6 Game Theory
- 7 More Game Theory
- 8 Sensitivity Analysis, Ordinal Games, and n-Person Games
- 9 More Linear Programming
- Appendix A Rapid Review of Sets and Probability
- References
- Index
Appendix - A Rapid Review of Sets and Probability
Published online by Cambridge University Press: 11 March 2021
- Frontmatter
- Contents
- Preface
- Acknowledgements
- 1 Preliminaries
- 2 Matrix Algebra
- 3 Graphical Linear Programming
- 4 Sensitivity Analysis and Duality
- 5 The Simplex Algorithm
- 6 Game Theory
- 7 More Game Theory
- 8 Sensitivity Analysis, Ordinal Games, and n-Person Games
- 9 More Linear Programming
- Appendix A Rapid Review of Sets and Probability
- References
- Index
Summary
In this appendix, we collect together some basic material that readers should know before studying this book. The material includes sets, enumeration, and probability. In practice, we have found that students have often already been exposed to this material and only need a quick review, so we did not want to include another introductory chapter delaying the study of our main topics. We cover sets, subsets, universal sets, unions,intersections and complements, Cartesian products, power sets, and rules such as De Morgan's laws. For enumeration, we cover the addition and multiplications rules and special cases such as permutations and combinations. For probability, although our coverage is less detailed than other chapters, we actually cover more than we need for the rest of the book, including conditional probability and Bayes's theorem. Most readers will be comfortable just using this chapter as a reference or review.
Keywords
- Type
- Chapter
- Information
- Invitation to Linear Programming and Game Theory , pp. 480 - 517Publisher: Cambridge University PressPrint publication year: 2021