An Extended Fenchel-Lagrange Duality Approach and Optimality Conditions for Strong Bilevel Programming Problems

In this paper we give a conjugate duality approach for a strong bilevel programming problem (S). The approach is based on the use of a regularization of problem (S) and the so-called Fenchel–Lagrange duality. We first show that the regularized problem of (S) admits solutions and any accumulation point of a sequence of regularized solutions solves (S). Then… CONTINUE READING