Results 91 to 100 of about 253 (124)
Some of the next articles are maybe not open access.
On a Generalization of the Lemke–Howson Algorithm to Noncooperative N-Person Games
SIAM Journal on Applied Mathematics, 1971In [1] it has been shown that the existence of equilibrium points in a bimatrix game can be proved without a fixed-point theorem. If the game is nondegenerated, the number of equilibrium points is odd and all equilibrium points are obtained by a computational procedure in finitely many steps.The purpose of this note is to show that nondegeneracy can be
openaire +2 more sources
On the Charnes-Lemke Algorithm for Linear Programming Problems with Multipage Structure
1992Numerous problems in areas such as transportation engineering, management decision making, and others can be formulated as large coupled linear programming problems. Subject to the coupling constraints that interrelate them, each linear programming problem can be viewed as a separate phase, or “page,” in a description of the overall model.
William M. Raike, John J. Rousseau
openaire +1 more source
The Ricardo-Lemke parametric algorithm on oddity and uniqueness [PDF]
, 2012 The parametric Lemke algorithm finds an odd number of solutions to the linear complementarity problem LCP (q, M), for a matrix M with zero blocks on the diagonal and vector q within a certain domain. A criterion for monotonicity and uniqueness is given.
openaire
1978
The paper first describes a version of Lemke's algorithm for the linear complementarity problem based on updating the inverse or factorization of a submatrix rather than the whole tableau. A simple version is then given for a restricted class of matrices which uses only elementary principal pivots, and from this a hybrid algorithm using orthogonal ...
openaire +2 more sources
The paper first describes a version of Lemke's algorithm for the linear complementarity problem based on updating the inverse or factorization of a submatrix rather than the whole tableau. A simple version is then given for a restricted class of matrices which uses only elementary principal pivots, and from this a hybrid algorithm using orthogonal ...
openaire +2 more sources
The Arithmetic Optimization Algorithm
Computer Methods in Applied Mechanics and Engineering, 2021Laith Mohammad Abualigah +2 more
exaly
Performance of Lemke's Algorithm for LCP with Respect to Choice of the Artificial Column
, 1989 S. A. Bell
openalex
Differential Evolution and Lemkes Algorithm in the Solution of Bilevel Programming Problems
Proceedings XIII Brazilian Congress on Computational Inteligence, 2018Celio H.N. Larcher Jr. +1 more
openaire +1 more source