Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
C. E. Lemke (1965) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: