New necessary and sufficient optimality conditions for strong bilevel programming problems
DOI10.1007/S10898-018-0606-5zbMATH Open1396.90061OpenAlexW2793029537MaRDI QIDQ1702864FDOQ1702864
Authors: Abdelmalek Aboussoror, Samir Adly 
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
Recommendations
- scientific article; zbMATH DE number 432976
- A necessary and a sufficient optimality condition for bilevel programming problems
- Sufficient optimality conditions in bilevel programming
- An extended Fenchel-Lagrange duality approach and optimality conditions for strong bilevel programming problems
- Optimality conditions for bilevel programming problems
Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Hierarchical games (including Stackelberg games) (91A65)
Cites Work
- Convex Analysis
- Stability of regularized bilevel programming problems
- Weak linear bilevel programming problems: existence of solutions via a penalty method
- Existence theorems of equilibrium points in stackelberg
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- New necessary optimality conditions in optimistic bilevel programming
- The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
- New necessary optimality conditions for bilevel programs by combining the MPEC and value function approaches
- Topological existence and stability for min sup problems
- Necessary conditions for min-max problems and algorithms by a relaxation procedure
- On the numerical solution of a class of Stackelberg problems
- Title not available (Why is that?)
- A linear max—min problem
- Sequential Stackelberg equilibria in two-person games
- On generalized Stackelberg strategies
- Strong-weak nonlinear bilevel problems: existence of solutions in a sequential setting
- Second order optimality conditions for bilevel set optimization problems
- Convex programs with an additional reverse convex constraint
- Existence and approximation results involving regularized constrained Stackelberg problems
- Title not available (Why is that?)
- On the global minimization of a convex function under general nonconvex constraints
- Bilevel programs: approximation results involving reverse convex programs
- Title not available (Why is that?)
Cited In (6)
- A duality approach and optimality conditions for simple convex bilevel programming problems
- An extended Fenchel-Lagrange duality approach and optimality conditions for strong bilevel programming problems
- Sufficient optimality conditions in bilevel programming
- A new method for strong-weak linear bilevel programming problem
- Bilevel optimization: theory, algorithms, applications and a bibliography
- A necessary and a sufficient optimality condition for bilevel programming problems
This page was built for publication: New necessary and sufficient optimality conditions for strong bilevel programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1702864)
