Results 41 to 50 of about 66 (64)
Some of the next articles are maybe not open access.
Computing Economic Equilibria on Affine Networks with Lemke's Algorithm
Mathematics of Operations Research, 1979Consider a multicommodity transhipment problem where the prices at each location are an affine function of the supplies and demands at that location and the shipping costs are an affine function of the quantities shipped. A system of prices, supplies, demands, and shipments is defined to be an equilibrium, if there is a balance in the shipments ...
Richard Asmuth +2 more
openaire +1 more source
Copositive-plus Lemke algorithm solves polymatrix games
Operations Research Letters, 1991zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Douglas A. Miller, Steven W. Zucker
openaire +1 more source
A modified Lemke Algorithm for dynamic rigid plastic response of skeletal structures
Computers & Structures, 2021Abstract This paper proposes a modified Lemke algorithm to determine the non-holonomic response of rigid plastic skeletal structures subjected to extreme dynamic loading. The basic formulation for the dynamic rigid-plastic response has a mathematical form of linear complementarity problem (LCP), and, equivalently, a pair of dual quadratic programs ...
Azam Khan +4 more
openaire +1 more source
On the Alass of Complementary Cones and Lemke’s Algorithm
SIAM Journal on Applied Mathematics, 1972In this paper, a geometrical description of Lemke’s algorithm is presented for solving the linear complementarily problem: Find nonnegative vectors x and y satisfying $x = My + q$, $x^T y = 0$. This description is analogous to the simplicial description of the simplex method. A study is made of the class of all complementary cones and it is shown that,
openaire +2 more sources
Some LCPs solvable in strongly polynomial time with Lemke’s algorithm
Mathematical Programming, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ilan Adler +2 more
openaire +1 more source
Even more with the Lemke complementarity algorithm
Mathematical Programming, 1986zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On the average speed of Lemke's algorithm for quadratic programming
Mathematical Programming, 1986We 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
On the Convergence of the Lemke–Howson Algorithm for Bi-Matrix Games
Journal of Mathematical Sciences, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
A note on the Lemke-Howson algorithm
1974The 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
Extensions of Lemke's algorithm for the linear complementarity problem
Journal of Optimization Theory and Applications, 1976Lemke's algorithm for the linear complementarity problem fails when a desired pivot is not blocked. A projective transformation overcomes this difficulty. The transformation is performed computationally by adjoining a new row to a schema of the problem and pivoting on the element in this row and the unit constant column. Two new algorithms result; some
openaire +2 more sources