Results 81 to 90 of about 246 (126)
Lemke's AlgorithmについてSome of the next articles are maybe not open access.
Related searches:
Related searches:
Copositive-plus Lemke algorithm solves polymatrix games
Operations Research Letters, 1991zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Miller, Douglas A., Zucker, Steven W.
openaire +1 more source
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 ...
Asmuth, Richard +2 more
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
Some LCPs solvable in strongly polynomial time with Lemke’s algorithm
Mathematical Programming, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Adler, Ilan +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 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
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
Degeneracy Subgraph of the Lemke Complementary Pivot Algorithm and Anticycling Rule
Journal of Optimization Theory and Applications, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source