Pages that link to "Item:Q1090250"
From MaRDI portal
The following pages link to Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods (Q1090250):
Displaying 11 items.
- Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games (Q868531) (← links)
- Enumeration-based approach to solving parametric linear complementarity problems (Q901133) (← links)
- An enumerative method for the solution of linear complementarity problems (Q1110460) (← links)
- A computational analysis of LCP methods for bilinear and concave quadratic programming (Q1184453) (← links)
- Some optimization reformulations of the extended linear complementarity problem (Q1294825) (← links)
- On the connectedness of the solution set to linear complementarity systems (Q1321481) (← links)
- On the solution and complexity of a generalized linear complementarity problem (Q1327430) (← links)
- Links between linear bilevel and mixed 0-1 programming problems (Q1379953) (← links)
- Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint (Q2564166) (← links)
- Reformulations in Mathematical Programming: Definitions and Systematics (Q3621976) (← links)
- An experimental study of a DC optimization algorithm for bimatrix games (Q5164671) (← links)