Mathematical Introduction to Linear Programming and Game Theory

  • LouisĀ Brickman

Part of the Undergraduate Texts in Mathematics book series (UTM)

Table of contents

  1. Front Matter
    Pages i-xi
  2. Louis Brickman
    Pages 1-15
  3. Louis Brickman
    Pages 16-31
  4. Louis Brickman
    Pages 32-61
  5. Louis Brickman
    Pages 62-75
  6. Louis Brickman
    Pages 76-94
  7. Louis Brickman
    Pages 95-123
  8. Back Matter
    Pages 125-132

About this book

Introduction

Mathematical elegance is a constant theme in this treatment of linear programming and matrix games. Condensed tableau, minimal in size and notation, are employed for the simplex algorithm. In the context of these tableau the beautiful termination theorem of R.G. Bland is proven more simply than heretofore, and the important duality theorem becomes almost obvious. Examples and extensive discussions throughout the book provide insight into definitions, theorems, and applications. There is considerable informal discussion on how best to play matrix games. The book is designed for a one-semester undergraduate course. Readers will need a degree of mathematical sophistication and general tools such as sets, functions, and summation notation. No single college course is a prerequisite, but most students will do better with some prior college mathematics. This thorough introduction to linear programming and game theory will impart a deep understanding of the material and also increase the student's mathematical maturity.

Keywords

DEX Matrix Tableau boundary element method design duality form function functions game theory games linear optimization mathematics programming tool

Authors and affiliations

  • LouisĀ Brickman
    • 1
  1. 1.Department of Mathematics and StatisticsState University of New York at AlbanyAlbanyUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4612-4540-7
  • Copyright Information Springer-Verlag New York 1989
  • Publisher Name Springer, New York, NY
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4612-8869-5
  • Online ISBN 978-1-4612-4540-7
  • Series Print ISSN 0172-6056
  • About this book