Pages that link to "Item:Q1804582"

The following pages link to The linear complementarity problem as a separable bilinear program (Q1804582):

Displaying 18 items.

• Residual iterative method for solving absolute value equations (Q410174) (← links)
• Generalized AOR method for solving absolute complementarity problems (Q443063) (← links)
• Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems (Q550095) (← links)
• On the solution of NP-hard linear complementarity problems (Q699514) (← links)
• Convergence of SSOR methods for linear complementarity problems (Q833585) (← links)
• Absolute value equations (Q865400) (← links)
• Absolute value programming (Q885823) (← links)
• Knapsack feasibility as an absolute value equation solvable by successive linear programming (Q1024724) (← links)
• Enumeration approach for linear complementarity problems based on a reformulation-linearization technique (Q1275717) (← links)
• Arbitrary-norm separating plane (Q1306363) (← links)
• On an iterative method for solving absolute value equations (Q1758043) (← links)
• Algorithms for linear programming with linear complementarity constraints (Q1935876) (← links)
• Novel algorithms for solving a system of absolute value variational inequalities (Q2138161) (← links)
• Merit functions for absolute value variational inequalities (Q2142807) (← links)
• Robust approach for air cargo freight forwarder selection under disruption (Q2196089) (← links)
• Promoting symmetric weight selection in data envelopment analysis: a penalty function approach (Q2379559) (← links)
• Generalized symmetric accelerated over relaxation method for solving absolute value complementarity problems (Q2840266) (← links)
• Reformulations in Mathematical Programming: Definitions and Systematics (Q3621976) (← links)