|
|
|||
|
||||
OverviewMathematical 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. Full Product DetailsAuthor: Louis BrickmanPublisher: Springer-Verlag New York Inc. Imprint: Springer-Verlag New York Inc. Edition: 1st ed. 1989. Corr. 2nd printing 1998 Dimensions: Width: 15.60cm , Height: 0.90cm , Length: 23.40cm Weight: 0.860kg ISBN: 9780387969312ISBN 10: 0387969314 Pages: 132 Publication Date: 23 June 1989 Audience: College/higher education , Undergraduate Format: Hardback Publisher's Status: Active Availability: In Print This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |