LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Optimality conditions for pessimistic bilevel problems using convexificator

Photo from archive.org

The purpose of this paper is to study the pessimistic version of bilevel programming problems in finite-dimensional spaces. Problems of this type are intrinsically nonsmooth (even for smooth initial data).… Click to show full abstract

The purpose of this paper is to study the pessimistic version of bilevel programming problems in finite-dimensional spaces. Problems of this type are intrinsically nonsmooth (even for smooth initial data). By using optimal value function, we transform the initial problem into a generalized minimax optimization problem. Using convexificators, first-order necessary optimality conditions are then established. An example that illustrates our findings is also given.

Keywords: optimality conditions; bilevel; pessimistic bilevel; bilevel problems; conditions pessimistic

Journal Title: Positivity
Year Published: 2020

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.