Some nondifferentiable multiobjective programming under generalized d-V-type-I univexity

DOI10.1016/j.cam.2008.10.023zbMath1173.90533OpenAlexW2069329523MaRDI QIDQ1023322

J. Martínez

Publication date: 11 June 2009

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2008.10.023

zbMATH Keywords

dualitymultiobjective programmingPareto efficient solutiongeneralized d-V-type-I univexity

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Fractional programming (90C32) Existence of solutions for minimax problems (49J35)

Related Items

Optimality and duality for nonsmooth multiobjective programming using G-type I functions

Cites Work

• Some nondifferentiable multiobjective programming problems
• Optimality criteria in mathematical programming involving generalized invexity
• Pre-invex functions in multiple objective optimization
• On sufficiency of the Kuhn-Tucker conditions
• On multiple-objective optimization with generalized univexity
• Optimality and duality with generalized convexity
• Generalized V-univexity type-I for multiobjective programming with \(n\)-set functions
• What is invexity?
• Necessary and sufficient conditions in constrained optimization
• Invex functions and constrained local minima
• On generalised convex mathematical programming
• Generalized invexity and duality in multiobjective programming problems
• Multiobjective programming under generalized type I invexity
• Multiobjective programming under \(d\)-invexity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item