The equivalence of an LCP to a parametric linear program with a scalar parameter
From MaRDI portal
Publication:1178643
DOI10.1016/0377-2217(91)90312-JzbMath0741.90075MaRDI QIDQ1178643
Publication date: 26 June 1992
Published in: European Journal of Operational Research (Search for Journal in Brave)
90C31: Sensitivity, stability, parametric optimization
90C05: Linear programming
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Solving large protein secondary structure classification problems by a nonlinear complementarity algorithm with {0, 1} variables, A weight-balanced branching rule for SAT, Formal methods in pattern recognition: A review, Backtracking tactics in the backtrack method for SAT, Optimal adaptive control of treatment planning in radiation therapy, Running time experiments on some algorithms for solving propositional satisfiability problems, Dynamic nonlinear modelization of operational supply chain systems
Uses Software
Cites Work
- Non-negative matrices and Markov chains. 2nd ed
- Matrix eigensystem routines - EISPACK guide. 2nd ed
- Matrix eigensystem routines. EISPACK guide extension
- Some generalizations of positive definiteness and monotonicity
- Complementary pivot theory of mathematical programming
- Simplified Characterizations of Linear Complementarity Problems Solvable as Linear Programs
- Characterizations of bounded solutions of linear complementarity problems
- Linear complementarity problems solvable by A single linear program
- Characterization of linear complementarity problems as linear programs
- On solving linear complementarity problems as linear programs
- A Least-Element Theory of Solving Linear Complementarity Problems as Linear Programs
- On the Alass of Complementary Cones and Lemke’s Algorithm
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
