Optimality conditions for mixed discrete bilevel optimization problems
From MaRDI portal
Publication:5745161
Recommendations
- Bilevel programming with discrete lower level problems
- Solving discrete linear bilevel optimization problems using the optimal value reformulation
- Optimality conditions for bilevel programming: an approach through variational analysis
- Optimality criteria for bilevel programming problems using the radial subdifferential
- Bilevel optimization: reformulation and first optimality conditions
Cites work
- scientific article; zbMATH DE number 5982713 (Why is no real title available?)
- scientific article; zbMATH DE number 4061013 (Why is no real title available?)
- scientific article; zbMATH DE number 3791104 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- A note on optimality conditions for bilevel programming problems∗
- Bilevel programming with discrete lower level problems
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Constraint Qualifications and KKT Conditions for Bilevel Programming Problems
- Discrete linear bilevel programming problem
- Exact penalty functions for nonlinear integer programming problems
- Foundations of bilevel programming
- Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
- Necessary optimality conditions for bilevel optimization problems using convexificators
- Necessary optimality conditions in pessimistic bilevel programming
- New necessary optimality conditions in optimistic bilevel programming
- On calmness conditions in convex bilevel programming
- Optimality Conditions for a Simple Convex Bilevel Programming Problem
- Optimality conditions for a bilevel matroid problem
- Optimality conditions for bilevel programming problems
- Optimality conditions for bilevel programming problems
- Optimality criteria for bilevel programming problems using the radial subdifferential
- Sensitivity analysis for two-level value functions with applications to bilevel programming
- Solving discrete linear bilevel optimization problems using the optimal value reformulation
- Subgradients of marginal functions in parametric mathematical programming
- The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
- The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
- The steepest descent direction for the nonlinear bilevel programming problem
Cited in
(5)- MPEC methods for bilevel optimization problems
- A study of mixed discrete bilevel programs using semidefinite and semi-infinite programming
- Solving discrete linear bilevel optimization problems using the optimal value reformulation
- Bilevel programming with discrete lower level problems
- Bilevel optimization: theory, algorithms, applications and a bibliography
This page was built for publication: Optimality conditions for mixed discrete bilevel optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5745161)