First-order necessary optimality conditions for general bilevel programming problems
From MaRDI portal
Publication:5906878
DOI10.1023/A:1022646611097zbMath0903.90148OpenAlexW1563534836MaRDI QIDQ5906878
Publication date: 12 January 1999
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022646611097
Nonlinear programming (90C30) Hierarchical games (including Stackelberg games) (91A65) Nonsmooth analysis (49J52)
Related Items (21)
A bilevel programming approach to double optimal stopping ⋮ Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem ⋮ Approximate values for mathematical programs with variational inequality constraints ⋮ Applying directional upper semi-regular convexificators in bilevel optimization ⋮ Optimality Conditions Using Convexifactors for a Multiobjective Fractional Bilevel Programming Problem ⋮ Optimality conditions for optimistic bilevel programming problem using convexifactors ⋮ On multiobjective bilevel optimization using tangential subdifferentials ⋮ Optimality and duality results for bilevel programming problem using convexifactors ⋮ Sufficient Optimality Conditions for a Bilevel Semivectorial D.C. Problem ⋮ Necessary optimality conditions for bilevel set optimization problems ⋮ Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development ⋮ Efficiency conditions for multiobjective bilevel programming problems via convexificators ⋮ An equivalent one level optimization problem to a semivectorial bilevel problem ⋮ Optimality conditions for a multiobjective bilevel optimization problem involving set valued constraints ⋮ A new equivalent single-level problem for bilevel problems ⋮ Second order optimality conditions for bilevel set optimization problems ⋮ Necessary optimality conditions for bilevel optimization problems using convexificators ⋮ Fuzzy and Exact Optimality Conditions for a Bilevel Set-Valued Problem via Extremal Principles ⋮ Optimality results for a specific bilevel optimization problem ⋮ Necessary optimality conditions of a D.C. set-valued bilevel optimization problem ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- Unnamed Item
- Existence of optimal solutions to mathematical programs with equilibrium constraints
- On an algorithm solving two-level programming problems with nonunique lower level solutions
- Optimization and nonsmooth analysis
- Existence theorems of equilibrium points in stackelberg
- Convex Analysis
- First-order necessary optimality conditions for general bilevel programming problems
This page was built for publication: First-order necessary optimality conditions for general bilevel programming problems
