Optimality conditions for mixed discrete bilevel optimization problems
From MaRDI portal
Publication:5745161
DOI10.1080/02331934.2018.1427092zbMATH Open1407.90337OpenAlexW2791954296MaRDI QIDQ5745161FDOQ5745161
Authors: Stephan Dempe, F. Mefo Kue, P. Mehlitz
Publication date: 5 June 2018
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2018.1427092
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
Optimality conditions and duality in mathematical programming (90C46) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31)
Cites Work
- Foundations of bilevel programming
- Optimality Conditions for a Simple Convex Bilevel Programming Problem
- On calmness conditions in convex bilevel programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sensitivity analysis for two-level value functions with applications to bilevel programming
- Necessary optimality conditions in pessimistic bilevel programming
- New necessary optimality conditions in optimistic bilevel programming
- The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
- Subgradients of marginal functions in parametric mathematical programming
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Title not available (Why is that?)
- Optimality conditions for bilevel programming problems
- Constraint Qualifications and KKT Conditions for Bilevel Programming Problems
- Necessary optimality conditions for bilevel optimization problems using convexificators
- The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
- Exact penalty functions for nonlinear integer programming problems
- Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
- Discrete linear bilevel programming problem
- Bilevel programming with discrete lower level problems
- Optimality criteria for bilevel programming problems using the radial subdifferential
- Optimality conditions for a bilevel matroid problem
- The steepest descent direction for the nonlinear bilevel programming problem
- A note on optimality conditions for bilevel programming problems∗
- Optimality conditions for bilevel programming problems
- Title not available (Why is that?)
- Solving discrete linear bilevel optimization problems using the optimal value reformulation
Cited In (4)
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)