共查询到1条相似文献,搜索用时 0 毫秒
1.
This paper focuses on bilevel programs with a convex lower-level problem violating Slater’s constraint qualification. We relax the constrained domain of the lower-level problem. Then, an approximate solution of the original bilevel program can be obtained by solving this perturbed bilevel program. As the lower-level problem of the perturbed bilevel program satisfies Slater’s constraint qualification, it can be reformulated as a mathematical program with complementarity constraints which can be solved by standard algorithms. The lower convergence properties of the constraint set mapping and the solution set mapping of the lower-level problem of the perturbed bilevel program are expanded. We show that the solutions of a sequence of the perturbed bilevel programs are convergent to that of the original bilevel program under some appropriate conditions. And this convergence result is applied to simple trilevel programs. 相似文献