Login / Signup

A new type of solution method for the generalized linear complementarity problem over a polyhedral cone.

Hongchun SunYan-Liang Dong
Published in: Int. J. Autom. Comput. (2009)
Keyphrases
  • linear complementarity problem
  • optimization method
  • computational complexity
  • objective function
  • dynamic programming
  • clustering method
  • special case
  • linear programming
  • sensitivity analysis