scientific article

zbMATH Open0773.90079MaRDI QIDQ4021230FDOQ4021230

Joaquim J. Júdice, F. M. Pires

Publication date: 16 January 1993

Title of this publication is not available (Why is that?)

zbMATH Keywords

polynomial-time algorithmupper boundsgeneralized linear complementarity

Mathematics Subject Classification ID

Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cited In (1)

• A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A polynomial-time algorithm for a class of linear complementarity problems 👍 👎
• The generalized linear complementarity problem revisited 👍 👎
• A class of linear complementarity problems solvable in polynomial time 👍 👎
• A new polynomial time method for a linear complementarity problem 👍 👎
• On the solution and complexity of a generalized linear complementarity problem 👍 👎
• A non-modulus linear method for solving the linear complementarity problem 👍 👎
• A linearization method for generalized complementarity problems 👍 👎
• A polynomial-time algorithm for the tridiagonal and Hessenberg P-matrix linear complementarity problem 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4021230)