On the solution of NP-hard linear complementarity problem
In this paper two enumerative algorithms for the Linear Complementarity Problems (LCP) are discussed. These procedures exploit the equivalence of the LCP into a nonconvex quadratic and a bilinear programs. It is shown that these algorithms are efficient for processing NP-hard LCPs associated with re...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2002
|
| Assuntos: | |
| Texto completo: | https://hdl.handle.net/10216/99207 |
| País: | Portugal |
| Oai: | oai:repositorio-aberto.up.pt:10216/99207 |