scientific article; zbMATH DE number 4189490
From MaRDI portal
Recommendations
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
- The linear complementarity problem as a separable bilinear program
- Linear complementarity problems solvable by integer programming
- A computational analysis of LCP methods for bilinear and concave quadratic programming
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique
Cited in
(14)- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
- Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
- A computational analysis of LCP methods for bilinear and concave quadratic programming
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique
- On the complexity of linear programming in the BSS-model
- The linear complementarity problem as a separable bilinear program
- Unified approaches for solvable and unsolvable linear complementarity problems
- Linear complementarity problems and bi-linear games.
- Lower-dimensional linear complementarity problem approaches to the solution of a bi-obstacle problem
- Enhanced intersection cutting-plane approach for linear complementarity problems
- On characterizing linear complementarity problems as linear programs
- Solution of a general linear complementarity problem using smooth optimization and its application to bilinear programming and LCP
- On the solution of NP-hard linear complementarity problems
- Note on solving linear complementarity problems as jointly constrained bilinear programs
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 Q5753757)
