On the partial calmness condition for an interval-valued bilevel optimization problem
From MaRDI portal
Recommendations
- On interval-valued bilevel optimization problems using upper convexificators
- Necessary optimality conditions for a semivectorial bilevel problem under a partial calmness condition
- Optimality results for a specific bilevel optimization problem
- Optimality conditions for bilevel programming: an approach through variational analysis
- Optimality conditions for bilevel programming problems
Cites work
- A Decomposition Method for Interval Linear Programming
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Bilevel programming problems. Theory, algorithms and applications to energy networks
- Comments on: ``A note on the paper ``Optimality conditions for optimistic bilevel programming problem using convexifactors
- Convex Analysis
- Convexifactors, generalized convexity, and optimality conditions
- Generic property of the partial calmness condition for bilevel programming problems
- Goal programming problems with interval coefficients and target intervals
- scientific article; zbMATH DE number 3748742 (Why is no real title available?)
- scientific article; zbMATH DE number 3766957 (Why is no real title available?)
- scientific article; zbMATH DE number 175961 (Why is no real title available?)
- scientific article; zbMATH DE number 823381 (Why is no real title available?)
- Multiobjective programming in optimization of the interval objective function
- Necessary optimality conditions for a bilevel multiobjective programming problem via a -reformulation
- Necessary optimality conditions for a semivectorial bilevel problem under a partial calmness condition
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- On calmness conditions in convex bilevel programming
- On interval-valued nonlinear programming problems
- On sufficiency and duality for a class of interval-valued programming problems
- Optimality conditions for bilevel programming problems
- Optimality conditions for optimistic bilevel programming problem using convexifactors
- Optimality conditions of type KKT for optimization problem with interval-valued objective function via generalized derivative
- Optimization and nonsmooth analysis
- Practical bilevel optimization. Algorithms and applications
- Robust optimization-methodology and applications
- Subgradients of marginal functions in parametric mathematical programming
- Sufficient optimality conditions and duality theory for interval optimization problem
- The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
- The Karush--Kuhn--Tucker optimality conditions in an optimization problem with interval-valued objective function
- The Karush-Kuhn-Tucker optimality conditions in multiobjective programming problems with interval-valued objective functions
- Weak Sharp Minima in Mathematical Programming
Cited in
(2)
This page was built for publication: On the partial calmness condition for an interval-valued bilevel optimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6632163)
