Open AccessSufficient optimality conditions using convexifactors for optimistic bilevel programming problem
Author(s) -
Bhawna Kohli
Publication year - 2021
Publication title -
journal of industrial and management optimization
Language(s) - English
Resource type - Journals
eISSN - 1553-166X
pISSN - 1547-5816
DOI - 10.3934/jimo.2020114
Subject(s) - subderivative , bilevel optimization , bellman equation , regular polygon , function (biology) , mathematical optimization , mathematics , value (mathematics) , mathematical economics , convex function , computer science , convex optimization , optimization problem , statistics , geometry , evolutionary biology , biology
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.