Bimatrix Equilibrium Points and Mathematical Programming
Some simple constructive proofs are given of solutions to the matric system Mz - \omega - q; z \geqq 0; \omega \geqq 0; and z T \omega - 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.
Volume (Year): 11 (1965)
Issue (Month): 7 (May)
|Contact details of provider:|| Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA|
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:11:y:1965:i:7:p:681-689. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If references are entirely missing, you can add them using this form.