Mathematical introduction to linear programming and game theory
On 130 pages and in six chapters (simultaneous linear equations, LP foundations, the simplex algorithm, dual tableaux and two-phase algorithms, dual LP problems, matrix games), the author gives an excellently written and mathematical elegantly derived representation of the central parts of LP. The core of the explanation is the simplex method. By the use of this algorithm the author needs a minimum of tools to prove the essential statements of LP. Examples, counterexamples and exercises complete the booklet. It does not cover the geometric background, the numerical problems and the complexity of LP.
- An introduction to linear programming and the theory of games
- Linear programming and game theory
- scientific article; zbMATH DE number 193129
- An introduction to linear programming and game theory.
- Invitation to linear programming and game theory
- scientific article; zbMATH DE number 1478494
- Linear games and complementarity problems
- scientific article; zbMATH DE number 1823659
- scientific article; zbMATH DE number 3908158
- The solution of linear interval equations by a linear programming method
- Restricted cooperative games on metabolic networks reveal functionally important reactions
- Simplex algorithms for linear programming
- Linear programming and game theory
- Modeling a game into a linear programming problem: the benefits
- Linear programming complementation
- A method to improve integer linear programming problem with branch-and-bound procedure
- Sensitivity analysis of matching pennies game
This page was built for publication: Mathematical introduction to linear programming and game theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4692949)
