Duality for a class of nonsmooth multiobjective programming problems using convexificators

DOI10.2298/FIL1702489JMaRDI QIDQ5005490zbMATH OpenFDO

Authors Anurag Jayswal, Krishna Kummari, Vivek Kumar Singh

Publication date 10 August 2021

Published in Filomat (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2298/FIL1702489J

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)

Recommendations

• Duality for a class of nonsmooth multiobjective programming problems
• Duality and Lagrange multipliers for nonsmooth multiobjective programming
• scientific article; zbMATH DE number 1349128
• Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators
• Generalized (F, )-convexity and duality in nonsmooth problems of multiobjective optimization

Cites work

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

Cited in

(4)

• Optimality and duality for nonsmooth minimax programming problems using convexifactor
• Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints
• Sufficient optimality, duality and saddle point analysis in terms of convexificators for nonsmooth robust fractional interval-valued optimization problems
• Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem

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

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