Bimatrix Equilibrium Points and Mathematical Programming

摘要: Some simple constructive proofs are given of solutions to the matric system Mz − ω = q; z ≧ 0; and zT 0, for various kinds data M, q, which embrace quadratic programming problem finding equilibrium points bimatrix games. The general scheme is, assuming non-degeneracy, generate an adjacent extreme point path leading a solution. does not require that some functional be reduced.