Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem

DOI10.3934/jimo.2020114zbMath1476.90261OpenAlexW3040554357MaRDI QIDQ2666718

Bhawna Kohli

Publication date: 23 November 2021

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2020114

zbMATH Keywords

optimality conditionsvalue functionconstraint qualificationsbilevel programming problemconvexifactors

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)

Related Items (max. 100)

A study on vector variational-like inequalities using convexificators and application to its bi-level form

Cites Work

• Unnamed Item
• Optimality conditions and duality for interval-valued optimization problems using convexifactors
• Optimality condition for local efficient solutions of vector equilibrium problems via convexificators and applications
• Duality for multiobjective fractional programming problem using convexifactors
• Optimality conditions for optimistic bilevel programming problem using convexifactors
• Generalized nonsmooth cone convexity in terms of convexifactors in vector optimization
• Optimality and duality results for bilevel programming problem using convexifactors
• Convexifactors, generalized convexity, and optimality conditions
• Some properties of the bilevel programming problem
• Subgradients of marginal functions in parametric mathematical programming
• Nonsmooth calculus, minimality, and monotonicity of convexificators
• Practical bilevel optimization. Algorithms and applications
• Necessary optimality conditions for Stackelberg problems
• Foundations of bilevel programming
• Necessary optimality conditions in terms of convexificators in Lipschitz optimization
• Optimality conditions in optimization problems with convex feasible set using convexificators
• A note on the paper ``Optimality conditions for optimistic bilevel programming problem using convexifactors
• Optimality conditions for the bilevel programming problem
• Optimization and nonsmooth analysis
• A necessary and a sufficient optimality condition for bilevel programming problems
• Relationships Between Convexificators and Greenberg–Pierskalla Subdifferentials for Quasiconvex Functions
• Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
• Nondifferentiable Multiplier Rules for Optimization and Bilevel Optimization Problems
• Convexifactors, generalized convexity and vector optimization
• Optimality conditions for bilevel programming problems
• Duality for a class of nonsmooth multiobjective programming problems using convexificators
• Optimality and duality for nonsmooth minimax programming problems using convexifactor
• Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints
• Variational Stability and Marginal Functions via Generalized Differentiation
• Constraint Qualifications and KKT Conditions for Bilevel Programming Problems
• New necessary optimality conditions in optimistic bilevel programming
• First-order necessary optimality conditions for general bilevel programming problems

This page was built for publication: Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem