Pages that link to "Item:Q5184695"
From MaRDI portal
The following pages link to Application of disjunctive programming to the linear complementarity problem (Q5184695):
Displaying 14 items.
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem (Q1068731) (← links)
- Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods (Q1090250) (← links)
- An experimental investigation of enumerative methods for the linear complementarity problem (Q1104872) (← links)
- Quadratic programming problems and related linear complementarity problems (Q1121791) (← links)
- Necessary and sufficient conditions for the existence of complementary solutions and characterizations of the matrix classes \(Q\) and \(Q_ 0\) (Q1177232) (← links)
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique (Q1275717) (← links)
- Basic-set algorithm for a generalized linear complementarity problem (Q1321226) (← links)
- A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems (Q1321811) (← links)
- Convexification techniques for linear complementarity constraints (Q2045009) (← links)
- Disjunctive programming and the generalized Leontief input-output model (Q2483224) (← links)
- Enhanced intersection cutting-plane approach for linear complementarity problems (Q2565006) (← links)
- Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization (Q3030594) (← links)
- Stability in disjunctive optimization II:continuity of the feasible and optimal set (Q4764595) (← links)
- (Q4795354) (← links)
