HOW STRINGENT IS THE LINEAR INDEPENDENCE ASSUMPTION FOR MATHEMATICAL PROGRAMS WITH COMPLEMENTARITY CONSTRAINTS?

The linear independence constraint qualifications (LICQ) plays an important role in the analysis of mathematical programs with complementarity constraints (MPCCs)and is a vital ingredient to convergence analyses of SQP-type or smoothing methods, cf., e.g., Fukushima and Pang (1999), Luo et al. (1996), Scholtes and Stöhr (1999), Scholtes (2001), Stöhr (2000). We will argue in this paper that LICQ is not a particularly stringent assumption for MPCCs. Our arguments are based on an extension of Jongen's (1977) genericity analysis to MPCCs. His definitions of nondegenerate critical points and regular programs extend naturally to MPCCs and his genericity results generalize straightforwardly to MPCCs in standard form. An extension is not as straightforward for MPCCs with the particular structure induced by lower-level stationarity conditions for variational inequalities or optimization problems. We show that LICQ remains a generic property for this class of MPCCs. [ABSTRACT FROM AUTHOR]