Linear Complementarity as a General Solution Method to Combinatorial Problems

Linear Complementarity as a General Solution Method to Combinatorial Problems

0.00 Avg rating0 Votes
Article ID: iaor200916812
Country: United States
Volume: 19
Issue: 1
Start Page Number: 73
End Page Number: 79
Publication Date: Jan 2007
Journal: INFORMS Journal On Computing
Authors: , ,
Keywords: programming: linear
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.