New necessary and sufficient optimality conditions for strong bilevel programming problems
From MaRDI portal
Publication:1702864
DOI10.1007/s10898-018-0606-5zbMath1396.90061OpenAlexW2793029537MaRDI QIDQ1702864
Samir Adly, Abdelmalek Aboussoror
Publication date: 1 March 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-018-0606-5
Nonconvex programming, global optimization (90C26) Hierarchical games (including Stackelberg games) (91A65) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ Sufficient Optimality Conditions in Bilevel Programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strong-weak nonlinear bilevel problems: existence of solutions in a sequential setting
- The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
- Topological existence and stability for min sup problems
- Second order optimality conditions for bilevel set optimization problems
- Convex programs with an additional reverse convex constraint
- Sequential Stackelberg equilibria in two-person games
- On the global minimization of a convex function under general nonconvex constraints
- On generalized Stackelberg strategies
- Existence and approximation results involving regularized constrained Stackelberg problems
- Stability of regularized bilevel programming problems
- Weak linear bilevel programming problems: existence of solutions via a penalty method
- New Necessary Optimality Conditions for Bilevel Programs by Combining the MPEC and Value Function Approaches
- On the numerical solution of a class of Stackelberg problems
- Existence theorems of equilibrium points in stackelberg
- Necessary conditions for min-max problems and algorithms by a relaxation procedure
- A linear max—min problem
- New necessary optimality conditions in optimistic bilevel programming
- Convex Analysis
This page was built for publication: New necessary and sufficient optimality conditions for strong bilevel programming problems
