On the asymmetric eigenvalue complementarity problem
Optimization Methods & Software - GLOBAL OPTIMIZATION
Complementary approaches for the computation of the independent number of a graph
MATH'09 Proceedings of the 14th WSEAS International Conference on Applied mathematics
ACM Transactions on Graphics (TOG) - SIGGRAPH 2012 Conference Proceedings
On linear programs with linear complementarity constraints
Journal of Global Optimization
Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem
Journal of Global Optimization
On convex quadratic programs with linear complementarity constraints
Computational Optimization and Applications
| Hi-index | 0.01 |
This paper presents a parameter-free integer-programming-based algorithm for the global resolution of a linear program with linear complementarity constraints (LPCCs). The cornerstone of the algorithm is a minimax integer program formulation that characterizes and provides certificates for the three outcomes—infeasibility, unboundedness, or solvability—of an LPCC. An extreme point/ray generation scheme in the spirit of Benders decomposition is developed, from which valid inequalities in the form of satisfiability constraints are obtained. The feasibility problem of these inequalities and the carefully guided linear-programming relaxations of the LPCC are the workhorses of the algorithm, which also employs a specialized procedure for the sparsification of the satifiability cuts. We establish the finite termination of the algorithm and report computational results using the algorithm for solving randomly generated LPCCs of reasonable sizes. The results establish that the algorithm can handle infeasible, unbounded, and solvable LPCCs effectively.