Abstract
<p style='text-indent:20px;'>The main aim of this paper is to establish sufficient optimality conditions using an upper estimate of Clarke subdifferential of value function and the concept of convexifactor for optimistic bilevel programming problems with convex and non-convex lower-level problems. For this purpose, the notions of asymptotic pseudoconvexity and asymptotic quasiconvexity are defined in terms of the convexifactors.</p>
Publisher
American Institute of Mathematical Sciences (AIMS)
Subject
Applied Mathematics,Control and Optimization,Strategy and Management,Business and International Management,Applied Mathematics,Control and Optimization,Strategy and Management,Business and International Management
Reference35 articles.
1. I. Ahmad, K. Kummari, V. Singh, A. Jayswal.Optimality and duality for nonsmooth minimax programming problems using convexifactors, Filomat, 31 (2017), 4555-4570.
2. J. F. Bard, Practical Bilevel Optimization. Algorithms and Applications, Nonconvex Optim. Appl., 30, Kluwer Acad. Publ., Dordrecht, 1998.
3. J. F. Bard.Optimality conditions for the bilevel programming problem, Naval Res. Logist. Quart., 31 (1984), 13-26.
4. J. F. Bard.Some properties of the bilevel programming problem, J. Optim. Theory Appl., 68 (1991), 371-378.
5. C. R. Bector, S. Chandra and J. Dutta, Principles of Optimization Theory, Narosa Publishing House, 2005.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献