An Introduction to Linear Programming and Game Theory
3rd Edition
Published on 22. August 2008
Book
Hardback
480 pages
978-0-470-23286-6 (ISBN)
Description
Praise for the Second Edition:
"This is quite a well-done book: very tightly organized, better-than-average exposition, and numerous examples, illustrations, and applications."
-Mathematical Reviews of the American Mathematical Society
An Introduction to Linear Programming and Game Theory, Third Edition presents a rigorous, yet accessible, introduction to the theoretical concepts and computational techniques of linear programming and game theory. Now with more extensive modeling exercises and detailed integer programming examples, this book uniquely illustrates how mathematics can be used in real-world applications in the social, life, and managerial sciences, providing readers with the opportunity to develop and apply their analytical abilities when solving realistic problems.
This Third Edition addresses various new topics and improvements in the field of mathematical programming, and it also presents two software programs, LP Assistant and the Solver add-in for Microsoft Office Excel(r), for solving linear programming problems. LP Assistant, developed by coauthor Gerard Keough, allows readers to perform the basic steps of the algorithms provided in the book and is freely available via the book's related Web site. The use of the sensitivity analysis report and integer programming algorithm from the Solver add-in for Microsoft Office Excel(r) is introduced so readers can solve the book's linear and integer programming problems. A detailed appendix contains instructions for the use of both applications.
Additional features of the Third Edition include:
* A discussion of sensitivity analysis for the two-variable problem, along with new examples demonstrating integer programming, non-linear programming, and make vs. buy models
* Revised proofs and a discussion on the relevance and solution of the dual problem
* A section on developing an example in Data Envelopment Analysis
* An outline of the proof of John Nash's theorem on the existence of equilibrium strategy pairs for non-cooperative, non-zero-sum games
Providing a complete mathematical development of all presented concepts and examples, Introduction to Linear Programming and Game Theory, Third Edition is an ideal text for linear programming and mathematical modeling courses at the upper-undergraduate and graduate levels. It also serves as a valuable reference for professionals who use game theory in business, economics, and management science.
More details
Product info
gebunden
Edition
3. Auflage
Language
English
Place of publication
United States
Publishing group
John Wiley & Sons Inc
Target group
Professional and scholarly
Edition type
New edition
Product notice
sewn/stitched
Paper over boards
Illustrations
Charts: 20 B&W, 0 Color; Screen captures: 8 B&W, 0 Color; Tables: 1 B&W, 0 Color; Graphs: 40 B&W, 0 Color
Dimensions
Height: 240 mm
Width: 161 mm
Thickness: 30 mm
Weight
877 gr
ISBN-13
978-0-470-23286-6 (9780470232866)
Schweitzer Classification
Other editions
Additional editions
Paul R. Thie | Gerard E. Keough
An Introduction to Linear Programming and Game Theory
E-Book
09/2011
3rd Edition
Wiley
€128.99
Available for download
Previous edition
Book
03/1988
2nd Edition
Wiley
€95.95
Article exhausted; check for reprint
Persons
PAUL R. THIE, PhD, is Professor Emeritus in the Department of Mathematics at Boston College. Dr. Thie has authored numerous journal articles in the areas of mathematical programming and several complex variables.
GERARD E. KEOUGH, PhD, is Associate Professor and former chair of the Department of Mathematics at Boston College. He has written extensively on operator theory, functional analysis, and the use of technology in mathematics. Dr. Keough is the coauthor of Getting Started with Maple(r), Second Edition and Getting Started with Mathematica(r), Second Edition,both published by Wiley.
Content
Preface.
1. Mathematical Models.
1.1 Applying Mathematics.
1.2 The Diet Problem.
1.3 The Prisoner's Dilemma.
1.4 The Roles of Linear Programming and Game Theory.
2 The Linear Programming Model.
2. 1 History.
2.2 The Blending Model.
2.3 The Production Model.
2.4 The Transportation Model.
2.5 The Dynamic Planning Model.
2.6 Summary.
3. The Simplex Method.
3.1 The General Problem.
3.2 Linear Equations and Basic Feasible Solutions.
3.3 Introduction to the Simplex Method.
3.4 Theory of the Simplex Method.
3.5 The Simplex Tableau and Examples.
3.6 Artificial Variables.
3.7 Redundant Systems.
3.8 A Convergence Proof.
3.9 Linear Programming and Convexity.
3.10 Spreadsheet Resolution.
4. Duality.
4.1 Introduction to Duality.
4.2 Definition of the Dual Problem.
4.3 Examples and Interpretations.
4.4 The Duality Theorem.
4.5 The Complementary Slackness Theorem.
5. Sensitivity Analysis.
5.1 Examples in Sensitivity Analysis.
5.2 Matrix Representation of the Simplex Algorithm.
5.3 Changes in the Objective Function.
5.4 Addition of a New Variable.
5.5 Changes in the Constant Term Column Vector.
5.6 The Dual Simplex Algorithm.
5.7 Addition of a Constraint.
6. Integer Programming.
6.1 Introduction to Integer Programming.
6.2 Models with Integer Programming Formulations.
6.3 Gomory's Cutting Plane Algorithm.
6.4 A Branch and Bound Algorithm.
6.5 Spreadsheet Resolution.
7. The Transportation Problem.
7.1 A Distribution Problem.
7.2 The Transportation Problem.
7.3 Applications.
8. Other Topics In Linear Programming.
8.1 An Example Involving Uncertainty.
8.2 An Example with Multiple Goals.
8.3 An Example Using Decomposition.
8.4 An Example in Data Envelopment Analysis.
9. Two-Person, Zero-Sum Games.
9.1 Introduction to Game Theory.
9.2 Some Principles of Decision Making in Game Theory.
9.3 Saddle Points.
9.4 Mixed Strategies.
9.5 The Fundamental Theorem.
9.6 Computational Techniques.
9.7 Games People Play.
10. Other Topics in Game Theory.
10.1 Utility Theory.
10.2 Two-person, Non-zero-Sum Games.
10.3 Noncooperative Two-Person Games.
10.4 Cooperative Two-Person Games.
10.5 The Axioms of Nash.
10.6 An Example.
A Vectors and Matrices.
B An Example of Cycling.
C Efficiency of the Simplex Method.
D LP Assistant.
E Microsoft Excel and Solver.
Bibliography.
Solutions to Selected Problems.
Index.