Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized \((F,\alpha ,\rho ,\theta)\)-d-V-univex functions

DOI10.1016/J.MCM.2010.07.020zbMath1211.90212OpenAlexW2047401570MaRDI QIDQ534807

Anurag Jayswal, Suliman Al-Homidan, Izhar Ahmad

Publication date: 10 May 2011

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2010.07.020

zbMATH Keywords

multiobjective programming

Mathematics Subject Classification ID

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

Related Items (4)

Optimality and duality for nonsmooth multiobjective programming using G-type I functions ⋮ Higher order duality in multiobjective fractional programming with square root term under generalized higher order \((F, \alpha, \beta, \rho, \sigma, d)\)-V-type I univex functions ⋮ On approximating weakly/properly efficient solutions in multi-objective programming ⋮ Multiobjective programming under \((\varphi,d)\)-V-type I univexity

Cites Work

• Unnamed Item
• Unnamed Item
• Minimax fractional programming under nonsmooth generalized \((\mathcal F,\rho, \theta)\)-d-univexity
• Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems
• Pre-invex functions in multiple objective optimization
• On sufficiency of the Kuhn-Tucker conditions
• On efficiency and duality for multiobjective programs
• Nonsmooth multiobjective programs with \(V\)-\(\rho\)-invexity
• Nonlinear multiobjective optimization
• Sufficiency and duality in nonsmooth multiobjective optimization involving generalized \((F,\alpha,\rho,d)\)-type I functions
• Sufficiency and duality in multiobjective programming under generalized type I functions
• Nonsmooth invexity
• Further Generalizations of Convexity in Mathematical Programming
• On generalised convex mathematical programming
• Generalized (F, ρ)-convexity and duality for non smooth multi-objective programs
• Sufficiency and Duality in Multiobjective Programming with Generalized (F, ρ)-Convexity
• Generalized ( ,α, ρ, θ)–d–V–univex functions and non-smooth alternative theorems

This page was built for publication: Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized \((F,\alpha ,\rho ,\theta)\)-d-V-univex functions