The objective of this book is to present a reasonably complete account of linear programming. The mathematical development is based on the theory of linear simultaneous equations, without the usual notions from the mathematics of vector spaces. The mathematical development has been carried out in su
Linear programming and theory of games
β Scribed by Karak P.M.
- Publisher
- NCBA
- Year
- 2020
- Tongue
- English
- Leaves
- 531
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Table of Contents
Cover
Preface to the Central Edition
Preface to the First Edition
Contents
1 Mathematical Background
2 Motivation and Mathematical Formulation of Linear Programming Problems
3 Slack and Surplus Variables
4 Basic Solutions of a Set of Simultaneous Linear Equations
5 N-Dimensional Euclidean Space and Convex Set
6 Fundamental Properties of Simplex Method
7 Graphical or Geometrical Method of Solving a L.P.P.
8 Simplex Method or Simplex Algorithm (I)
9 Simplex Method or Simplex Algorithm (II)
10 Simplex Method or Simplex Algorithm (III)
11 Resolution of Degeneracy
12 Duality Theory
13 Transportation, Assignment and Travelling Salesman Problems
14 Revised Simplex Algorithm
15 Dual Simplex Method
16 Sensitivity Analysis
17 Parametric Programming
18 Integer Programming
19 Theory of Games
20 Queuing (Deterministic and probabilistic) Models
A Development of the Simplex Theory
π SIMILAR VOLUMES
Linear Programming And Game Theory is a comprehensive guide for students studying linear programming.
Written in a conversational tone, this classroom-tested text introduces the fundamentals of linear programming and game theory, showing readers how to apply serious mathematics to practical real-life questions by modelling linear optimization problems and strategic games. The treatment of linear pro
Written in a conversational tone, this classroom-tested text introduces the fundamentals of linear programming and game theory, showing readers how to apply serious mathematics to practical real-life questions by modelling linear optimization problems and strategic games. The treatment of linear pro
Mathematical elegance is a constant theme in this treatment of linear programming and matrix games. Condensed tableaus, minimal in size and notation, are employed for the simplex algorithm. In the context of these tableaus the beautiful termination theorem of RG Bland is proven more simply than here
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 SocietyAn Introduction to Linear Programming and Game Theory, Third Editio