Pages that link to "Item:Q1087474"
From MaRDI portal
The following pages link to Bounds for the solution set of linear complementarity problems (Q1087474):
Displaying 16 items.
- Note on solving linear complementarity problems as jointly constrained bilinear programs (Q809900) (← links)
- The bounds on components of the solution for consistent linear systems (Q817063) (← links)
- A characterization of Delsarte's linear programming bound as a ratio bound (Q876308) (← links)
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique (Q1275717) (← links)
- Solution of linear complementarity problems using minimization with simple bounds (Q1892604) (← links)
- Enhanced intersection cutting-plane approach for linear complementarity problems (Q2565006) (← links)
- On the solution of bounded and unbounded mixed complementarity problems (Q2767572) (← links)
- A representation of the solution set of a class of linear complementarity problems (Q2790881) (← links)
- Simple computable bounds for solutions of linear complementarity problems and linear programs (Q3707783) (← links)
- Linear complementarity problems solvable by integer programming (Q3798493) (← links)
- The integer linear complementarity problem (Q4009715) (← links)
- (Q4293847) (← links)
- A combinatorial bound for linear programming and related problems (Q5096811) (← links)
- The numerical range theory and boundedness of solutions of the complementarity problem (Q5893789) (← links)
- The numerical range theory and boundedness of solutions of the complementarity problem (Q5895386) (← links)
- Bounds of the solution set to the polynomial complementarity problem (Q6636781) (← links)