Results 91 to 100 of about 246 (126)

On the average speed of Lemke's algorithm for quadratic programming

Mathematical Programming, 1986
We show that the average number of steps of the Lemke algorithm for the quadratic programming problems grows at most linearly in the number of variables while fixing the number of constraints. The result and method were motivated by Smale's result on linear programming problems.
openaire   +2 more sources

A note on the Lemke-Howson algorithm

1974
The Lemke-Howson algorithm for bimatrix games provides both an elementary proof of the existence of equilibrium points and an efficient computational method for finding at least one equilibrium point. The first half of this paper presents a geometrical view of the algorithm that makes its operation especially easy to visualize.
openaire   +1 more source

On the Convergence of the Lemke–Howson Algorithm for Bi-Matrix Games

Journal of Mathematical Sciences, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

On a Generalization of the Lemke–Howson Algorithm to Noncooperative N-Person Games

SIAM Journal on Applied Mathematics, 1971
In [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

1992
Numerous 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  

An efficient implementation of the Lemke algorithm and its extension to deal with upper and lower bounds

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

Clinical management of metastatic colorectal cancer in the era of precision medicine

Ca-A Cancer Journal for Clinicians, 2022
, Davide Ciardiello, Giulia Martini
exaly  

The Arithmetic Optimization Algorithm

Computer Methods in Applied Mechanics and Engineering, 2021
Laith Mohammad Abualigah, Ali H Diabat, Seyedali Mirjalili   +2 more
exaly  

Head and neck cancers—major changes in the American Joint Committee on cancer eighth edition cancer staging manual

Ca-A Cancer Journal for Clinicians, 2017
William M Lydiatt, Snehal G Patel, Brian O'Sullivan   +2 more
exaly