Results 71 to 80 of about 253 (124)
Algorithms for the linear complementarity problem which allow an arbitrary starting point [PDF]
Heyden, L. van der, Talman, A.J.J.
core +1 more source
A vector labeling method for solving discrete zero point and complementarity problems. [PDF]
Laan, G. van der +2 more
core +1 more source
Simplical algorithms for finding stationary points, a unifying description [PDF]
Laan, G. van der, Talman, A.J.J.
core +1 more source
Some remarks on an interval arithmetic version of the Lemke algorithm
, 2004 openaire +2 more sources
An algorithm for the linear complementarity problem with upper and lower bounds [PDF]
, 1985 Talman, A.J.J., van der Laan, G.
core
A new algorithm for the linear complementarity problem allowing for an arbitrary starting point [PDF]
, 1990 Kremers, J.A.W.M., Talman, A.J.J.
core +1 more source
Computing Economic Equilibria on Affine Networks with Lemke's Algorithm
Mathematics of Operations Research, 1979 Consider 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
openalex +2 more sources
Extensions of Lemke's algorithm for the linear complementarity problem
Journal of Optimization Theory and Applications, 1976 Lemke'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
Michael J. Todd
openalex +3 more sources