Linear Complementarity as a General Solution Method to Combinatorial Problems

This paper shows how many types of combinatorial problems can be embedded in continuous space and solved as nonconvex optimization problems. If the objective function and the constraints are linear, problems of this kind can be formulated as linear complementarity problems. An algorithm is presented to solve this type of problem and indicate its convergence properties. Computational comparisons are carried out using general solution codes.