Abstract.
This paper addresses a General Linear Complementarity Problem (GLCP) that has found applications in global optimization. It is shown that a solution of the GLCP can be computed by finding a stationary point of a differentiable function over a set defined by simple bounds on the variables. The application of this result to the solution of bilinear programs and LCPs is discussed. Some computational evidence of its usefulness is included in the last part of the paper.
Author information
Authors and Affiliations
Additional information
Accepted 28 June 1999. Online publication 4 December 2000.
Rights and permissions
About this article
Cite this article
Fernandes, L., Friedlander, A., Guedes, M. et al. Solution of a General Linear Complementarity Problem Using Smooth Optimization and Its Application to Bilinear Programming and LCP. Appl Math Optim 43, 1–19 (2001). https://doi.org/10.1007/s002450010021
Published:
Issue Date:
DOI: https://doi.org/10.1007/s002450010021