Mathematical programs with vanishing constraints constitute a new class of difficult optimization problems with important applications in optimal topology design of mechanical structures. Vanishing constraints usually violate standard constraint qualifications, which gives rise to serious...

The elegant theoretical results for strong duality and strict complementarity for linear programming, LP, lie behind the success of current algorithms. In addition, preprocessing is an essential step for efficiency in both simplex type and interior-point methods. However, the theory and...