Bimatrix Equilibrium Points and Mathematical Programming
C. E. Lemke · Management Science · 1965
Some simple constructive proofs are given of solutions to the matric system Mz − ω = q; z ≧ 0; ω ≧ 0; and z T ω = 0, for various kinds of data M, q, which embrace the quadratic programming problem and the problem of finding equilibrium points of bimatrix games. The general scheme is, assuming non-degeneracy, to generate an adjacent extreme point path leading to a solution. The scheme does not require that some functional be reduced.
Cited by 1,022 works. doi:10.1287/mnsc.11.7.681
Authors
References
- Management Models and Industrial Applications of Linear Programming
- A Primal Method for the Assignment and Transportation Problems
- Equilibrium Points of Bimatrix Games
- Remark on the Constraint Sets in Linear Programming
- Some Properties of Redundant Constraints and Extraneous Variables in Direct and Dual Linear Programming Problems