Duality for a class of nonsmooth multiobjective programming problems using convexificators

DOI10.2298/FIL1702489JzbMath1499.90197MaRDI QIDQ5005490

Krishna Kummari, Anurag Jayswal, Vivek Kumar Singh

Publication date: 10 August 2021

Published in: Filomat (Search for Journal in Brave)

zbMATH Keywords

dualityefficient solutionconvexificatorsnonsmooth multiobjective programmingdirectional Dini-derivatives

Mathematics Subject Classification ID

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

Related Items (2)

Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem ⋮ Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Optimality conditions for efficiency on nonsmooth multiobjective programming problems
• Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case
• Nonsmooth calculus, minimality, and monotonicity of convexificators
• Hunting for a smaller convex subdifferential
• Optimality and duality in nonsmooth multiobjective optimization involving generalized type I functions
• Sufficiency and duality in nonsmooth multiobjective optimization involving generalized \((F,\alpha,\rho,d)\)-type I functions
• Duality for mixed second-order programs with multiple arguments
• Nonsmooth invexity
• A duality theorem for non-linear programming
• Tangent Sets’ Calculus and Necessary Conditions for Extremality
• Nonsmooth Invexity in Multiobjective Programming
• Convexifactors, generalized convexity and vector optimization
• Optimality and Duality for Invex Nonsmooth Multiobjective programming problems

This page was built for publication: Duality for a class of nonsmooth multiobjective programming problems using convexificators