On directionally differentiable multiobjective programming problems with vanishing constraints

DOI10.1007/s10479-023-05368-5zbMath1518.90100MaRDI QIDQ6179215

Tadeusz Antczak

Publication date: 5 September 2023

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

convex functionPareto solutionKarush-Kuhn-Tucker necessary optimality conditionsWolfe vector dualdirectionally differentiable multiobjective programming problems with vanishing constraints

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Optimality conditions for free problems in two or more independent variables (49K10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiobjective programming under \((\varphi,d)\)-V-type I univexity
• On duality for mathematical programs with vanishing constraints
• Mathematical programs with vanishing constraints: critical point theory
• Optimality and duality in nondifferentiable and multiobjective programming under generalized \(d\)-invexity
• Some nondifferentiable multiobjective programming problems
• Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
• First- and second-order optimality conditions for mathematical programs with vanishing constraints.
• Optimality conditions and duality for nondifferentiable multiobjective programming problems involving \(d\)-\(r\)-type I functions
• Mathematical programs with vanishing constraints: Optimality conditions, sensitivity, and a relaxation method
• Nondifferentiable multiobjective programming under generalized \(d_I\)-invexity
• \(D\)-invexity and optimality conditions
• On constraint qualification in multiobjective optimization problems: Semidifferentiable case
• Optimality conditions for directionally differentiable multi-objective programming problems
• On strong KKT type sufficient optimality conditions for multiobjective semi-infinite programming problems with vanishing constraints
• Notes on convergence properties for a smoothing-regularization approach to mathematical programs with vanishing constraints
• Duality and a characterization of pseudoinvexity for Pareto and weak Pareto solutions in nondifferentiable multiobjective programming
• Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints
• Optimality conditions and Mond-Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints
• New dualities for mathematical programs with vanishing constraints
• Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
• A smoothing-regularization approach to mathematical programs with vanishing constraints
• Enhanced Fritz John stationarity, new constraint qualifications and local error bound for mathematical programs with vanishing constraints
• Mathematical programs with vanishing constraints: a new regularization approach with strong convergence properties
• On Constraint Qualifications for Multiobjective Optimization Problems with Vanishing Constraints
• On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
• Mathematical programs with vanishing constraints: constraint qualifications, their applications, and a new regularization method
• Convex Analysis
• Multiobjective programming under \(d\)-invexity
• Finite dimensional convexity and optimization

This page was built for publication: On directionally differentiable multiobjective programming problems with vanishing constraints