An efficient implementation of the Lemke algorithm and its extension to deal with upper and lower bounds
From MaRDI portal
Publication:4158822
DOI10.1007/BFb0120780zbMath0379.90082MaRDI QIDQ4158822
Publication date: 1978
Published in: Mathematical Programming Studies (Search for Journal in Brave)
Related Items
Ein effektiver Branch and Bound-Algorithmus für Boolesche quadratische Optimierungsprobleme, Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods, A linear complementarity approach to the articulated multifingered friction gripper, Numerical verification of solutions for obstacle problems., Verification for existence of solutions for some generalized obstacle problems, A numerical verification of solutions of free boundary problems
