Bimatrix Equilibrium Points and Mathematical Programming - Archive ouverte HAL
Article Dans Une Revue Management Science Année : 1965

Bimatrix Equilibrium Points and Mathematical Programming

Résumé

Some simple constructive proofs are given of solutions to the matrix 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.
Fichier principal
Vignette du fichier
lemke1965.pdf (687.71 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01885823 , version 1 (02-10-2018)

Identifiants

Citer

Carlton Lemke. Bimatrix Equilibrium Points and Mathematical Programming. Management Science, 1965, 11 (7), pp.681-689. ⟨10.1287/mnsc.11.7.681⟩. ⟨hal-01885823⟩
62 Consultations
502 Téléchargements

Altmetric

Partager

More