Sufficiency and Duality in Multiobjective Programming with Generalized (F, ρ)-Convexity

DOI10.1515/JAA.2005.19zbMath1140.90484OpenAlexW2117241005MaRDI QIDQ5316897

Izhar Ahmad

Publication date: 15 September 2005

Published in: Journal of Applied Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jaa.2005.19

zbMATH Keywords

generalized convexitydualityMultiobjective programmingsufficiency

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Related Items (7)

On sufficiency and duality for nonsmooth multiobjective programming problems involving generalized \(V-r\)-invex functions ⋮ Second Order Duality in Multiobjective Programming ⋮ Saddle point criteria in semi-infinite minimax fractional programming under (Φ,ρ)-invexity ⋮ Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized \((F,\alpha ,\rho ,\theta)\)-d-V-univex functions ⋮ Sufficiency and duality in multiobjective programming under generalized type I functions ⋮ Second order \((F, \alpha , \rho , d)\)-convexity and duality in multiobjective programming ⋮ Second-Order Duality for Nondifferentiable Multiobjective Programming Problems

Cites Work

• Sufficiency and duality in multiobjective programming involving generalized \(F\)-convex functions
• Proper efficiency and the theory of vector maximization
• Strong and Weak Convexity of Sets and Functions
• Generalization of some duality theorems in nonlinear programming

This page was built for publication: Sufficiency and Duality in Multiobjective Programming with Generalized (F, ρ)-Convexity