Efficiency conditions for multiobjective bilevel programming problems via convexificators

DOI10.23952/JNVA.4.2020.3.05MaRDI QIDQ5152038zbMATH OpenOpenAlexFDO

Authors Do Van Luu, Tran Thi Mai

Publication date 18 February 2021

Published in Journal of Nonlinear and Variational Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.23952/jnva.4.2020.3.05

zbMATH Keywords

constraint qualificationsconvexificatorsefficiency conditionsmultiobjective bilevel programming problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52)

Recommendations

• Necessary and sufficient conditions for efficiency via convexificators
• Necessary optimality conditions for bilevel optimization problems using convexificators
• Global efficiency for multiobjective bilevel programming problems under generalized invexity
• Optimality conditions and duality in terms of convexificators for multiobjective bilevel programming problem with equilibrium constraints
• Optimality conditions for efficiency on nonsmooth multiobjective programming problems

Cites work

• scientific article; zbMATH DE number 3905307 (Why is no real title available?)
• scientific article; zbMATH DE number 823381 (Why is no real title available?)
• A necessary and a sufficient optimality condition for bilevel programming problems
• Convexificators and necessary conditions for efficiency
• First-order necessary optimality conditions for general bilevel programming problems
• Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
• Necessary and sufficient conditions for efficiency via convexificators
• Necessary optimality conditions for Stackelberg problems
• Necessary optimality conditions for bilevel optimization problems using convexificators
• Necessary optimality conditions in terms of convexificators in Lipschitz optimization
• New necessary optimality conditions in optimistic bilevel programming
• Nonsmooth analysis
• Nonsmooth calculus, minimality, and monotonicity of convexificators
• Optimality and duality results for bilevel programming problem using convexifactors
• Optimality condition for local efficient solutions of vector equilibrium problems via convexificators and applications
• Optimality conditions and duality in nonsmooth multiobjective optimization problems
• Optimality conditions for bilevel programming problems
• Optimality conditions for optimistic bilevel programming problem using convexifactors
• Optimality conditions for the bilevel programming problem
• Optimization and nonsmooth analysis
• Scalarization and optimality conditions for vector equilibrium problems
• Some properties of the bilevel programming problem

Cited in

(7)

• Optimality conditions and duality in terms of convexificators for multiobjective bilevel programming problem with equilibrium constraints
• Convexificators and necessary conditions for efficiency
• Necessary and sufficient conditions for efficiency via convexificators
• Efficiency and approachability of nonconvex bicriteria programs
• Optimality Conditions Using Convexifactors for a Multiobjective Fractional Bilevel Programming Problem
• Constraint qualifications and optimality conditions for robust nonsmooth semi-infinite multiobjective optimization problems
• Global efficiency for multiobjective bilevel programming problems under generalized invexity

This page was built for publication: Efficiency conditions for multiobjective bilevel programming problems via convexificators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5152038)