Bilevel programs with extremal value function: global optimality
From MaRDI portal
Summary: For a bilevel program with extremal value function, a necessary and sufficient condition for global optimality is given, which reduces the bilevel program to a max-min problem with linked constraints. Also, for the case where the extremal value function is polyhedral, this optimality condition gives the possibility of a resolution via a maximization problem of a polyhedral convex function over a convex set. Finally, this case is completed by an algorithm.
Recommendations
- Global optimization of nonlinear bilevel programming problems
- scientific article; zbMATH DE number 2068075
- scientific article; zbMATH DE number 1931010
- A method for a -global optimal solution of linear bilevel programming
- Global solution of bilevel programming problems
- Global solution of bilevel programs with a nonconvex inner program
- Optimality conditions for bilevel programming problems
- Optimality conditions for bilevel programming problems
- scientific article; zbMATH DE number 432976
- Optimality conditions for bilevel programming problems
Cited in
(5)- A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs
- Variational analysis of marginal functions with applications to bilevel programming
- scientific article; zbMATH DE number 1931010 (Why is no real title available?)
- A Fenchel-Lagrange duality approach for a bilevel programming problem with extremal-value function
- Second-order necessary conditions for bilevel programs via KKT reformulation
This page was built for publication: Bilevel programs with extremal value function: global optimality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2566594)
