[4] On strong KKT type sufficient optimality conditions for multiobjective semi-infinite programming problems with vanishing constraints. Journal of Inequalities and Applications (2017).

In the linear programming approach to approximate dynamic programming, one tries to solve a certain linear program-the ALP-that has a relatively small number K of variables but an intractable number M ...

Mathematical programming with vanishing constraints (MPVC): A class of optimisation problems where certain constraints may become inactive (vanish) depending on the values of the decision ...