Comments on: Algorithms for linear programming with linear complementarity constraints 1

• Mihai Anitescu ^[1]
  1. [1] Argonne National Laboratory

     Argonne National Laboratory

     Township of Lemont, Estados Unidos

     
• Localización: Top, ISSN-e 1863-8279, ISSN 1134-5764, Vol. 20, Nº. 1, 2012, págs. 26-27
• Idioma: inglés
• Enlaces
  • Texto completo (pdf)
• Resumen

  • The paper is a very valuable reference for some of the technical issues that appear in linear programming with complementarity constraints. Indeed, despite the progress in the past 15 years in the area, the issue of finding practical algorithms for global convergence is elusive, in even the simplest cases, such as the case where every data function of the problem is linear (except for the complementarity constraints). The paper presents an excellent survey of a broad array of techniques that are useful— even if perhaps just partially studied—toward that end