[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 ...

In this paper we consider the bilevel programming problem (BLPP), which is a sequence of two optimization problems where the constraint region of the upper-level problem is determined implicitly by ...