Optimality Conditions Using Convexifactors for a Multiobjective Fractional Bilevel Programming Problem

DOI10.5556/j.tkjm.54.2023.3830zbMath1514.90209MaRDI QIDQ6107695

Bhawna Kohli

Publication date: 3 July 2023

Published in: Tamkang Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

value functionconstraint qualificationsconvexifactorsmultiobjective fractional bilevel programming problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• 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
• Global efficiency for multiobjective bilevel programming problems under generalized invexity
• Optimality and duality results for bilevel programming problem using convexifactors
• Convexifactors, generalized convexity, and optimality conditions
• Some properties of the bilevel programming problem
• Nonsmooth calculus, minimality, and monotonicity of convexificators
• Practical bilevel optimization. Algorithms and applications
• Necessary optimality conditions for Stackelberg problems
• Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
• A note on `bilevel linear fractional programming problem'.
• Foundations of bilevel programming
• The bilevel linear/linear fractional programming problem
• Necessary optimality conditions and a new approach to multiobjective bilevel optimization problems
• Semivectorial bilevel optimization problem: penalty approach
• Necessary optimality conditions in terms of convexificators in Lipschitz optimization
• Optimality conditions in optimization problems with convex feasible set using convexificators
• Necessary Optimality Conditions for Multiobjective Bilevel Programs
• Optimality conditions for the bilevel programming problem
• 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
• Efficiency conditions for multiobjective bilevel programming problems via convexificators
• Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints
• Constraint Qualifications and KKT Conditions for Bilevel Programming Problems
• New necessary optimality conditions in optimistic bilevel programming
• Optimality Conditions for Semivectorial Bilevel Convex Optimal Control Problems
• First-order necessary optimality conditions for general bilevel programming problems

This page was built for publication: Optimality Conditions Using Convexifactors for a Multiobjective Fractional Bilevel Programming Problem